On the importance of small coordinate projections

Journal of Machine Learning Research

Volumn 5, Issue , 2004, Pages 219-238

  Mendelson, Shahar ^a   Philips, Petra ^a  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

Coordinate projections; Data dependent complexities; Generalization bounds; Statistical learning theory

Indexed keywords

ARTIFICIAL INTELLIGENCE;

COORDINATE PROJECTIONS; DATA DEPENDENT; FUNCTION CLASS; GENERALIZATION BOUND; GEOMETRIC PROPERTIES; HIGH PROBABILITY; SHARP GENERALIZATION; STATISTICAL LEARNING THEORY;

SOFTWARE ENGINEERING;

EID: 84897541071     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Article

References (23)

1. N. Alon, S. Ben-David, N. Cesa-Bianchi, and D. Haussler. Scale-sensitive dimensions, uniform convergence, and learnability. Journal of the ACM, vol. 44(4), 615-631, 1997.
2. P. L. Bartlett, O. Bousquet, and S. Mendelson. Local Rademacher complexities. The Annals of Statistics, 2004, to appear.
3. P. L. Bartlett, M. I. Jordan, and J. D. McAuliffe. Convexity, classification, and risk bounds. Technical Report 638, Department of Statistics, UC Berkeley, 2003.
4. S. Boucheron, G. Lugosi, and P. Massart. Concentration inequalities using the entropy method. The Annals of Probability, vol 31(3), 1583-1614, 2003.
5. O. Bousquet. A Bennett concentration inequality and its application to suprema of empirical processes. Comptes-Rendus de l'Académie Scientifique de Paris, Ser. I, 334, 495-500, 2002.
6. A. H. Cannon, J. M. Ettinger, D. R. Hush, and J. C. Scovel. Machine learning with data dependent hypothesis classes. Journal of Machine Learning Research, 2, 335-358, 2002.
7. Y. Gat. A bound concerning the generalization ability of a certain class of learning algorithms. Technical Report 548, UC Berkeley, March 1999.
8. R. Herbrich and R. C. Williamson. Algorithmic luckiness. Journal of Machine Learning Research, 3, 175-212, 2002.
9. W. B. Johnson and G. Schechtman. A remark on Talagrand's deviation inequality for Rademacher functions. In Functional Analysis (Austin, TX, 1987/1989), Lecture Notes in Mathematics 1470, 72-77, Springer, 1991.
10. M. Ledoux. The concentration of measure phenomenon. Mathematical Surveys and Monographs, Vol 89, AMS, 2001.
11. W. S. Lee, P. L. Bartlett, and R. C. Williamson. The importance of convexity in learning with squared loss. IEEE Transactions on Information Theory, 44(5), 1974-1980, 1998.
12. C. McDiarmid. On the method of bounded differences. In Surveys in Combinatorics, London Mathematical Society Lecture Note Series 141, 148-188, Cambridge University Press, 1989.
13. S. Mendelson. Rademacher averages and phase transitions in Glivenko-Cantelli classes. IEEE Transactions on Information Theory, 48(1), 251-263, 2002a.
14. S. Mendelson. Improving the sample complexity using global data. IEEE Transactions on Information Theory, 48(7), 1977-1991, 2002b.
15. S. Mendelson. A few notes on Statistical Learning Theory. In Proceedings of the Machine Learning Summer School, Canberra 2002, S. Mendelson and A. J. Smola (Eds.), Lecture Notes in Computer Sciences LNCS 2600, 1-40, Springer, 2003.
16. S. Mendelson and P. Philips. Random subclass bounds. In Proceedings of the 16th Annual Conference on Computational Learning Theory, 329-343, Springer, 2003.
17. S. Mendelson and R. Vershynin. Entropy and the combinatorial dimension. Inventiones Mathematicae, 152, 37-55, 2003.
18. V. D. Milman and G. Schechtman. Asymptotic Theory of Finite Dimensional Normed Spaces. Lecture Notes in Mathematics 1200, Springer, 2001.
19. G. Pisier. The Volume of Convex Bodies and Banach Space Geometry. Cambridge University Press, 1989.
20. J. Shawe-Taylor, P. L. Bartlett, R. C. Williamson, and M. Anthony. Structural risk minimization over data-dependent hierarchies. IEEE Transactions on Information Theory, 44(5), 1926-1940, 1998.
21. M. Talagrand. Majorizing measures: The generic chaining. The Annals of Probability, 24, 1049-1103, 1996.
22. M. Talagrand. Concentration of measure and isoperimetric inequalities in product spaces. Publications Mathématiques de l'I. H. E. S. 81, 73-205, 1995.
23. V. Vapnik and A. Chervonenkis. On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and its Applications, 16(2), 264-280, 1971.