Sciweavers

21 search results - page 1 / 5
» Suboptimality of Penalized Empirical Risk Minimization in Cl...
Sort
View
JMLR
2010
161views more  JMLR 2010»
12 years 11 months ago
Empirical Bernstein Boosting
Concentration inequalities that incorporate variance information (such as Bernstein's or Bennett's inequality) are often significantly tighter than counterparts (such as...
Pannagadatta K. Shivaswamy, Tony Jebara
JMLR
2006
107views more  JMLR 2006»
13 years 4 months ago
Consistency of Multiclass Empirical Risk Minimization Methods Based on Convex Loss
The consistency of classification algorithm plays a central role in statistical learning theory. A consistent algorithm guarantees us that taking more samples essentially suffices...
Di-Rong Chen, Tao Sun
JMLR
2010
105views more  JMLR 2010»
12 years 11 months ago
Classification Methods with Reject Option Based on Convex Risk Minimization
In this paper, we investigate the problem of binary classification with a reject option in which one can withhold the decision of classifying an observation at a cost lower than t...
Ming Yuan, Marten H. Wegkamp
COLT
2004
Springer
13 years 8 months ago
Oracle Bounds and Exact Algorithm for Dyadic Classification Trees
This paper introduces a new method using dyadic decision trees for estimating a classification or a regression function in a multiclass classification problem. The estimator is bas...
Gilles Blanchard, Christin Schäfer, Yves Roze...