An intrinsic reward mechanism for efficient exploration

ACM International Conference Proceeding Series

Volumn 148, Issue , 2006, Pages 833-840

  Şimşek, Özgür ^a   Barto, Andrew G ^a  

^a Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EFFICIENT EXPLORATION; INTRINSIC REWARD MECHANISM; MARKOV DECISION PROCESS; OPTIMAL POLICY;

ALGORITHMS; DECISION MAKING; MARKOV PROCESSES; MATHEMATICAL MODELS;

REINFORCEMENT LEARNING;

EID: 34250703734     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1143844.1143949     Document Type: Conference Paper

References (19)

1. Barto, A. G., & Şimşek, Ö. (2005). Intrinsic motivation for reinforcement learning systems. Proceedings of the Thirteenth Yale Workshop on Adaptive and Learning Systems. New Haven, CT, USA.
2. Barto, A. G., Singh, S., & Chentanez, N. (2004). Intrinsically motivated learning of hierarchical collections of skills. Proceedings of the Third International Conference on Developmental Learning.
3. Duff, M. (2002). Optimal learning: Computational procedures for Bayes-adaptive Markov decision processes. Doctoral dissertation, University of Massassachusetts Amherst.
4. Duff, M. (2003). Design for an optimal probe. Proceedings of the Twentieth International Conference on Machine Learning.
5. Hengst, B. (2002). Discovering hierarchy in reinforcement learning with HEXQ. Proceedings of the Nineteenth International Conference on Machine Learning.
6. Kaplan, F., & Oudeyer, P.-Y. (2003). Motivational principles for visual know-how development. Proceedings of the Third International Workshop on Epigenetic Robotics: Modeling Cognitive Development in Robotic Systems.
7. Kearns, M., & Singh, S. (1998). Near-Optimal reinforcement learning in polynomial time. Proceedings of the Fifteenth International Conference on Machine Learning.
8. Mannor, S., Menache, I., Hoze, A., & Klein, U. (2004). Dynamic abstraction in reinforcement learning via clustering. Proceedings of the Twenty-First International Conference on Machine Learning.
9. McGovern, A., & Barto, A. G. (2001). Automatic discovery of subgoals in reinforcement learning using diverse density. Proceedings of the Eighteenth International Conference on Machine Learning.
10. Moore, A., & Atkeson, C. G. (1993). Prioritized sweeping: Reinforcement learning with less data and less real time. Machine Learning, 13, 103-130.
11. Peng, J., & Williams, R. J. (1993). Efficient learning and planning within the dyna framework. Adaptive Behavior, 2, 437-454.
12. Schmidhuber, J. (1991). A possibility for implementing curiosity and boredom in model-building neural controllers. From Animals to Animate: Proceedings of the First International Conference on Simulation of Adaptive Behavior.
13. Schmidhuber, J., & Storck, J. (1993). Reinforcement driven information acquisition in nondeterministic environments. Technical report, Fakultat fur Informatik, Technische Universit at Munchen.
14. Şimşek, Ö., & Barto, A. G. (2004). Using relative novelty to identify useful temporal abstractions in reinforcement learning. Proceedings of the Twenty-First International Conference on Machine Learning.
15. Şimşek, Ö., Wolfe, A. P., & Barto, A. G. (2005). Identifying useful subgoals in reinforcement learning by local graph partitioning. Proceedings of the Twenty-Second International Conference on Machine Learning.
16. Singh, S., Barto, A. G., & Chentanez, N. (2005). Intrinsically motivated reinforcement learning. Advances in Neurul Information Processing Systems.
17. Sutton, R. S. (1990). Integrated architectures for learning, planning, and reacting based on approximating dynamic programming. Proceedings of the Seventh International Conference on Machine. Learning.
18. Sutton, R. S., Precup, D., & Singh, S. P. (1999). Between MDPs and Semi-MDPs: A framework for temporal abstraction in reinforcement learning. Artificial Intelligence, 112, 181-211.
19. Thrun, S. (1992). Efficient exploration in reinforcement learning (Technical Report CMU-CS-92-102). Carnegie-Mellon University.