Cryptographic hardness for learning intersections of halfspaces

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2006, Pages 553-562

  Klivans, Adam R ^a   Sherstov, Alexander A ^a  

^a University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; LEARNING SYSTEMS; POLYNOMIALS;

INDEPENDENT VECTOR PROBLEM; LOW-WEIGHT HALFSPACES; POLYNOMIAL-SIZE; QUANTUM SOLUTION;

PUBLIC KEY CRYPTOGRAPHY;

EID: 35348921036     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2006.24     Document Type: Conference Paper

References (27)

1. M. Ajtai and C. Dwork. A public-key cryptosystem with worst-case/average-case equivalence. In STOC '97: Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, pages 284-293, New York, NY, USA, 1997. ACM Press.
2. M. Alekhnovich, M. Braverman, V. Feldman, A. Klivans, and T. Pitassi. Learnability and automatizability. In Proceedings of the 45th Annual Symposium on Foundations of Computer Science (FOCS), 2004.
3. A. Beimel, F. Bergadano, N. H. Bshouty, E. Kushilevitz, and S. Varricchio. On the applications of multiplicity automata in learning. In FOCS, pages 349-358, 1996.
4. A. L. Blum and R. L. Rivest. Training a 3-node neural network is NP-complete. Neural Networks, 5:117-127, 1992.
5. L. Blum, M. Blum, and M. Shub. A simple unpredictable pseudo-random number generator. SIAM J. Comput., 15(2):364-383, 1986.
6. V. Feldman, P. Gopalan, S. Khot, and A. K. Ponnuswami. New results for learning noisy parities and halfspaces. In FOCS, October 2006. To appear.
7. M. L. Furst, J. B. Saxe, and M. Sipser. Parity, circuits, and the polynomial-time hierarchy. Mathematical Systems Theory, 17(1):13-27, 1984.
8. M. Goldmann, J. Håstad, and A. A. Razborov. Majority gates vs. general weighted threshold gates. Computational Complexity, 2:277-300, 1992.
9. M. Goldmann and M. Karpinski. Simulating threshold circuits by majority circuits. SIAM J. Comput., 27(1):230-246, 1998.
10. J. Håstad. Computational limitations of small-depth circuits. MIT Press, Cambridge, MA, USA, 1987.
11. M. Kearns and L. Valiant. Cryptographic limitations on learning boolean formulae and finite automata. J. ACM, 41(1):67-95, 1994.
12. M. Kharitonov. Cryptographic lower bounds for learnability of boolean functions on the uniform distribution. In COLT '92: Proceedings of the fifth annual workshop on Computational learning theory, pages 29-36, New York, NY, USA, 1992. ACM Press.
13. M. Kharitonov. Cryptographic hardness of distribution-specific learning. In STOC '93: Proceedings of the twentyfifth annual ACM symposium on theory of computing, pages 372-381, New York, NY, USA, 1993. ACM Press.
14. A. Klivans, R. O'Donnell, and R. Servedio. Learning intersections and thresholds of halfspaces. In Proceedings of the 43rd Annual Symposium on Foundations of Computer Science, pages 177-186, 2002.
15. A. Klivans and R. Servedio. Learning intersections of halfspaces with a margin. In Proceedings of the 17th Annual Conference on Learning Theory, pages 348-362, 2004.
16. A. Klivans and A. A. Sherstov. Improved lower bounds for learning intersections of halfspaces. In Proceedings of the 19th Annual Conference on Learning Theory, Pittsburg, USA, 2006. To appear.
17. A. Klivans and A. Shpilka. Learning arithmetic circuits via partial derivatives. In COLT: Proceedings of the Workshop on Computational Learning Theory, Morgan Kaufmann Publishers, 2003.
18. A. Klivans and D. A. Spielman. Randomness efficient identity testing of multivariate polynomials. In STOC, pages 216-223, 2001.
19. S. Kwek and L. Pitt. PAC learning intersections of half-spaces with membership queries. Algorithmica, 22(1/2):53-75, 1998.
20. Y. Mansour. Randomized interpolation and approximation of sparse polynomials. SIAM J. Comput., 24(2):357-368, 1995.
21. O. Regev. New lattice based cryptographic constructions. In STOC '03: Proceedings of the thirty-fifth annual ACM Symposium on theory of computing, pages 407-416, New York, NY, USA, 2003. ACM Press.
22. O. Regev. On lattices, learning with errors, random linear codes, and cryptography. In STOC '05: Proceedings of the thirty-seventh annual ACM Symposium on theory of computing, pages 84-93, New York, NY, USA, 2005. ACM Press.
23. R. Schapire and L. Sellie. Learning sparse multivariate polynomials over a field with queries and counterexamples. JCSS: Journal of Computer and System Sciences, 52, 1996.
24. K.-Y Siu and V. P. Roychowdhury. On optimal depth threshold circuits for multiplication and related problems. SIAM J. Discrete Math., 7(2):284-292, 1994.
25. L. G. Valiant. A theory of the learnable. Commun. ACM, 27(11):1134-1142, 1984.
26. S. Vempala. A random sampling based algorithm for learning the intersection of halfspaces. In Proceedings of the 38th Annual Symposium on Foundations of Computer Science, pages 508-513, 1997.
27. I. Wegener. Optimal lower bounds on the depth of polynomial-size threshold circuits for some arithmetic functions. Inf. Process. Lett., 46(2):85-87, 1993.