Embedding Hard Learning Problems Into Gaussian Space

@article{Klivans2014EmbeddingHL,
  title={Embedding Hard Learning Problems Into Gaussian Space},
  author={Adam R. Klivans and Pravesh Kothari},
  journal={Electronic Colloquium on Computational Complexity (ECCC)},
  year={2014},
  volume={21},
  pages={63}
}
We give the first representation-independent hardness result for agnostically learning halfspaces with respect to the Gaussian distribution. We reduce from the problem of learning sparse parities with noise with respect to the uniform distribution on the hypercube (sparse LPN), a notoriously hard problem in computer science and show that any algorithm for agnostically learning halfspaces requires n (1/ )) time, ruling out a polynomial time algorithm for the problem. As far as we are aware, this… CONTINUE READING
Highly Cited
This paper has 25 citations. REVIEW CITATIONS

Similar Papers

Loading similar papers…