3049 search results - page 45 / 610 » On the Convergence of Bound Optimization Algorithms |
153
click to vote
COLT
2010
Springer
14 years 12 months ago
2010
Springer
Bandit convex optimization is a special case of online convex optimization with partial information. In this setting, a player attempts to minimize a sequence of adversarially gen...
106
click to vote
ICASSP
2008
IEEE
15 years 8 months ago
2008
IEEE
The average consensus problem in the distributed signal processing context is addressed by linear iterative algorithms, with asymptotic convergence to the consensus. The convergen...
110
click to vote
SODA
2008
ACM
15 years 3 months ago
2008
ACM
Abstract Ilan Gronau Shlomo Moran Sagi Snir Phylogenetic reconstruction is the problem of reconstructing an evolutionary tree from sequences corresponding to leaves of that tree. ...
113
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...
119
click to vote
LAMAS
2005
Springer
15 years 7 months ago
2005
Springer
We present a new multiagent learning algorithm, RVσ(t), that builds on an earlier version, ReDVaLeR . ReDVaLeR could guarantee (a) convergence to best response against stationary ...