Learning sparse polynomial functions

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2014, Pages 500-510

  Andoni, Alexandr ^a   Panigrahy, Rina ^a   Valiant, Gregory ^b   Zhang, Li ^a  

^a MSR   (United States)

^b Stanford and MSR   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

TECHNOLOGY TRANSFER;

GAUSSIAN RANDOM VARIABLE; HYPERCUBE; MULTIVARIATE POLYNOMIAL; N-DIMENSIONAL CUBES; NOISY PARITIES; RUNTIMES; SPARSE POLYNOMIALS;

POLYNOMIALS;

EID: 84902097261     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973402.37     Document Type: Conference Paper

References (31)

1. [ABW10] Benny Applebaum, Boaz Barak, and Avi Wigderson. Public-key cryptosystem from different assumptions. In Proceedings of the Symposium on Theory of Computing (STOC), 2010.
2. [Ale03] Michael Alekhnovich. More on average case vs approximation complexity. In Proceedings of the Symposium on Foundations of Computer Science (FOCS), 2003.
3. [BFJ+94] Avrim Blum, Merrick Furst, Jeffrey Jackson, Michael Kearns, Yishay Mansour, and Steven Rudich. Weakly learning dnf and characterizing statistical query learning using fourier analysis. In Proceedings of the Symposium on Theory of Computing (STOC), pages 253-262, 1994.
4. [BK97] Avrim Blum and Ravi Kannan. Learning an intersection of a constant number of halfspaces under a uniform distribution. Journal of Computer and System Sciences, 54(2):371-380, 1997.
5. [BKW03] Avrim Blum, Adam Kalai, and Hal Wasserman. Noise-tolerant learning, the parity problem, and the statistical query model. J. ACM, 50(4):506-519, 2003.
6. [CM06] Graham Cormode and S. Muthukrishnan. Combinatorial algorithms for compressed sensing. In Ann. Conf. Information Sciences and Systems, 2006.
7. [CRT06] E. Candes, J. Romberg, and T. Tao. Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information. IEEE Transactions on Information Theory, 52:489 - 509, 2006.
8. [CT06] E. Candes and T. Tao. Near optimal signal recovery from random projections: Universal encoding strategies. IEEE 'Transactions on Information Theory, 2006.
9. [DLM+07] Ilias Diakonikolas, Homin K. Lee, Kevin Matulef, Krzysztof Onak, Ronitt Rubinfeld, Rocco A. Servedio, and Andrew Wan. Testing for concise representations. In Proceedings of the Symposium on Foundations of Computer Science (FOCS), pages 549-558, 2007.
10. [Don06] D. Donoho. Compressed sensing. IEEE Transactions on Information Theory, 52(4):1289 - 1306, 2006.
11. [FGRW09] Vitaly Feldman, Venkatesan Guruswami, Prasad Raghavendra, and Yi Wu. Agnostic learning of monomials by halfspaces is hard. In Proceedings of the Symposium on Foundations of Computer Science (FOCS), pages 385-394, 2009.
12. [GLPS12] Anna C. Gilbert, Yi Li, Ely Porat, and Martin J. Strauss. Approximate sparse recovery: Optimizing time and measurements. SIAM J. Comput., 41(2):436- 453, 2012.
13. 1 norm for sparse vectors. In Allerton, 2006.
14. [GSTV07] Anna Gilbert, Martin Strauss, Joel Tropp, and Roman Vershynin. One sketch for all: Fast algorithms for compressed sensing. In Proceedings of the Symposium on Theory of Computing (STOC), pages 237-246, 2007.
15. [HKM12] Prahladh Harsha, Adam Klivans, and Raghu Meka. An invariance principle for polytopes. J. ACM, 59(29), 2012. Previously in STOC'IO.
16. [IR08] Piotr Indyk and Milan Ruzic. Near-optimal sparse recovery in the 11 norm. In Proceedings of the Symposium on Foundations of Computer Science (FOCS), pages 199-207, 2008.
17. [Kea98] Michael Kearns. Efficient noise-tolerant learning from statistical queries. J. ACM, 45(6):983-1006, 1998. Previously in STOC'93.
18. [KKMS05] Adam Kalai, Adam Klivans, Yishay Mansour, and Rocco Servedio. Agnostically learning halfspaces. In Proceedings of the Symposium on Foundations of Computer Science (FOCS), pages 11-20, 2005.
19. [KOSO8] Adam R. Klivans, Ryan O'Donnell, and Rocco A. Servedio. Learning geometric concepts via gaussian surface area. In Proceedings of the Symposium on Foundations of Computer Science (FOCS), 2008.
20. [KST09] Adam Tauman Kalai, Alex Samorodnitsky, and Shang-Hua Teng. Learning and smoothed analysis. In Proceedings of the Symposium on Foundations of Computer Science (FOCS), pages 395-404, 2009.
21. [LLS+13] Roi Livni, David Lehavi, Sagi Schein, Hila Nachliely, Shai Shalev-Shwartz, and Amir Globerson. Vanishing component analysis. In Proceedings of the 30th International Conference on Machine Learning (ICML-1S), pages 597-605, 2013.
22. [Lon95] P. Long. On the sample complexity of pac learning halfspaces against the uniform distribution. IEEE Transactions on Neural Networks, 6(6): 1556- 1559, 1995.
23. [LSS13] Roi Livni, Shai Shalev-Shwartz, and Ohad Shamir. A provably efficient algorithm for training deep networks. arXiv:1304-7045, available at http://arxiv.org/abs/1304-7045, 2013.
24. [Pei09] Chris Peikert. Public-key cryptosystems from the worst-case shortest vector problem. In Proceedings of the Symposium on Theory of Computing (STOC), 2009.
25. [PS12] Ely Porat and Martin J. Strauss. Sublinear time, measurement-optimal, sparse recovery for all. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1215-1227, 2012.
26. [Reg05] Oded 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.
27. [SS02] Bernhard Scholkopf and Alexander J. Smola. Learning with Kernels. MIT Press, Cambridge, MA, 2002.
28. [Sze89] Gabor Szego. Orthogonal Polynomials. A.M.S., 1989.
29. [Val84] Leslie Valiant. A theory of the learnable. Communications of the ACM, 27, 1984.
30. [Val 12] Gregory Valiant. Finding correlations in sub- quadratic time, with applications to learning parities and juntas with noise. In Proceedings of the Symposium on Foundations of Computer Science (FOCS), 2012.
31. [Vem97] S. Vempala. A random sampling based algorithm for learning the intersection of halfspaces. In Proceedings of the Symposium on Foundations of Computer Science (FOCS), pages 508-513, 1997.