39 search results - page 5 / 8 » colt 2010 |
130
Voted
COLT
2010
Springer
14 years 10 months ago
2010
Springer
Bandit convex optimization is a special case of online convex optimization with partial information. In this setting, a player attempts to minimize a sequence of adversarially gen...
110
click to vote
COLT
2010
Springer
14 years 10 months ago
2010
Springer
Multiarmed bandit problem is a typical example of a dilemma between exploration and exploitation in reinforcement learning. This problem is expressed as a model of a gambler playi...
107
Voted
COLT
2010
Springer
14 years 10 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...
87
Voted
COLT
2010
Springer
14 years 10 months ago
2010
Springer
In learning, a semantic or behavioral U-shape occurs when a learner rst learns, then unlearns, and, nally, relearns, some target concept (on the way to success). Within the framew...
104
Voted
COLT
2010
Springer
14 years 10 months ago
2010
Springer
We consider the problem of planning in a stochastic and discounted environment with a limited numerical budget. More precisely, we investigate strategies exploring the set of poss...