143 search results - page 6 / 29 » Generalization Error and Algorithmic Convergence of Median B... |
100
click to vote
ML
2002
ACM
14 years 11 months ago
2002
ACM
We consider the existence of a linear weak learner for boosting algorithms. A weak learner for binary classification problems is required to achieve a weighted empirical error on t...
ADCM
2007
14 years 11 months ago
2007
In this paper, we are interested in the analysis of regularized online algorithms associated with reproducing kernel Hilbert spaces. General conditions on the loss function and st...
104
click to vote
ICML
1998
IEEE
16 years 11 days ago
1998
IEEE
In this work, we present a new bottom-up algorithmfor decision tree pruning that is very e cient requiring only a single pass through the given tree, and prove a strong performanc...
ICML
2004
IEEE
16 years 11 days ago
2004
IEEE
Boosting is a popular approach for building accurate classifiers. Despite the initial popular belief, boosting algorithms do exhibit overfitting and are sensitive to label noise. ...
105
click to vote
SIAMMA
2011
14 years 2 months ago
2011
The reduced basis method was introduced for the accurate online evaluation of solutions to a parameter dependent family of elliptic partial differential equations. ly, it can be ...