835 search results - page 11 / 167 » Adaptive Bound Optimization for Online Convex Optimization |
COLT
2008
Springer
13 years 9 months ago
2008
Springer
We study on-line decision problems where the set of actions that are available to the decision algorithm vary over time. With a few notable exceptions, such problems remained larg...
ICML
2009
IEEE
14 years 8 months ago
2009
IEEE
Many learning algorithms rely on the curvature (in particular, strong convexity) of regularized objective functions to provide good theoretical performance guarantees. In practice...
GLVLSI
2010
IEEE
14 years 23 days ago
2010
IEEE
Meeting the temperature constraints and reducing the hot-spots are critical for achieving reliable and efficient operation of complex multi-core systems. The goal of thermal mana...
CDC
2008
IEEE
14 years 2 months ago
2008
IEEE
— In this paper we develop a new dual decomposition method for optimizing a sum of convex objective functions corresponding to multiple agents but with coupled constraints. In ou...
JCO
2006
13 years 7 months ago
2006
Consider the problem of partitioning n nonnegative numbers into p parts, where part i can be assigned ni numbers with ni lying in a given range. The goal is to maximize a Schur con...