928 search results - page 13 / 186 » The Rate of Convergence of AdaBoost |
NIPS
2008
13 years 11 months ago
2008
We study the convergence and the rate of convergence of a local manifold learning algorithm: LTSA [13]. The main technical tool is the perturbation analysis on the linear invarian...
CEC
2007
IEEE
14 years 4 months ago
2007
IEEE
— We present an ant model that solves a discrete foraging problem. We describe simulations and provide a complete convergence analysis: we show that the ant population computes t...
CDC
2010
IEEE
13 years 4 months ago
2010
IEEE
The asymptotic behavior of stochastic gradient algorithms is studied. Relying on some results of differential geometry (Lojasiewicz gradient inequality), the almost sure pointconve...
ATAL
2007
Springer
14 years 4 months ago
2007
Springer
We present a simple ant model that solves a discrete foraging problem. We describe simulations and provide a complete convergence analysis: we show that the ant population compute...
ML
2002
ACM
13 years 9 months ago
2002
ACM
We examine linear program (LP) approaches to boosting and demonstrate their efficient solution using LPBoost, a column generation based simplex method. We formulate the problem as...