97 search results - page 4 / 20 » Logarithmic Regret Algorithms for Online Convex Optimization |
NIPS
2007
13 years 8 months ago
2007
We study the rates of growth of the regret in online convex optimization. First, we show that a simple extension of the algorithm of Hazan et al eliminates the need for a priori k...
ICML
2008
IEEE
14 years 7 months ago
2008
IEEE
Quite a bit is known about minimizing different kinds of regret in experts problems, and how these regret types relate to types of equilibria in the multiagent setting of repeated...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We consider the classical multi-armed bandit problem with Markovian rewards. When played an arm changes its state in a Markovian fashion while it remains frozen when not played. Th...
ICML
2009
IEEE
14 years 7 months ago
2009
IEEE
The kernel Perceptron is an appealing online learning algorithm that has a drawback: whenever it makes an error it must increase its support set, which slows training and testing ...
COLT
2010
Springer
13 years 4 months ago
2010
Springer
We develop an online algorithm called Component Hedge for learning structured concept classes when the loss of a structured concept sums over its components. Example classes inclu...