835 search results - page 2 / 167 » Adaptive Bound Optimization for Online Convex Optimization |
CORR
2006
Springer
14 years 9 months ago
2006
Springer
This paper describes a general framework for converting online game playing algorithms into constrained convex optimization algorithms. This framework allows us to convert the wel...
COLT
2010
Springer
14 years 7 months ago
2010
Springer
We study the regret of an online learner playing a multi-round game in a Banach space B against an adversary that plays a convex function at each round. We characterize the minima...
COLT
2006
Springer
15 years 1 months ago
2006
Springer
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...
84
Voted
NIPS
2008
14 years 11 months ago
2008
We describe a primal-dual framework for the design and analysis of online strongly convex optimization algorithms. Our framework yields the tightest known logarithmic regret bound...
CDC
2010
IEEE
14 years 4 months ago
2010
IEEE
Online Convex Programming (OCP) is a recently developed model of sequential decision-making in the presence of time-varying uncertainty. In this framework, a decisionmaker selects ...