Thompson sampling for dynamic multi-armed bandits

Proceedings - 10th International Conference on Machine Learning and Applications, ICMLA 2011

Volumn 1, Issue , 2011, Pages 484-489

  Gupta, Neha ^a   Granmo, Ole Christoffer ^b   Agrawala, Ashok ^a  

^a Institute of Advanced Computer Science   (United States)

^b UNIVERSITY OF AGDER   (Norway)

Author keywords

Bayesian Techniques; Learning Algorithms; Multi Armed Bandits

Indexed keywords

BAYESIAN TECHNIQUES; MODEL PROBLEMS; MULTI ARMED BANDIT; NEWS ARTICLES; ONLINE ADVERTISING; ORDER STATISTICS; PROBABILITY ESTIMATE; REAL-LIFE PROBLEMS; SAMPLING SCHEMES; STATE-OF-THE-ART APPROACH; THOMPSON;

LEARNING ALGORITHMS; LEARNING SYSTEMS; PROBABILITY; PROBLEM SOLVING;

IMPORTANCE SAMPLING;

EID: 84857881652     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICMLA.2011.144     Document Type: Conference Paper

References (13)

1. O.-C. Granmo, "Solving two-armed bernoulli bandit problems using a bayesian learning automaton," International Journal of Intelligent Computing and Cybernetics, vol. 2, no. 3, pp. 207-234, 2010.
2. O.-C. Granmo and S. Berg, "Solving non-stationary bandit problems by random sampling from sibling kalman filters," in Twenty Third International Conference on Industrial, Engineering, and Other Applications of Applied Intelligent Systems (IEA-AIE 2010), 2010.
3. T. L. Lai and H. Robbins, "Asymptotically efficient adaptive bandit rules," Advances in Applied Mathemetics, 1985.
4. P. Auer, N. Cesa-Bianchi, and P. Fischer, "Finite time analysis of multiarmed bandit problem," Machine Learning, vol. 27, no. 2-3, pp. 235-256, 2002. (Pubitemid 34126111)
5. J. C. Gittins, "Bandit processes and dynamic allocation indices," Journal of Royal Statistical Society. Series B, vol. 41, no. 2, pp. 148-177, 1979.
6. P. Whittle, "Restless bandits: Activity allocation in a changing world,"Journal of Applied Probability, vol. 25, pp. pp. 287-298, 1988. [Online]. Available: http://www.jstor.org/stable/3214163
7. S. Guha, K. Munagala, and P. Shi, "Approximation algorithms for restless bandit problems," CoRR, vol. abs/0711.3861, 2007.
8. P. Auer, N. Cesa-Bianchi, Y. Freund, and R. E. Schapire, "Gambling in a rigged casino: The adversarial multi-armed bandit problem," in 36th Annual Symposium on Foundations of Computer Science. IEEE, 1995.
9. A. Slivkins and E. Upfal, "Adapting to changing environment: the brownian restless bandits," in COLT, 2008.
10. A. K. Gupta and S. Nadarajah, Handbook of Beta Distribution and its applications. New York: Marcer Dekker Inc., 2004.
11. J. Wyatt, "Exploration and inference in learning from reinforcement,"Ph.D. thesis, University of Edinburgh, 1997.
12. B. C. May, N. Korda, A. Lee, and D. S. Leslie, "Optimistic bayesian sampling in contextual-bandit problems," Submitted to the Annals of Applied Probability.
13. S. Makridakis, S. C. Wheelwright, and R. J. Hyndman, Forecasting Methods and Applications, 3rd ed. John Wiley and Sons, Inc., 1998, chapter 4, pp. 135-179.