Multi-armed bandit problems with dependent arms

ACM International Conference Proceeding Series

Volumn 227, Issue , 2007, Pages 721-728

  Pandey, Sandeep ^a   Chakrabarti, Deepayan ^a   Agarwal, Deepak ^a  

^a YAHOO RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; CLUSTER ANALYSIS; ERRORS; KNOWLEDGE ACQUISITION; PROBLEM SOLVING; REAL TIME SYSTEMS;

ARMS; BANDIT PROBLEMS; SYNTHETIC DATA; THEORETICAL JUSTIFICATIONS;

LEARNING SYSTEMS;

EID: 34547966991     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1273496.1273587     Document Type: Conference Paper

References (15)

1. Agrawal, R. (1995). Sample mean based index policies with O(log n) regret for the multi-armed bandit problem. Advances in Applied Probability, 27, 1054-1078.
2. Chang, F., & Lai, T. L. (1987). Optimal stopping and dynamic allocation. Advances in Applied Probability, 19, 829-853.
3. Dasgupta, S. (2005). Coarse sample complexity bounds for active learning. NIPS.
4. Frostig, E., & Weiss, G. (1999). Four proofs of Gittins' multiarmed bandit theorem. Applied Probability Trust.
5. J.C.Gittins (1979). Bandit processes and dynamic allocation indices. Journal of the Royal Statistical Society, Series B, 41, 148-177.
6. Kocsis, L., & Szepesvári, C (2006). Bandit based monte-carlo planning. ECML.
7. Lai, T. L. (1987). Adaptive treatment allocation and multi-armed bandit problem. Annals of Statistics, 15(3), 1091-1114.
8. Lai, T. L., & Robbins, H. (1985). Asymptotically efficient adaptive allocation rules. Advances in Applied Mathematics, 6, 4-22.
9. MacKay, D. (1992). Information-based objective functions for active data selection. Neural Computation, 4, 590-604.
10. Pandey, S., Agarwal, D., Chakrabarti, D., & Josifovski, V. (2007). Bandits for taxonomies: A model-based approach. SDM.
11. P.Auer, N.Cesa-Bianchi, & P.Fischer (2002). Finitetime analysis of the multiarmed bandit problem. Machine Learning, 47, 235-256.
12. Puterman, M. L. (2005). Markov decision processes: Discrete stochastic dynamic programming. Wiley-Interscience. 2 edition.
13. Schneider, J., & Moore, A. (2002). Active learning in discrete input spaces. The 34th Interface Symposium.
14. Wang, C-C., Kulkami, S. R., & Poor, H. (2005). Bandit problems with side observations. IEEE Transactions on Automatic Control, 50(3), 338-355.
15. Whittle, P. (1980). Multi-armed bandits and the Gittins index. Journal of the Royal Statistcal Society B, 42, 143-149.