3049 search results - page 4 / 610 » On the Convergence of Bound Optimization Algorithms |
NIPS
2008
13 years 9 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...
TIT
2008
13 years 7 months ago
2008
Abstract--Max-product "belief propagation" (BP) is an iterative, message-passing algorithm for finding the maximum a posteriori (MAP) assignment of a discrete probability...
JOTA
2010
13 years 5 months ago
2010
We consider a distributed multi-agent network system where the goal is to minimize a sum of agent objective functions subject to a common set of constraints. For this problem, we p...
NIPS
2008
13 years 9 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...
TIT
2002
13 years 7 months ago
2002
Abstract--The Lagrangian formulation of variable-rate vector quantization is known to yield useful necessary conditions for quantizer optimality and generalized Lloyd algorithms fo...