Efficient optimal learning for contextual bandits

Proceedings of the 27th Conference on Uncertainty in Artificial Intelligence, UAI 2011

Volumn , Issue , 2011, Pages 169-178

  Dudik, Miroslav ^a   Hsu, Daniel ^a   Kale, Satyen ^a   Karampatziakis, Nikos ^a   Langford, John ^a   Reyzin, Lev ^a   Zhang, Tong ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

CLASSIFICATION RULES; CONTEXTUAL BANDITS; COST SENSITIVE CLASSIFICATIONS; FEEDBACK DELAY; ON-LINE SETTING; OPTIMAL REGRET; RUNNING TIME;

ARTIFICIAL INTELLIGENCE;

EID: 80053154335     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. Peter Auer. Using confidence bounds for exploitationexploration trade-offs. Journal of Machine Learning Research, 3:397-422, 2002.
2. Peter Auer, Nicolò Cesa-Bianchi, and Paul Fischer. Finitetime analysis of the multiarmed bandit problem. Machine Learning, 47(2-3):235-256, 2002a. (Pubitemid 34126111)
3. Peter Auer, Nicolò Cesa-Bianchi, Yoav Freund, and Robert E. Schapire. The nonstochastic multiarmed bandit problem. SIAM Journal of Computing, 32(1):48-77, 2002b.
4. P. L. Bartlett, E. Hazan, and A. Rakhlin. Adaptive online gradient descent. In NIPS, 2007.
5. Alina Beygelzimer, John Langford, and Pradeep Ravikumar. Error correcting tournaments. In ALT, 2009.
6. Alina Beygelzimer, John Langford, Lihong Li, Lev Reyzin, and Robert E. Schapire. Contextual bandit algorithms with supervised learning guarantees. In AISTATS, 2011
7. Eyal Even-Dar, Shie Mannor, and Yishay Mansour. Action elimination and stopping conditions for the multi-armed bandit and reinforcement learning problems. Journal of Machine Learning Research, 7:1079-1105, 2006. (Pubitemid 43938989)
8. David A. Freedman. On tail probabilities for martingales. Annals of Probability, 3(1):100-118, 1975.
9. Y. Freund and R. E. Schapire. A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1): 119-139, 1997. (Pubitemid 127433398)
10. Sham M. Kakade and Adam Kalai. From batch to transductive online learning. In NIPS, 2005.
11. Adam Tauman Kalai and Santosh Vempala. Efficient algorithms for online decision problems. J. Comput. Syst. Sci., 71(3):291-307, 2005. (Pubitemid 41278182)
12. Tze Leung Lai and Herbert Robbins. Asymptotically efficient adaptive allocation rules. Advances in Applied Mathematics, 6:4-22, 1985.
13. J. Langford, A. Smola, and M. Zinkevich. Slow learners are fast. In NIPS, 2009.
14. John Langford and Tong Zhang. The epoch-greedy algorithm for contextual multi-armed bandits. In NIPS, 2007.
15. Maurice Sion. On general minimax theorems. Pacific J. Math., 8(1):171-176, 1958.
16. Niranjan Srinivas, Andreas Krause, Sham Kakade, and Matthias Seeger. Gaussian process optimization in the bandit setting: No regret and experimental design. In ICML, 2010