Large-scale bandit problems and KWIK learning

30th International Conference on Machine Learning, ICML 2013

Volumn , Issue PART 1, 2013, Pages 588-596

  Abernethy, Jacob ^a   Amin, Kareem ^a   Draief, Moez ^b   Kearns, Michael ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; SOFTWARE ENGINEERING;

ACTION SPACES; BANDIT PROBLEMS; IMPOSSIBILITY RESULTS; MULTI ARMED BANDIT;

SUPERVISED LEARNING;

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

References (18)

1. Amin, K., Kearns, M., and Syed, U. Graphical models for bandit problems. In Proceedings of the 27th Annual Conference Uncertainty in Artificial Intelligence (UAI), 2011a.
2. Amin, K., Kearns, M., and Syed, U. Bandits, query learning, and the haystack dimension. In Proceedings of the 24th Annual Conference on Learning Theory (COLT), 2011b.
3. Auer, Peter, Ortner, Ronald, and Szepesvári, Csaba. Improved rates for the stochastic continuum-armed bandit problem. In In 20th Conference on Learning Theory (COLT), pp. 454-468, 2007.
4. Beygelzimer, Alina and Langford, John. The offset tree for learning with partial labels. In KDD, pp. 129-138, 2009.
5. Beygelzimer, Alina, Langford, John, Li, Lihong, Reyzin, Lev, and Schapire, Robert E. Contextual bandit algorithms with supervised learning guarantees. In Proceedings of the 14th International Conference on Artificial Intelligence and Statistics (AISTATS), 2011.
6. Bubeck, Sébastien, Munos, Rémi, Stoltz, Gilles, and Szepesvári, Csaba. Online optimization in x-armed bandits. In NIPS, pp. 201-208, 2008.
7. Kleinberg, Robert, Slivkins, Aleksandrs, and Upfal, Eli. Multi-armed bandits in metric spaces. In Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC), pp. 681-690, New York, NY, USA, 2008. ACM. ISBN 978-1-60558-047-0. doi: http://doi.acm.org/10.1145/1374376.1374475.
8. Langford, John and Zhang, Tong. The epoch-greedy algorithm for contextual multi-armed bandits. In Advances in Neural Information Processing Systems 20 (NIPS), 2007.
9. Li, L. and Liftman, M.L. Reducing reinforcement learning to KWIK online regression. Annals of Mathematics and Artificial Intelligence, 58(3):217-237, 2010.
10. Li, L., Littman, M.L., and Walsh, T.J. Knows what it knows: a framework for self-aware learning. In Proceedings of the 25th International Conference on Machine Learning (ICML), pp. 568-575, 2008.
11. Li, L., Littman, M.L., Walsh, T.J., and Strehl, A.L. Knows what it knows: a framework for self-aware learning. Machine Learning, 82(3):399-443, 2011.
12. Li, Lihong, Chu, Wei, Langford, John, and Schapire, Robert E. A contextual-bandit approach to personalized news article recommendation. In Proceedings of the 19th International World Wide Web Conference, 2010.
13. Lu, Tyler, Pal, David, and Pal, Martin. Contextual multi-armed bandits. In Proceedings of the 13th International Conference on Artificial Intelligence and Statistics (AISTATS), 2010.
14. Sayedi, A., Zadimoghaddam, M., and Blum, A. Trading off mistakes and don't-know predictions. In NIPS, 2010.
15. Slivkins, Aleksandrs. Contextual bandits with similarity information. In Proceedings of the 24th Annual Conference on Learning Theory (COLT), 2011.
16. Strehl, Alexander and Littman, Michael L. Online linear regression and its application to model-based reinforcement learning. In Advances in Neural Information Processing Systems 20 (NIPS), 2007.
17. Walsh, T.J., Szita, I., Diuk, C., and Littman, M.L. Exploring compact reinforcement-learning representations with linear regression. In Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence (UAI), pp. 591-598. AUAI Press, 2009.
18. Wang, Yizao, Audibert, Jean-Yves, and Munos, Rémi. Algorithms for infinitely many-armed bandits. In Advances in Neural Information Processing Systems 21 (NIPS), pp. 1729-1736, 2008.