154 search results - page 1 / 31 » On Boosting with Polynomially Bounded Distributions |
JMLR
2002
13 years 4 months ago
2002
We construct a framework which allows an algorithm to turn the distributions produced by some boosting algorithms into polynomially smooth distributions (w.r.t. the PAC oracle...
COLT
1999
Springer
13 years 9 months ago
1999
Springer
We propose a new boosting algorithm. This boosting algorithm is an adaptive version of the boost by majority algorithm and combines bounded goals of the boost by majority algorith...
ICML
1999
IEEE
14 years 5 months ago
1999
IEEE
AdaCost, a variant of AdaBoost, is a misclassification cost-sensitive boosting method. It uses the cost of misclassifications to update the training distribution on successive boo...
CORR
2011
Springer
12 years 8 months ago
2011
Springer
The AdaBoost algorithm was designed to combine many “weak” hypotheses that perform slightly better than random guessing into a “strong” hypothesis that has very low error....
ALT
2010
Springer
13 years 6 months ago
2010
Springer
Known algorithms for learning PDFA can only be shown to run in time polynomial in the so-called distinguishability