Learning and smoothed analysis

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

Volumn , Issue , 2009, Pages 395-404

  Kalai, Adam Tauman ^a   Samorodnitsky, Alex ^b   Teng, Shang Hua ^a,c  

^a MICROSOFT RESEARCH   (United States)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^c UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FOURIER COEFFICIENTS; FOURIER SPECTRA; HYPERCUBE; JACKSON; MEMBERSHIP QUERY; NEW MODEL; PAC LEARNING; POLYNOMIAL-TIME; PRODUCT DISTRIBUTIONS; SMOOTHED ANALYSIS; UNIFORM DISTRIBUTION;

BOOLEAN FUNCTIONS; COMPUTER SCIENCE; DECISION TREES; FIBER OPTIC CHEMICAL SENSORS; POLYNOMIAL APPROXIMATION;

LEARNING ALGORITHMS;

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

References (16)

1. J. Arpe and E. Mossel, "Multiple random oracles are better than one," CoRR, vol. abs/0804.3817, 2008.
2. L. Bazzi, "Polylogarithmic independence can fool dnf formulas," in FOCS. IEEE Computer Society, 2007, pp. 63-73.
3. J. Bourgain, "On the distribution of polynomials on high-dimensional convex sets," in Geometric aspects of functional analysis (1989-90), ser. Lecture Notes in Math. Berlin: Springer, 1991, vol. 1469, pp. 127-137.
4. n," Math. Res. Lett., vol. 8, no. 3, pp. 233-248, 2001.
5. P. Gopalan, A. T. Kalai, and A. R. Klivans, "Agnostically learning decision trees," in Proceedings of the 40th annual ACM symposium on Theory of computing. New York, NY, USA: ACM, 2008, pp. 527-536.
6. J. Jackson, "An efficient membership-query algorithm for learning DNF with respect to the uniform distribution," Journal of Computer and System Sciences, vol. 55, pp. 414-440, 1997.
7. J. Jackson and R. Servedio, "Learning random log-depth decision trees under the uniform distribution," in Proceedings of the 16th Annual Conf. on Computational Learning Theory and 7th Kernel Workshop, 2003, pp. 610-624.
8. A. T. Kalai, V. Kanade, and Y. Mansour, "Reliable agnostic learning," in Proc. Conf. on Learning Theory (COLT'09), 2009.
9. M. Kearns, R. Schapire, and L. Sellie, "Toward Efficient Agnostic Learning," Machine Learning, vol. 17, no. 2/3, pp. 115-141, 1994.
10. E. Kushilevitz and Y. Mansour, "Learning decision trees using the Fourier spectrum," SIAM Journal of Computing, vol. 22(6), pp. 1331-1348, 1993.
11. D. Polymath, "A new proof of the density hales-jewett theorem," 2009, presentation by Ryan O'Donell at Microsoft Research New England.
12. J. B. Rosen, "The gradient projection method for nonlinear programming. part i. linear constraints," Journal of the Society for Industrial and Applied Mathematics, vol. 8, no. 1, pp. 181-217, 1960.
13. D. A. Spielman and S.-H. Teng, "Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time," J. ACM, vol. 51, no. 3, pp. 385-463, 2004.
14. R. S. Sutton and C. J. Matheus, "Learning polynomial functions by feature construction," in ML, 1991, pp. 208-212.
15. L. Valiant, "A theory of the learnable," Communications of the ACM, vol. 27, no. 11, pp. 1134-1142, 1984.
16. th Intl. Conf. on Machine Learning (ICML'03), 2003, pp. 928-936.