Optimal oracle inequality for aggregation of classifiers under low noise condition

Details Optimal oracle inequality for aggregation of classifiers under low noise condition Optimal oracle inequality for aggregation of classifiers under low noise condition

2006-03-22

arxiv.org/abs/math/0603526v1

Mathematics

Statistics Theory

accepted to COLT 2006

Scientific paper

We consider the problem of optimality, in a minimax sense, and adaptivity to the margin and to regularity in binary classification. We prove an oracle inequality, under the margin assumption (low noise condition), satisfied by an aggregation procedure which uses exponential weights. This oracle inequality has an optimal residual: $(\log M/n)^{\kappa/(2\kappa-1)}$ where $\kappa$ is the margin parameter, $M$ the number of classifiers to aggregate and $n$ the number of observations. We use this inequality first to construct minimax classifiers under margin and regularity assumptions and second to aggregate them to obtain a classifier which is adaptive both to the margin and regularity. Moreover, by aggregating plug-in classifiers (only $\log n$), we provide an easily implementable classifier adaptive both to the margin and to regularity.

Affiliated with

Also associated with

No associations

Rating

Optimal oracle inequality for aggregation of classifiers under low noise condition does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Optimal oracle inequality for aggregation of classifiers under low noise condition, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimal oracle inequality for aggregation of classifiers under low noise condition will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-548683