159 search results - page 4 / 32 » Geometric Bounds for Generalization in Boosting |
COMPGEOM
1993
ACM
13 years 9 months ago
1993
ACM
We consider graphs such as the minimum spanning tree, minimum Steiner tree, minimum matching, and traveling salesman tour for n points in the d-dimensional unit cube. For each of ...
ICML
2009
IEEE
14 years 6 months ago
2009
IEEE
We present a general PAC-Bayes theorem from which all known PAC-Bayes risk bounds are obtained as particular cases. We also propose different learning algorithms for finding linea...
TIT
2002
13 years 5 months ago
2002
Generalization bounds depending on the margin of a classifier are a relatively recent development. They provide an explanation of the performance of state-of-the-art learning syste...
ML
2002
ACM
13 years 5 months ago
2002
ACM
In this paper we examine ensemble methods for regression that leverage or "boost" base regressors by iteratively calling them on modified samples. The most successful lev...
COLT
2008
Springer
13 years 7 months ago
2008
Springer
Much attention has been paid to the theoretical explanation of the empirical success of AdaBoost. The most influential work is the margin theory, which is essentially an upper bou...