The adaptive k-meteorologists problem and its application to structure learning and feature selection in reinforcement learning

ACM International Conference Proceeding Series

Volumn 382, Issue , 2009, Pages

  Diuk, Carlos ^a   Li, Lihong ^a   Leffler, Bethany R ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARK DOMAINS; FEATURE SELECTION; LOWER BOUNDS; NAVIGATION PROBLEM; STATE-OF-THE-ART ALGORITHMS; STRUCTURE-LEARNING; UPPER BOUND;

ADAPTIVE ALGORITHMS; CONTROL THEORY; EDUCATION; REINFORCEMENT; ROBOT LEARNING;

LEARNING ALGORITHMS;

EID: 70049104382     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1553374.1553406     Document Type: Conference Paper

References (21)

1. Abbeel, P., Koller, D., & Ng, A. Y. (2006). Learning factor graphs in polynomial time and sample complexity. Journal of Machine Learning Research, 7, 1743-1788.
2. Boutilier, C., Dean, T., & Hanks, S. (1999). Decisiontheoretic planning: Structural assumptions and computational leverage. Journal of Artificial Intelligence Research, 11, 1-94.
3. Brafman, R. I., & Tennenholtz, M. (2002). R-max a general polynomial time algorithm for near-optimal reinforcement learning. Journal of Machine Learning Research, 3, 213-231.
4. Brunskill, E., Leffler, B. R., Li, L., Littman, M. L., & Roy, N. (2008). CORL: A continuous-state offsetdynamics reinforcement learner. Proceedings of the Twenty-Fourth Conference on Uncertainty in Artificial Intelligence (UAI-08).
5. Cesa-Bianchi, N., Freund, Y., Haussler, D., Helmbold, D. P., Schapire, R. E., & Warmuth, M. K. (1997). How to use expert advice. Journal of the ACM, 44, 427-485.
6. Dean, T., & Kanazawa, K. (1989). A model for reasoning about persistence and causation. Computational Intelligence, 5, 142-150.
7. Guestrin, C., Koller, D., Parr, R., & Venkataraman, S. (2003). Efficient solution algorithms for factored MDPs. Journal of Artificial Intelligence Research, 19, 399-468.
8. Kakade, S. (2003). On the sample complexity of reinforcement learning. Doctoral dissertation, Gatsby Computational Neuroscience Unit, University College London, UK.
9. Kearns, M. J., & Koller, D. (1999). Efficient reinforcement learning in factored MDPs. Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI-99) (pp. 740-747).
10. Kearns, M. J., & Schapire, R. E. (1994). Efficient distribution-free learning of probabilistic concepts. Journal of Computer and System Sciences, 48, 464-497.
11. Kearns, M. J., & Singh, S. P. (2002). Near-optimal reinforcement learning in polynomial time. Machine Learning, 49, 209-232.
12. Leffler, B. R., Littman, M. L., & Edmunds, T. (2007). Efficient reinforcement learning with relocatable action models. Proceedings of the Twenty-Second Conference on Artificial Intelligence (AAAI-07) (pp. 572-577).
13. Li, L. (2009). A unifying framework for computational reinforcement learning theory. Doctoral dissertation, Department of Computer Science, Rutgers University, New Brunswick, NJ. Li, L., Littman, M. L., & Walsh, T. J. (2008). Knows whatit knows: A framework for self-aware learning. Proceedings of the Twenty-Fifth International Conference on Machine Learning (ICML-08) (pp. 568-575).
14. Mannor, S., & Tsitsiklis, J. N. (2004). The sample complexity of exploration in the multi-armed bandit problem. Journal of Machine Learning Research, 5, 623- 648.
15. Puterman, M. L. (1994). Markov decision processes: Discrete stochastic dynamic programming. New York: Wiley-Interscience.
16. Strehl, A. L. (2007). Model-based reinforcement learning in factored-state MDPs. Proceedings of the IEEE International Symposium on Approximate Dynamic Programming and Reinforcement Learning (pp. 103-110).
17. Strehl, A. L., Diuk, C., & Littman, M. L. (2007). Efficient structure learning in factored-state MDPs. Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence (AAAI-07) (pp. 645-650).
18. Strehl, A. L., Li, L., & Littman, M. L. (2006a). Incremental model-based learners with formal learning-time guarantees. Proceedings of the Twenty-Second Conference on Uncertainty in Artificial Intelligence (UAI-06) (pp. 485-493).
19. Strehl, A. L., Li, L.,Wiewiora, E., Langford, J., & Littman, M. L. (2006b). PAC model-free reinforcement learning. Proceedings of the Twenty-Third International Conference on Machine Learning (ICML-06) (pp. 881-888).
20. Valiant, L. G. (1984). A theory of the learnable. Communications of the ACM, 27, 1134-1142.
21. Yamanishi, K. (1992). A learning criterion for stochastic rules. Machine Learning, 9, 165-203.