Optimal rates of aggregation in classification under low noise assumption

18Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.

Abstract

In the same spirit as Tsybakov, we define the optimality of an aggregation procedure in the problem of classification. Using an aggregate with exponential weights, we obtain an optimal rate of convex aggregation for the hinge risk under the margin assumption. Moreover, we obtain an optimal rate of model selection aggregation under the margin assumption for the excess Bayes risk. © 2007 ISI/BS.

Cite

CITATION STYLE

APA

Lecué, G. (2007). Optimal rates of aggregation in classification under low noise assumption. Bernoulli, 13(4), 1000–1022. https://doi.org/10.3150/07-BEJ6044

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free