Bandits, query learning, and the haystack dimension

Journal of Machine Learning Research

Volumn 19, Issue , 2011, Pages 87-105

  Amin, Kareem ^a   Kearns, Michael ^a   Syed, Umar ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

Learning theory; Multi armed bandits

Indexed keywords

OPTIMIZATION;

APPROXIMATE OPTIMALITY; ARBITRARY FUNCTIONS; GENERALIZED BINARY SEARCHES; GREEDY ALGORITHMS; INFINITE NUMBERS; LEARNING THEORY; MULTI ARMED BANDIT; TARGET FUNCTIONS;

ALGORITHMS;

EID: 84874098326     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (16)

1. Jacob Abernethy, Elad Hazan, and Alexander Rakhlin. Competing in the dark: An efficient algorithm for bandit linear optimization. In Proceedings of the 21th Annual Conference on Computational Learning Theory, 2008.
2. Kareem Amin, Michael Kearns, and Umar Syed. Graphical models for bandit problems. In Proceedings of the 27th Conference on Uncertainty in Artificial Intelligence, 2011.
3. Dana Angluin. Queries and concept learning. Machine Learning, 2(4):319-342, 1988.
4. Sébastien Bubeck, Rémi Munos, Gilles Stoltz, and Csaba Szepesvári. Online optimization in X-armed bandits. In Advances in Neural Information Processing Systems 21, 2008.
5. Varsha Dani and Thomas P. Hayes. Robbing the bandit: Less regret in online geometric optimization against an adaptive adversary. In Proceedings of the 17th Annual ACMSIAM Symposium on Discrete Algorithms, 2006.
6. Abraham Flaxman, Adam Tauman Kalai, and H. Brendan McMahan. Online convex optimization in the bandit setting: Gradient descent without a gradient. In Proceeding of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, 2005.
7. Tibor Hegedüs. Generalized teaching dimensions and the query complexity of learning. In Proceedings of the 8th Annual Conference on Computational Learning Theory, 1995.
8. Michael Kearns and Umesh Vazirani. An Introduction to Computational Learning Theory. MIT Press, 1994.
9. Robert Kleinberg, Aleksandrs Slivkins, and Eli Upfal. Multi-armed bandits in metric spaces. In Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008.
10. John Langford and Tong Zhang. The epoch-greedy algorithm for contextual multi-armed bandits. In Advances in Neural Information Processing Systems 20, 2007.
11. Tyler Lu, David Pál, and Martin Pál. Showing relevant ads via Lipschitz context multiarmed bandits. In Proceedings of the 13th International Conference on Artificial Intelligence and Statistics, 2010.
12. Adam J. Mersereau, Paat Rusmevichientong, and John N. Tsitsiklis. A structured multiarmed bandit problem and the greedy policy. IEEE Transactions on Automatic Control, 54(12) :2787-2802, 2009.
13. Rob Nowak. Noisy generalized binary search. In Advances in Neural Information Processing Systems 22, 2009.
14. Aleksandrs Slivkins. Contextual bandits with similarity information. In Proceedings of the 24th Annual Conference on Computational Learning Theory, 2011.
15. Niranjan Srinivas, Andreas Krause, Sham Kakade, and Matthias Seeger. Gaussian process optimization in the bandit setting: No regret and experimental design. In Proceedings of the 27th International Conference on Machine Learning, 2008.
16. William Thompson. On the likelihood that one unknown probability exceeds another in view of the evidence of two samples. Biometrika, 25(3-4):285-294, 1933.