The Annals of Statistics

Discussion: Local Rademacher complexities and oracle inequalities in risk minimization

A. B. Tsybakov

Full-text: Open access

Article information

Source
Ann. Statist., Volume 34, Number 6 (2006), 2681-2687.

Dates
First available in Project Euclid: 23 May 2007

Permanent link to this document
https://projecteuclid.org/euclid.aos/1179935060

Digital Object Identifier
doi:10.1214/009053606000001064

Mathematical Reviews number (MathSciNet)
MR2329462

Citation

Tsybakov, A. B. Discussion: Local Rademacher complexities and oracle inequalities in risk minimization. Ann. Statist. 34 (2006), no. 6, 2681--2687. doi:10.1214/009053606000001064. https://projecteuclid.org/euclid.aos/1179935060


Export citation

References

  • Audibert, J.-Y. and Tsybakov, A. (2007). Fast learning rates for plug-in classifiers under the margin condition. Ann. Statist. 35. To appear. Available at hal.ccsd.cnrs.fr/ccsd-00005882
  • Catoni, O. (2004). Statistical Learning Theory and Stochastic Optimization. Ecole d'Eté de Probabilités de Saint-Flour 2001. Lecture Notes in Math. 1851. Springer, New York.
  • Juditsky, A., Nazin, A., Tsybakov, A. and Vayatis, N. (2005). Recursive aggregation of estimators via the mirror descent algorithm with averaging. Problems Inform. Transmission 41 368--384.
  • Juditsky, A, Rigollet, Ph. and Tsybakov, A. (2005). Learning by mirror averaging. Preprint, Laboratoire de Probabilités et Modèles Aléatoires, Universités Paris 6--Paris 7. Available at hal.ccsd.cnrs.fr/ccsd-00014097.
  • Lecué, G. (2006) Optimal rates of aggregation in classification. Available at hal.ccsd.cnrs.fr/ccsd-00021233.
  • Tsybakov, A. B. (2003). Optimal rates of aggregation. In Learning Theory and Kernel Methods. Lecture Notes in Comput. Sci. 2777 303--313. Springer, Heidelberg.