Learning from logged implicit exploration data

Advances in Neural Information Processing Systems 23: 24th Annual Conference on Neural Information Processing Systems 2010, NIPS 2010

Volumn , Issue , 2010, Pages

  Strehl, Alexander L ^a   Langford, John ^b   Li, Lihong ^b   Kakade, Sham M ^c  

^a FACEBOOK   (United States)

^b YAHOO RESEARCH   (United States)

^c UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXTUAL BANDITTI; EXPLORATION DATA; EXPLORATION POLICY; GIVEN FEATURES; HISTORICAL DATA; LEARNING PROCESS; OFFLINE DATA; RANDOMISATION; REAL-WORLD;

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

References (11)

1. Peter Auer, Nicolò C. Bianchi, Yoav Freund, and Robert E. Schapire. The nonstochastic multiarmed bandit problem. SIAM Journal on Computing, 32(1):48-77, 2002.
2. D. Horvitz and D. Thompson. A generalization of sampling without replacement from a finite universe. Journal of the American Statistical Association, 47, 1952.
3. Michael Kearns, YishayMansour, and Andrew Y. Ng. Approximate planning in large pomdps via reusable trajectories. In NIPS, 2000.
4. Diane Lambert and Daryl Pregibon. More bang for their bucks: Assessing new features for online advertisers. In ADKDD 2007, 2007.
5. John Langford, Alexander L. Strehl, and Jenn Wortman. Exploration scavenging. In ICML-08: Proceedings of the 25rd international conference on Machine learning, 2008.
6. John Langford and Tong Zhang. The epoch-greedy algorithm for multi-armed bandits with side information. In Advances in Neural Information Processing Systems 20, pages 817-824, 2008.
7. Robert A. Lew. Bounds on negative moments. SIAM Journal on Applied Mathematics, 30(4):728-731, 1976.
8. Lihong Li, Wei Chu, John Langford, and Robert E. Schapire. A contextual-bandit approach to personalized news article recommendation. In Proceedings of the Nineteenth International Conference on World Wide Web (WWW-10), pages 661-670, 2010.
9. Lihong Li, Wei Chu, John Langford, and Xuanhui Wang. Unbiased offline evaluation of contextualbandit-based news article recommendation algorithms. In Proceedings of the Fourth International Conference on Web Search and Web Data Mining (WSDM-11), 2011.
10. Art Owen and Yi Zhou. Safe and effective importance sampling. Journal of the American Statistical Association, 95:135-143, 1998.
11. Doina Precup, Rich Sutton, and Satinder Singh. Eligibility traces for off-policy policy evaluation. In ICML, 2000.