56 search results - page 3 / 12 » Minimizing Convex Functions with Bounded Perturbations |
CVPR
2009
IEEE
15 years 26 days ago
2009
IEEE
In this work we propose a convex relaxation approach
for computing minimal partitions. Our approach is based
on rewriting the minimal partition problem (also known as
Potts mode...
COLT
2010
Springer
13 years 3 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...
ICASSP
2009
IEEE
14 years 15 days ago
2009
IEEE
—We consider constrained minimization of a sum of convex functions over a convex and compact set, when each component function is known only to a specific agent in a timevarying...
NIPS
2008
13 years 7 months ago
2008
Large-margin structured estimation methods minimize a convex upper bound of loss functions. While they allow for efficient optimization algorithms, these convex formulations are n...
NIPS
2004
13 years 7 months ago
2004
In the multi-armed bandit problem, an online algorithm must choose from a set of strategies in a sequence of n trials so as to minimize the total cost of the chosen strategies. Wh...