835 search results - page 16 / 167 » Adaptive Bound Optimization for Online Convex Optimization |
JCSS
2008
13 years 10 months ago
2008
PAMI
2011
13 years 5 months ago
2011
—We propose a convex formulation for silhouette and stereo fusion in 3D reconstruction from multiple images. The key idea is to show that the reconstruction problem can be cast a...
SIAMJO
2002
13 years 10 months ago
2002
We give a pattern search method for nonlinearly constrained optimization that is an adaption of a bound constrained augmented Lagrangian method first proposed by Conn, Gould, and T...
COLT
2010
Springer
13 years 8 months ago
2010
Springer
Multiarmed bandit problem is a typical example of a dilemma between exploration and exploitation in reinforcement learning. This problem is expressed as a model of a gambler playi...
COLT
2007
Springer
14 years 4 months ago
2007
Springer
We give an algorithm for the on-line learning of permutations. The algorithm maintains its uncertainty about the target permutation as a doubly stochastic weight matrix, and makes...