|
Results
Found 7 publication records. Showing 7 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 2 | Sham M. Kakade, Adam Tauman Kalai, Katrina Ligett |
Playing games with approximation algorithms.  |
STOC  |
2007 |
DBLP DOI BibTeX RDF |
online linear optimization, approximation algorithms, regret minimization |
| 2 | Baruch Awerbuch, Robert D. Kleinberg |
Adaptive routing with end-to-end feedback: distributed learning and geometric approaches. |
STOC |
2004 |
DBLP DOI BibTeX RDF |
multi-armed bandit problem, online decision problem, online linear optimization, routing |
| 1 | Sébastien Bubeck, Nicolò Cesa-Bianchi, Sham M. Kakade |
Towards minimax policies for online linear optimization with bandit feedback |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Shota Yasutake, Kohei Hatano, Shuji Kijima, Eiji Takimoto, Masayuki Takeda |
Online Linear Optimization over Permutations. |
ISAAC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Baruch Awerbuch, Robert Kleinberg |
Online linear optimization and adaptive routing. |
J. Comput. Syst. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter L. Bartlett, Varsha Dani, Thomas P. Hayes, Sham Kakade, Alexander Rakhlin, Ambuj Tewari |
High-Probability Regret Bounds for Bandit Online Linear Optimization. |
COLT |
2008 |
DBLP BibTeX RDF |
|
| 1 | Abraham Flaxman, Adam Tauman Kalai, H. Brendan McMahan |
Online convex optimization in the bandit setting: gradient descent without a gradient. |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #7 of 7 (100 per page; Change: )
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")