P. Auer, N. Cesa-Bianchi, Y. Freund, and R. E. Schapire. The non-stochastic multi-armed bandit problem. SIAM J. on Computing, 32(1):48--77, 2002.  Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Online Oblivious Routing - Bansal, Blum, Chawla, Meyerson (2003) (1 citation) (Correct)
....up a (1 ffl) factor, we are able to achieve this additional guarantee, and it is in this respect that our algorithm outperforms the Ellipsoid algorithm. Note that our goals follow a classic line of research in game theory and machine learning, namely that of minimizing regret in repeated games [5, 10, 14, 9, 2]. Freund and Schapire [9] point out that the Weighted Majority (WM) algorithm of Littlestone and Warmuth [14] can be used for repeated play in any 2 player zero sum game, and will perform nearly as well as the best fixed strategy in hindsight. However, the WM algorithm involves placing weights on ....
P. Auer, N. Cesa-Bianchi, Y. Freund, and R. E. Schapire. The non-stochastic multi-armed bandit problem. SIAM Journal on Computing, 32(1):48--77, 2002.
Journal of Machine Learning Research 7 (2006) 1079--1105.. - Multi-Armed Bandit And (Correct)
No context found.
P. Auer, N. Cesa-Bianchi, Y. Freund, and R. E. Schapire. The non-stochastic multi-armed bandit problem. SIAM J. on Computing, 32(1):48--77, 2002.
Online Geometric Optimization in the Bandit - Setting Against An (Correct)
No context found.
Auer, P., Cesa-Bianchi, N., Freund, Y., Schapire, R.E.: The nonstochastic multiarmed bandit problem. SIAM Journal on Computing 32 (2002) 48--77
Workspace-based Connectivity Oracle - An Adaptive Sampling.. - Kurniawati, Hsu (Correct)
No context found.
P. Auer, N. Cesa-Bianchi, Y. Freund, and R.E. Schapire. The nonstochastic multiarmed bandit problem. SIAM J. Computing, 32(1):48--77, 2002.
From External to Internal Regret - Blum, Mansour (2004) (Correct)
No context found.
Peter Auer, Nicol`o Cesa-Bianchi, Yoav Freund, and Robert E. Schapire. The nonstochastic multiarmed bandit problem. SIAM Journal on Computing, 32(1):48--77, 2002.
Online Learning in Online Auctions - Blum, Kuma, Rudra, Wu (2003) (12 citations) (Correct)
No context found.
P. Auer, N. Cesa-Bianchi, Y. Freund, and R. E. Schapire. The nonstochastic multiarmed bandit problem. SIAM Journal on Computing, 32(1):48--77, 2002.
Online Geometric Optimization in the Bandit Setting against an .. - McMahan, Blum (2004) (Correct)
No context found.
Auer, P., Cesa-Bianchi, N., Freund, Y., Schapire, R.E.: The nonstochastic multiarmed bandit problem. SIAM Journal on Computing 32 (2002) 48-77
Online Oblivious Routing - Bansal, Blum, Chawla, Meyerson (2003) (1 citation) (Correct)
No context found.
P. Auer, N. Cesa-Bianchi, Y. Freund, and R. E. Schapire. The non-stochastic multi-armed bandit problem. SIAM Journal on Computing, 32(1):48--77, 2002.
On-line Learning with Imperfect Monitoring - Mannor, Shimkin (2003) (Correct)
No context found.
P. Auer, N. Cesa-Bianchi, Y. Freund, and R. E. Schapire. The non-stochastic multi-armed bandit problem. To appear in SIAM journal of Computation, 2002.
Lower Bounds on the Sample Complexity of Exploration in the .. - Mannor, Tsitsiklis (Correct)
No context found.
P. Auer, N. Cesa-Bianchi, Y. Freund, and R. E. Schapire. The non-stochastic multi-armed bandit problem. To appear in SIAM journal of Computation, 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC