Learning by mirror averaging - Université Pierre et Marie Curie Accéder directement au contenu
Article Dans Une Revue Annals of Statistics Année : 2008

Learning by mirror averaging

Résumé

Given a collection of $M$ different estimators or classifiers, we study the problem of model selection type aggregation, i.e., we construct a new estimator or classifier, called aggregate, which is nearly as good as the best among them with respect to a given risk criterion. We define our aggregate by a simple recursive procedure which solves an auxiliary stochastic linear programming problem related to the original non-linear one and constitutes a special case of the mirror averaging algorithm. We show that the aggregate satisfies sharp oracle inequalities under some general assumptions. The results allow one to construct in an easy way sharp adaptive nonparametric estimators for several problems including regression, classification and density estimation.
Fichier principal
Vignette du fichier
jrt3.pdf (253.56 Ko) Télécharger le fichier
Loading...

Dates et versions

hal-00014097 , version 1 (18-11-2005)
hal-00014097 , version 2 (10-04-2006)
hal-00014097 , version 3 (03-05-2006)

Identifiants

Citer

Anatoli B. Juditsky, Philippe Rigollet, Alexandre Tsybakov. Learning by mirror averaging. Annals of Statistics, 2008, 36 (5), pp.2183-2206. ⟨10.1214/07-AOS546⟩. ⟨hal-00014097v3⟩
258 Consultations
238 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More