3049 search results - page 5 / 610 » On the Convergence of Bound Optimization Algorithms |
CORR
2011
Springer
12 years 11 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....
JMLR
2006
13 years 7 months ago
2006
We give a review of various aspects of boosting, clarifying the issues through a few simple results, and relate our work and that of others to the minimax paradigm of statistics. ...
ISBI
2004
IEEE
14 years 8 months ago
2004
IEEE
We present a fully four-dimensional, globally convergent, incremental gradient algorithm to estimate the continuous-time tracer density from list mode positron emission tomography...
ICML
2003
IEEE
14 years 8 months ago
2003
IEEE
We study a class of overrelaxed bound optimization algorithms, and their relationship to standard bound optimizers, such as ExpectationMaximization, Iterative Scaling, CCCP and No...
GECCO
2009
Springer
14 years 2 months ago
2009
Springer
Following a number of recent papers investigating the possibility of optimal comparison-based optimization algorithms for a given distribution of probability on fitness functions...