83 search results - page 8 / 17 » Online Learning: Beyond Regret |
ECCC
2007
13 years 7 months ago
2007
We study the notion of learning in an oblivious changing environment. Existing online learning algorithms which minimize regret are shown to converge to the average of all locally...
EWRL
2008
13 years 9 months ago
2008
Abstract. We consider a control problem where the decision maker interacts with a standard Markov decision process with the exception that the reward functions vary arbitrarily ove...
COLT
2010
Springer
13 years 5 months ago
2010
Springer
We present a new family of subgradient methods that dynamically incorporate knowledge of the geometry of the data observed in earlier iterations to perform more informative gradie...
PODC
2009
ACM
14 years 8 months ago
2009
ACM
We analyze the performance of protocols for load balancing in distributed systems based on no-regret algorithms from online learning theory. These protocols treat load balancing a...
ICML
2006
IEEE
14 years 8 months ago
2006
IEEE
We experimentally study on-line investment algorithms first proposed by Agarwal and Hazan and extended by Hazan et al. which achieve almost the same wealth as the best constant-re...