Sciweavers

1206 search results - page 9 / 242
» Convergence analysis of online algorithms
Sort
View
UAI
2003
13 years 8 months ago
On the Convergence of Bound Optimization Algorithms
Many practitioners who use EM and related algorithms complain that they are sometimes slow. When does this happen, and what can be done about it? In this paper, we study the gener...
Ruslan Salakhutdinov, Sam T. Roweis, Zoubin Ghahra...
FOCM
2006
50views more  FOCM 2006»
13 years 7 months ago
Online Learning Algorithms
In this paper, we study an online learning algorithm in Reproducing Kernel Hilbert Spaces (RKHS) and general Hilbert spaces. We present a general form of the stochastic gradient m...
Steve Smale, Yuan Yao
ECCV
2006
Springer
14 years 9 months ago
Iterative Extensions of the Sturm/Triggs Algorithm: Convergence and Nonconvergence
We give the first complete theoretical convergence analysis for the iterative extensions of the Sturm/Triggs algorithm. We show that the simplest extension, SIESTA, converges to no...
John Oliensis, Richard Hartley
NIPS
2001
13 years 8 months ago
On the Convergence of Leveraging
We give an unified convergence analysis of ensemble learning methods including e.g. AdaBoost, Logistic Regression and the Least-SquareBoost algorithm for regression. These methods...
Gunnar Rätsch, Sebastian Mika, Manfred K. War...
SIAMJO
2002
115views more  SIAMJO 2002»
13 years 7 months ago
Superlinearly Convergent Algorithms for Solving Singular Equations and Smooth Reformulations of Complementarity Problems
We propose a new algorithm for solving smooth nonlinear equations in the case where their solutions can be singular. Compared to other techniques for computing singular solutions, ...
Alexey F. Izmailov, Mikhail V. Solodov