Better rates for any adversarial deterministic MDP

30th International Conference on Machine Learning, ICML 2013

Volumn , Issue PART 3, 2013, Pages 1712-1720

  Dekel, Ofer ^a   Hazan, Elad ^b  

^a MICROSOFT RESEARCH   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

LEARNING ALGORITHMS; LEARNING SYSTEMS; MARKOV PROCESSES;

BANDIT FEEDBACKS; GRAPH TOPOLOGY; MARKOV DECISION PROCESSES; REGRET BOUNDS; REGRET MINIMIZATION; TWO WAYS;

TOPOLOGY;

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

References (17)

1. Abernethy, J., Hazan, E., and Rakhlin, A. Interior-point methods for full-information and bandit online learning. IEEE Transactions on Information Theory, 58(7):4164-4175, 2012.
2. Alfonsin, J. Ramirez. The Diophantine Frobenius problem. Oxford University Press, 2005.
3. Arora, R., Dekel, O., and Tewari, A. Deterministic MDPs with adversarial rewards and bandit feedback. In Proceedings of the 28th Conference on Uncertainty in Artificial Intelligence, pp. 93-101, 2012.
4. Audibert, Jean-Yves, Bubeck, Sébastien, and Lugosi, Gábor. Minimax policies for combinatorial prediction games. Journal of Machine Learning Research - Proceedings Track, 19:107-132, 2011.
5. Bertsekas, D. P. Dynamic Programming and Optimal Control. Athena Scientific, Third edition, 2005.
6. Bremaud, P. Markov chains : Gibbs fields, Monte Carlo simulation and queues. Springer, 1999.
7. Dani, Varsha, Hayes, Thomas P., and Kakade, Sham. The price of bandit information for online optimization. In Advances in Neural Information Processing Systems 20, 2007.
8. Denardo, E. V. Periods of connected networks and powers of nonnegative matrices. Mathematics of Operations Research, 2(1):20-24, 1977.
9. Even-Dar, E., Kakade, S., and Mansour, Y. Online markov decision processes. Mathematics of Operations Research, 34(3):726-736, 2009.
10. Farias, V. F., Moallemi, C. C., Roy, B. Van, and Weissman, T. Universal reinforcement learning. IEEE Transactions on Information Theory, 56(5):2441-2454, 2010.
11. Feinberg, E. A. and Yang, F. On polynomial cases of the unichain classification problem for Markov decision processes. Operations Research Letters, 36(5): 527-530, 2008.
12. Neu, G., György, A., Szepesvári, C., and Antos, A. Online Markov decision processes under bandit feedback. In Advances in Neural Information Processing Systems 23, pp. 1804-1812, 2010.
13. Ortner, R. Online regret bounds for Markov decision processes with deterministic transitions. Theoretical Computer Science, 411 (29-30):2684-2695, 2010.
14. Szepesvari, C. Algorithms for reinforcement learning. Synthesis Lectures on Artificial Intelligence and Machine Learning, 4(1), 2010.
15. Takimoto, Eiji and Warmuth, Manfred K. Path kernels and multiplicative updates. Journal of Machine Learning Research, 4:773-818, 2003.
16. Yu, J. Y., Mannor, S., and Shimkin, N. Markov decision processes with arbitrary reward processes. Mathematics of Operations Research, 34(3):737-757, 2009.
17. Yu, Jia Yuan and Mannor, Shie. Arbitrarily modulated markov decision processes. In Proceedings of the 48th IEEE Conference on Decision and Control, pp. 2946-2953, 2009.