Instance-Based Utile Distinctions for Reinforcement Learning with Hidden State

Proceedings of the 12th International Conference on Machine Learning, ICML 1995

Volumn , Issue , 1995, Pages 387-395

  Mccallum, R Andrew ^a  

^a UNIVERSITY OF ROCHESTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DYNAMIC PROGRAMMING; LEARNING ALGORITHMS; REINFORCEMENT LEARNING;

ALIASING; HIDDEN STATE; LEARN+; MEMORY USE; MEMORY-BASED LEARNING; REINFORCEMENT LEARNING ALGORITHMS; REINFORCEMENT LEARNINGS; SHORT TERM MEMORY; TASK STRUCTURE; TREE-STRUCTURED REPRESENTATION;

TREES (MATHEMATICS);

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

References (27)

1. [Agre and Chapman, 1987] Philip E. Agre and David Chapman. Pengi: an implementation of a theory of activity. In AAAI, pages 268-272,1987.
2. [Barto et al., 1991] A.B. Barto, S.J. Bradtke, and S.P. Singh. Real-time learning and control using asynchronous dynamic programming. Technical Report 91-57, University of Massachusetts, Amherst, MA, 1991.
3. [Bellman, 1957] R. E. Bellman. Dynamic Programming. Princeton University Press, Princeton, NJ, 1957.
4. [Bertsekas and Shreve, 1978] Dimitri. P. Bertsekas and Steven E. Shreve. Stochastic Optimal Control. Academic Press, 1978.
5. [Cassandra et al, 1994] Anthony R. Cassandra, Leslie Pack Kaelbling, and Michael L. Littman. Acting optimally in partially observable stochastic domains. In Proceedings of the Twelfth National Conference on Artificial Intelligence, Seattle, WA, 1994.
6. [Chapman and Kaelbling, 1991] David Chapman and Leslie Pack Kaelbling. Learning from delayed reinforcement in a complex domain. In Twelfth International Joint Conference on Artificial Intelligence, 1991.
7. [Chrisman, 1992] Lonnie Chrisman. Reinforcement learning with perceptual aliasing: The perceptual distinctions approach. In Tenth National Conference on AI, 1992.
8. [Jaakkolaei al, 1995] Tommi Jaakkola, Satinder Pal Singh, and Michael I. Jordan. Reinforcement learning algorithm for partially observable markov decision problems. In Advances of Neural Information Processing Systems (NIPS 7). Morgan Kaufmann, 1995.
9. [Lin, 1991] Long-Ji Lin. Programming robots using reinforcement learning and teaching. Ninth National Conference on Artificial Intelligence, 1991.
10. [Lin, 1993] Long-Ji Lin. Reinforcement Learning for Robots Using Neural Networks. PhD thesis, Carnegie Mellon, School of Computer Science, January 1993.
11. [Littman, 1994] Michael Littman. Memoryless policies: Theoretical limitations and practical results. In Proceedings of the Third International Conference on Simulation of Adaptive Behavior: From Animals to Animais, 1994.
12. [McCallum, 1993] R. Andrew McCallum. Overcoming incomplete perception with utile distinction memory. In The Proceedings of the Tenth International Machine Learning Conference. Morgan Kaufmann Publishers, Inc., 1993.
13. [McCallum, 1994] R. Andrew McCallum. Utile suffix memory for reinforcement learning with hidden state. Technical Report 549, University of Rochester Computer Science Dept., December 1994.
14. [McCallum, 1995] R. Andrew McCallum. Instance-based state identification for reinforcement learning. In Advances of Neural Information Processing Systems (NIPS 7), 1995.
15. [Moore and Atkeson, 1993] Andrew W. Moore and Christopher G. Atkeson. Memory-based reinforcement learning: Efficient computation with prioritized sweeping. In Advances of Neural Information Processing Systems (NIPS 5). Morgan Kaufmann Publishers, Inc., 1993.
16. [Moore, 1991] Andrew W. Moore. Variable resolution dynamic programming: Efficiently learning action maps in multivariate real-valued state-spaces. Proceedings of the Eighth International Workshop on Machine Learning, pages 333-337,1991.
17. [Moore, 1993] Andrew W. Moore. The parti-game algorithm for variable resolution reinforcement learning in multidimensional state spaces. In Advances of Neural Information Processing Systems (NIPS 6), pages 711-718. Morgan Kaufmann, 1993.
18. [Peng and Williams, 1992] Jing Peng and R. J. Williams. Efficient learning and planning within the Dyna framework. In Proceedings of the Second International Conference on Simulation of Adaptive Behavior: From Animals to Animais, 1992.
19. [Platzman, 1977] Loren Kerry Platzman. Finite Memory Estimation and Control of Finite Probabilistic Systems. PhD thesis, Department of Electrical Engineering and Computer Science, MIT, January 1977.
20. [Ron et ai, 1994] Dana Ron, Yoram Singer, and Naftali Tishby. Learning probabilistic automata with variable memory length. In Proceedings Computational Learning Theory. Morgan Kaufmann Publishers, Inc., 1994.
21. [Sutton, 1990] Richard S. Sutton. Integrated architectures for learning, planning, and reacting based on approximating dynamic programming. In Proceedings of the Seventh International Conference on Machine Learning, June 1990.
22. [Teller, 1994] Astro Teller. The evolution of mental models. In Kim Kinnear, editor, Advances in Genetic Programming, chapter 9. MIT Press, 1994.
23. [Thrun, 1992] Sebastian B. Thrun. Efficient exploration in reinforcement learning. Technical Report CMU-CS-92-102, CMU Comp. Sei. Dept., January 1992.
24. [Ullman, 1984] Shimon Ullman. Visual routines. Cognition, 18:97-159,1984.
25. [Watkins, 1989] Chris Watkins. Learning from delayed rewards. PhD thesis, Cambridge University, 1989.
26. [White and Scherer, 1994] Chelsea C. White and William T. Scherer. Finite-memory suboptimal design for partially observed markov decision processes. Operations Research, 42:439-455,1994.
27. [Whitehead and Ballard, 1991] Steven D. Whitehead and Dana H. Ballard. Learning to perceive and act by trial and error. Machine Learning, 7(1 ):45-83, 1991.