Polynomial regression under arbitrary product distributions

21st Annual Conference on Learning Theory, COLT 2008

Volumn , Issue , 2008, Pages 193-204

  Blais, Eric ^a   O'Donnell, Ryan ^a   Wimmer, Karl ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARBITRARY NOISE; GAUSSIANS; NOISE SENSITIVITY; ORTHOGONAL DECOMPOSITION; POLYNOMIAL REGRESSION; PRODUCT DISTRIBUTIONS; TECHNICAL INNOVATION; THRESHOLD FUNCTIONS;

PROBABILITY DISTRIBUTIONS;

LEARNING ALGORITHMS;

EID: 78149346647     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. Itai Benjamini, Gil Kalai, and Oded Schramm. Noise sensitivity of Boolean functions and applications to percolation. Publ. Math. de l'IHÉS, 90(1): 5-43, 1999.
2. Corinna Cortes and Vladimir Vapnik. Supportvector networks. Machine Learning, 20(3): 273-297, 1995.
3. Merrick Furst, Jeffrey Jackson, and Sean Smith. Improved learning of AC° functions. In Proc. 4th Workshop on Comp. Learning Theory, pages 317-325, 1991.
4. Jonathan Feldman, Ryan O'Donnell, and Rocco Servedio. Learning mixtures of product distributions over discrete domains. In Proc. 46th IEEE Symp. on Foundations of Comp. Sci., pages 501-510, 2005.
5. Jonathan Feldman, Ryan O'Donnell, and Rocco Servedio. Pac learning mixtures of gaussians with no separation assumption. In Proc. 19th Workshop on Comp. Learning Theory, pages 20-34, 2006.
6. Venkatesan Guruswami and Prasad Raghavendra. Hardness of learning halfspaces with noise. In Proc. 47th IEEE Symp. on Foundations of Comp. Sci., pages 543-552, 2006.
7. J. Håstad. A slight sharpening of LMN. J. of Computing and Sys. Sci., 63(3): 498-508, 2001.
8. Wassily Hoeffding. A class of statistics with asymptotically normal distribution. Ann. Math. Stat., 19(3): 293-325, 1948.
9. Adam Kalai. Machine learning theory course notes. http://www.cc.gatech. edu/~atk/teaching/mlt06/lectures/mlt-06-10.pdf, 2006.
10. Adam Kalai, Adam Klivans, Yishay Mansour, and Rocco Servedio. Agnostically learning halfspaces. In Proc. 46th IEEE Symp. on Foundations of Comp. Sci., pages 11-20, 2005.
11. Adam Klivans, Ryan O'Donnell, and Rocco Servedio. Learning intersections and thresholds of halfspaces. J. of Computing and Sys. Sci., 68(4): 808-840, 2004.
12. Samuel Karlin and Yosef Rinott. Applications of Anova type decompositions for comparisons of conditional variance statistics including jackknife estimates. Ann. Stat., 10(2): 485-501, 1982.
13. Michael Kearns, Robert Schapire, and Linda Sellie. Toward efficient agnostic learning. Machine Learning, 17(2): 115-141, 1994.
14. Wee Sun Lee, Peter Bartlett, and Robert Williamson. On efficient agnostic learning of linear combinations of basis functions. In Proc. 8th Workshop on Comp. Learning Theory, pages 369-376, 1995.
15. Nathan Linial, Yishay Mansour, and Noam Nisan. Constant depth circuits, Fourier transform, and learnability. Journal of the ACM, 40(3): 607-620, 1993.
16. Elchanan Mossel, Ryan O'Donnell, and Krzysztof Oleszkiewicz. Noise stability of functions with low influences: invariance and optimality. In Proc. 46th IEEE Symp. on Foundations of Comp. Sci., pages 21-30, 2005.
17. Marvin Minsky and Symour Papert. Perceptrons. MIT Press, 1969.
18. Ryan O'Donnell. Computational aspects of noise sensitivity. PhD thesis, MIT, 2003.
19. Ryan O'Donnell and Rocco Servedio. New degree bounds for polynomial threshold functions. In Proc. 35th ACM Symp.on the Theory of Computing, pages 325-334, 2003.
20. Y. Peres. Noise stability of weighted majority. arXiv:math/0412377v1, 2004.
21. J. Michael Steele. An Efron-Stein inequality for nonsymmetric statistics. Ann. Stat., 14(2): 753-758, 1986.
22. Leslie Valiant. A theory of the learnable. Comm. of the ACM, 27(11): 1134-1142, 1984.
23. Richard von Mises. On the asymptotic distribution of differentiable statistical functions. Ann. Math. Stat., 18(3): 309-348, 1947.