On Noise-Tolerant Learning of Sparse Parities and Related Problems

Abstract

We consider the problem of learning sparse parities in the presence of noise. For learning parities on r out of n variables, we give an algorithm that runs in time $\mathrm{poly}\left(\log \frac{1}{\delta}, \frac{1}{1-2\eta}\right) n^{ \left(1+(2\eta)^2+ o(1)\right)r/2}$ and uses only $\frac{r \log(n/\delta) \omega(1)}{(1 - 2\eta)^2}$ samples in the random noise setting under the uniform distribution, where η is the noise rate and δ is the confidence parameter. From previously known results this algorithm also works for adversarial noise and generalizes to arbitrary distributions. Even though efficient algorithms for learning sparse parities in the presence of noise would have major implications to learning other hypothesis classes, our work is the first to give a bound better than the brute-force O ( n ^ r ). As a consequence, we obtain the first nontrivial bound for learning r -juntas in the presence of noise, and also a small improvement in the complexity of learning DNF, under the uniform distribution.