Automatic discovery and transfer of MAXQ hierarchies

Proceedings of the 25th International Conference on Machine Learning

Volumn , Issue , 2008, Pages 648-655

  Mehta, Neville ^a   Ray, Soumya ^a   Tadepalli, Prasad ^a   Dietterich, Thomas ^a  

^a OREGON STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BAYESIAN NETWORKS; MACHINE LEARNING; TRAJECTORIES; EDUCATION; INFERENCE ENGINES; LEARNING SYSTEMS; REINFORCEMENT; ROBOT LEARNING;

AUTOMATIC DISCOVERY; DYNAMIC BAYESIAN NETWORKS; STATE ABSTRACTION; SUBTASKS; TASK HIERARCHIES; TEMPORAL RELATIONSHIPS; VALUE FUNCTIONS;

REINFORCEMENT LEARNING; LEARNING ALGORITHMS;

AUTOMATIC DISCOVERIES; BAYESIAN NETWORK MODELS; LEARNING TASKS; STATE ABSTRACTIONS; SUB-TASKS; TASK HIERARCHIES; TEMPORAL RELATIONSHIPS;

EID: 56449130136     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1390156.1390238     Document Type: Conference Paper

References (14)

1. Andre, D., & Russell, S. (2002). State Abstraction for Programmable Reinforcement Learning Agents. AAAI (pp. 119-125).
2. Şimşek, Ö., & Barto, A. (2004). Using Relative Novelty to Identify Useful Temporal Abstractions in Reinforcement Learning. ICML (pp. 751-758).
3. Dietterich, T. (2000). Hierarchical Reinforcement Learning with the MAXQ Value Function Decomposition. Journal of Artificial Intelligence Research, 13, 227-303.
4. Diuk, C., Littman, M., & Strehl, A. (2006). A Hierarchical Approach to Efficient Reinforcement Learning in Deterministic Domains. AAMAS (pp. 313-319).
5. Hengst, B. (2002). Discovering Hierarchy in Reinforcement Learning with HEXQ. ICML (pp. 243-250).
6. Jonsson, A., & Barto, A. (2006). Causal Graph Based Decomposition of Factored MDPs. Journal of Machine Learning Research, 7, 2259-2301.
7. Marthi, B., Kaelbling, L., & Lozano-Perez, T. (2007). Learning Hierarchical Structure In Policies. NIPS Hierarchical Organization of Behavior Workshop.
8. McGovern, A., & Barto, A. (2001). Automatic Discovery of Subgoals in Reinforcement Learning using Diverse Density. ICML (pp. 361-368).
9. Mehta, N., & Tadepalli, P. (2005). Multi-Agent Shared Hierarchy Reinforcement Learning. ICML Rich Representations in Reinforcement Learning Workshop.
10. Menache, I., Mannor, S., & Shimkin, N. (2001). Q-Cut - Dynamic Discovery of Sub-Goals in Reinforcement Learning. ECML (pp. 295-306).
11. Pickett, M., & Barto, A. (2002). PolicyBlocks: An Algorithm for Creating Useful Macro-Actions in Reinforcement Learning. ICML (pp. 506-513).
12. Sutton, R., Precup, D., & Singh, S. (1999). Between MDPs and Semi-MDPs: A Framework for Temporal Abstraction in Reinforcement Learning. Artificial Intelligence, 112, 181-211.
13. Tadepalli, P., & Dietterich, T. (1997). Hierarchical Explanation-Based Reinforcement Learning. ICML (pp. 358-366).
14. Thrun, S., & Schwartz, A. (1995). Finding Structure in Reinforcement Learning. NIPS (pp. 385-392).