Discussion of ``2004 IMS Medallion Lecture: Local Rademacher complexities and oracle inequalities in risk minimization'' by V. Koltchinskii

Abstract

Discussion of ``2004 IMS Medallion Lecture: Local Rademacher complexities and oracle inequalities in risk minimization'' by V. Koltchinskii [arXiv:0708.0083]

Published at http://dx.doi.org/10.1214/009053606000001037 in the Annals of Statistics (http://www.imstat.org/aos/) by the Institute of Mathematical Statistics (http://www.imstat.org)

References in corpus (2)

• Risk bounds for statistical learning
• On weakly bounded empirical processes

Cited by in corpus (10)

• A survey of cross-validation procedures for model selection
• Optimal cross-validation in density estimation with the $L^2$-loss
• Convergence rates of Kernel Conjugate Gradient for random design regression
• Minimal penalties and the slope heuristics: a survey
• Optimal learning rates for Kernel Conjugate Gradient regression
• Classification algorithms using adaptive partitioning
• Margin-adaptive model selection in statistical learning
• Lepskii Principle in Supervised Learning
• Refined Error Bounds for Several Learning Algorithms
• An efficient algorithm for T-estimation