Investigating contingency awareness using Atari 2600 games

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2012, Pages 864-871

  Bellemare, Marc G ^a   Veness, Joel ^a   Bowling, Michael ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

FUTURE OBSERVATIONS; MODEL FREE; REINFORCEMENT LEARNING AGENT; VALUE FUNCTION APPROXIMATION;

INTELLIGENT AGENTS; REINFORCEMENT LEARNING;

ARTIFICIAL INTELLIGENCE;

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

References (21)

1. Brafman, R. I., and Tennenholtz, M. 2003. R-max - a general polynomial time algorithm for near-optimal reinforcement learning. Journal of Machine Learning Research 3:213-231.
2. Cobo, L. C.; Zang, P.; Isbell, C. L.; and Thomaz, A. L. 2011. Automatic state abstraction from demonstration. In Proceedings of the 22nd Second International Joint Conference on Articial Intelligence (IJCAI).
3. Degris, T.; Sigaud, O.; and Wuillemin, P. 2006. Learning the structure of factored markov decision processes in reinforcement learning problems. In Proceedings of the 23rd International Conference on Machine learning. ACM.
4. Diuk, C.; Cohen, A.; and Littman, M. L. 2008. An object-oriented representation for efficient reinforcement learning. In Proceedings of the 25th International Conference on Machine learning (ICML), 240-247.
5. Finkelstein, N. W., and Ramey, C. T. 1977. Learning to control the environment in infancy. Child Development 48(3):806-819.
6. Kocsis, L., and Szepesvári, Cs. 2006. Bandit based Monte-Carlo planning. In Proceedings of 17th European Conference on Machine Learning (ECML).
7. Konidaris, G. D.; Osentoski, S.; and Thomas, P. S. 2011. Value function approximation in reinforcement learning using the fourier basis. In Proceedings of the 25th Conference on Artificial Intelligence (AAAI).
8. McGovern, A. E. 2002. Autonomous discovery of temporal abstractions from interaction with an environment. Ph.D. Dissertation, University of Massachusetts.
9. Naddaf, Y. 2010. Game-Independent AI Agents for Playing Atari 2600 Console Games. Master's thesis, University of Alberta.
10. Parr, R.; Painter-Wakefield, C.; Li, L.; and Littman, M. 2007. Analyzing feature generation for value-function approximation. In Proceedings of the 24th International Conference on Machine learning.
11. The Arcade Learning Environment: A Platform for AI Research. 2012. http://arcadelearningenvironment.org.
12. Russell, S. J., and Norvig, P. 2010. Artificial Intelligence - A Modern Approach (3rd internat. ed.). Pearson Education.
13. Schweitzer, P. J., and Seidmann, A. 1985. Generalized polynomial approximations in Markovian decision processes. Journal of Mathematical Analysis and Applications 110(2):568-582.
14. Sutton, R. S., and Barto, A. G. 1998. Reinforcement Learning: An Introduction. MIT Press.
15. Sutton, R. S.; Precup, D.; and Singh, S. P. 1999. Between MDPs and semi-MDPs: A framework for temporal abstraction in reinforcement learning. Artificial Intelligence 112(1-2):181-211.
16. Sutton, R. S. 1996. Generalization in reinforcement learning: Successful examples using sparse coarse coding. In Advances in Neural Information Processing Systems 8 (NIPS).
17. Tesauro, G. 1995. Temporal Difference Learning and TD-Gammon. Communications of the ACM 38(3).
18. Watkins, C., and Dayan, P. 1992. Q-learning. Machine Learning 8:279-292.
19. Watson, J. S., and Ramey, C. T. 1972. Reactions to response-contingent stimulation in early infancy. Merrill-Palmer Quarterly: Journal of Developmental Psychology 18(3):219-227.
20. White, R. W. 1959. Motivation reconsidered: The concept of competence. Psychological Review 66(5):297-333.
21. Wintermute, S. 2010. Using imagery to simplify perceptual abstraction in reinforcement learning agents. In Proceedings of the the 24th Conference on Artificial Intelligence (AAAI).