52 search results - page 1 / 11 » Approximate Convex Optimization by Online Game Playing |
CORR
2006
Springer
13 years 5 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...
STOC
2007
ACM
14 years 5 months ago
2007
ACM
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...
ECCC
2006
13 years 4 months ago
2006
We introduce a new algorithm and a new analysis technique that is applicable to a variety of online optimization scenarios, including regret minimization for Lipschitz regret func...
COLT
2010
Springer
13 years 2 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...
JMLR
2010
12 years 11 months ago
2010
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...