Rademacher complexity bounds for non-i.i.d. processes

Advances in Neural Information Processing Systems 21 - Proceedings of the 2008 Conference

Volumn , Issue , 2009, Pages 1097-1104

  Mohri, Mehryar ^a   Rostamizadeh, Afshin ^b  

^a GOOGLE INC   (United States)

^b NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SAMPLING;

COMPLEXITY BASED; COMPLEXITY BOUNDS; DATA DEPENDENT; ERROR BOUND; FINITE SAMPLES; GENERALISATION; IID PROCESS; MIXING PROCESS; RADEMACHER COMPLEXITY; TRAINING SAMPLE;

ERROR ANALYSIS;

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

References (15)

1. M. Anthony and P. Bartlett. Neural Network Learning: Theoretical Foundations. Cambridge University Press, Cambridge, UK, 1999.
2. P. L. Bartlett and S. Mendelson. Rademacher and Gaussian complexities: Risk bounds and structural results. Journal of Machine Learning Research, 3:2002, 2002.
3. A. Irle. On the consistency in nonparametric estimation under mixing assumptions. Journal of Multivariate Analysis, 60:123-147, 1997. (Pubitemid 127167517)
4. V. Koltchinskii and D. Panchenko. Rademacher processes and bounding the risk of function learning. In High Dimensional Probability II, pages 443-459. preprint, 2000.
5. V. Koltchinskii and D. Panchenko. Empirical margin distributions and bounding the generalization error of combined classifiers. Annals of Statistics, 30, 2002.
6. M. Ledoux and M. Talagrand. Probability in Banach Spaces: Isoperimetry and Processes. Springer, 1991.
7. A. Lozano, S. Kulkarni, and R. Schapire. Convergence and consistency of regularized boosting algorithms with stationary-mixing observations. Advances in Neural Information Processing Systems, 18, 2006.
8. C. McDiarmid. On the method of bounded differences. In Surveys in Combinatorics, pages 148-188. Cambridge University Press, 1989.
9. R. Meir. Nonparametric time series prediction through adaptive model selection. Machine Learning, 39(1):5-34, 2000. (Pubitemid 30588208)
10. M. Mohri and A. Rostamizadeh. Stability bounds for non-iid processes. Advances in Neural Information Processing Systems, 2007.
11. J. Shawe-Taylor and N. Cristianini. Kernel Methods for Pattern Analysis. Cambridge University Press, 2004.
12. I. Steinwart, D. Hush, and C. Scovel. Learning from dependent observations. Technical Report LA-UR-06-3507, Los Alamos National Laboratory, 2007.
13. L. G. Valiant. A theory of the learnable. ACM Press New York, NY, USA, 1984.
14. M. Vidyasagar. Learning and Generalization: with Applications to Neural Networks. Springer, 2003.
15. B. Yu. Rates of convergence for empirical processes of stationary mixing sequences. Annals Probability, 22(1):94-116, 1994.