Simultaneous adaptation to the margin and to complexity in classification
Guillaume Lecué
Abstract
We consider the problem of adaptation to the margin and to complexity in binary classification. We suggest an exponential weighting aggregation scheme. We use this aggregation procedure to construct classifiers which adapt automatically to margin and complexity. Two main examples are worked out in which adaptivity is achieved in frameworks proposed by Steinwart and Scovel [Learning Theory. Lecture Notes in Comput. Sci. 3559 (2005) 279--294. Springer, Berlin; Ann. Statist. 35 (2007) 575--607] and Tsybakov [Ann. Statist. 32 (2004) 135--166]. Adaptive schemes, like ERM or penalized ERM, usually involve a minimization step. This is not the case for our procedure.
Create a lesson
Related papers
On diagonal sections of Markov products of copulas
Roman Drnovšek, Damjana Kokol Bukovšek, Nik Stopar
Beyond Discrepancy: Oracle Drift in Nonstationary Weighted Risk Minimization
Tobias Brock, Thomas Nagler
Estimating ratio of variance components in a balanced one-way random effect model
Somnath Mondal, Lakshmi Kanta Patra
Brown's loss function and estimation of the scale parameter and the entropy in scale mixture models with unknown location
Stavros Kourouklis
Finite-Sample Bounds for Fréchet Means of Dependent Data in Metric Spaces with Curvature Bounded Above
Zoraida F. Rico, Christof Schötz
On Eigenvector Statistics of Large-Dimensional Sample Covariance Matrices with Applications
Weiming Li, Zeng Li, Qinwen Wang