1206 search results - page 3 / 242 » Convergence analysis of online algorithms |
NIPS
2008
13 years 7 months ago
2008
This paper examines the generalization properties of online convex programming algorithms when the loss function is Lipschitz and strongly convex. Our main result is a sharp bound...
CEC
2007
IEEE
14 years 15 days 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...
COLT
2008
Springer
13 years 8 months ago
2008
Springer
Standard no-internal-regret (NIR) algorithms compute a fixed point of a matrix, and hence typically require O(n3 ) run time per round of learning, where n is the dimensionality of...
IJCV
2006
13 years 6 months ago
2006
The computation of a rigid body transformation which optimally aligns a set of measurement points with a surface and related registration problems are studied from the viewpoint o...
TSP
2010
13 years 25 days ago
2010
The strong cross-correlation that exists between the two input audio channels makes the problem of stereophonic acoustic echo cancellation (AEC) complex and challenging to solve. R...