Distribution-Free Junta Testing
summary
Shows nonadaptive distribution-free junta testing needs exponential queries and gives an efficient adaptive alternative: a 2^{Ω(k)} lower bound comes from a yes/no distribution-of-(distribution,function) construction that places uniform mass on ~2^k points and plants large Hamming-ball construction differences so samples look identical and nonadaptive queries can’t find disagreeing pairs. Adaptivity yields a one-sided tester that uses O(k^2/ε) queries (poly(k)/ε, sketched via block-wise binary search, maintaining witness X/Y pairs per block and running uniform-case 1-junta subtests to refine blocks).
AI-written summary · about
chapters (16)
- 0:00Introduction
- 0:46Testing Algorithm
- 1:10Uniform Distribution Model
- 5:51Background
- 7:11Results
- 10:25Lower Bound
- 14:47Intuition
- 16:26Adaptive Algorithm
- 17:17Simplified Algorithm
- 19:25Query Complexity
- 21:01Simple Variant
- 21:58Future Work
- 23:55Algorithm Setup
- 25:53Defining Relevant Variables
- 28:12Uniform Distribution Testing
- 29:41Future Directions
