Piecewise-stationary bandit problems with side observations

Proceedings of the 26th International Conference On Machine Learning, ICML 2009

Volumn , Issue , 2009, Pages 1177-1184

  Yu, Jia Yuan ^a   Mannor, Shie ^a,b  

^a MCGILL UNIVERSITY   (Canada)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

BANDIT PROBLEMS; DECISION PROBLEMS; PIECE-WISE; PRIOR KNOWLEDGE; STATIONARY DISTRIBUTION;

ROBOT LEARNING;

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

References (18)

1. Akakpo, N. (2008). Detecting change-points in a discrete distribution via model selection. Preprint. http://arxiv.org/abs/0801.0970.
2. Auer, P., Cesa-Bianchi, N., & Fischer, P. (2002a). Finite-time analysis of the multiarmed bandit problem. Machine Learning, 47, 235-256.
3. Auer, P., Cesa-Bianchi, N., Freund, Y., & Schapire, R. E. (2002b). The nonstochastic multiarmed bandit problem. SIAM J. Computing, 32, 48-77.
4. Cesa-Bianchi, N., & Lugosi, G. (2006). Prediction, learning, and games. Cambridge University Press.
5. Even-Dar, E., Mannor, S., & Mansour, Y. (2006). Action elimination and stopping conditions for the multi-armed bandit and reinforcement learning problems. J. Mach. Learn. Res., 7, 1079-1105.
6. Fuh, C. D. (2004). Asymptotic operating characteristics of an optimal change point detection in hidden Markov models. Ann. Statist., 2305-2339.
7. Garivier, A., & Moulines, E. (2008). On upper-confidence bound policies for non-stationary bandit problems. Preprint. http://arxiv.org/abs/ 0805.3415.
8. Hartland, C., Gelly, S., Baskiotis, N., Teytaud, O., & Sebag, M. (2006). Multi-armed bandit, dynamic environments and meta-bandits. Preprint. http://hal.archives-ouvertes.fr/hal-00113668/en/.
9. Herbster, M., & Warmuth, M. K. (1998). Tracking the best expert. Machine Learning, 32, 151-178.
10. Kocsis, L., & Szepesvári, C. (2006). Discounted-UCB. 2nd PASCAL Challenges Workshop.
11. Lai, T. L. (2001). Sequential analysis: some classical problems and new challenges. Statistica Sinica, 11, 303-408.
12. Lai, T. L., & Robbins, H. (1985). Asymptotically efficient adaptive allocation rules. Advances in Applied Mathematics, 6, 4-22.
13. Littlestone, N., & Warmuth, M. (1994). The weighted majority algorithm. Information and Computation, 108, 212-261.
14. Lorden, G. (1971). Procedures for reacting to a change in distribution. Ann. Math. Statist. 42, 1897-1908.
15. Mei, Y. J. (2006). Sequential change-point detection when unknown parameters are present in the pre-change distribution. Ann. Statist., 34, 92-122.
16. Page, E. S. (1954). Continuous inspection scheme. Biometrika, 41, 100-115.
17. Pollak, M. (1987). Average run lengths of an optimal method of detecting a change in distribution. Ann. Statist, 15, 749-779.
18. Shiryayev, A. N. (1963). On optimum methods in quickest detection problems. Theory Probab. Appl., 8, 22-46.