97 search results - page 7 / 20 » Logarithmic Regret Algorithms for Online Convex Optimization |
OSDI
2008
ACM
14 years 8 months ago
2008
ACM
Internet routing is mostly based on static information-it's dynamicity is limited to reacting to changes in topology. Adaptive performance-based routing decisions would not o...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
The online learning problem requires a player to iteratively choose an action in an unknown and changing environment. In the standard setting of this problem, the player has to ch...
ANOR
2010
13 years 6 months ago
2010
This paper considers online stochastic optimization problems where uncertainties are characterized by a distribution that can be sampled and where time constraints severely limit t...
JMLR
2010
13 years 2 months ago
2010
Bandit algorithms are concerned with trading exploration with exploitation where a number of options are available but we can only learn their quality by experimenting with them. ...
CPAIOR
2006
Springer
13 years 11 months ago
2006
Springer
This paper considers online stochastic reservation problems, where requests come online and must be dynamically allocated to limited resources in order to maximize profit. Multi-k...