Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

HEXQ

HEXQ is a reinforcement learning algorithm created by Bernhard Hengst, which attempts to solve a Markov Decision Process by decomposing it… Expand
Wikipedia

Related topics

Related topics

2 relations
AlgorithmReinforcement learning

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2013
Review
2013
Leveraging attention focus for effective reinforcement learning in complex domains
IONS FOR REINFORCEMENT LEARNING Abstraction is one of the most common ways of scaling up reinforcement learning, along with… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2011
2011
Episodic task learning in Markov decision processes
Hierarchical algorithms for Markov decision processes have been proved to be useful for the problem domains with multiple… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2007
2007
Automatic Induction of MAXQ Hierarchies
Scaling up reinforcement learning to large domains requires leveraging the structure in the domain. Hierarchical reinforcement… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
2005
2005
Finding Hidden Hierarchy in Reinforcement Learning
HEXQ is a reinforcement learning algorithm that decomposes a problem into subtasks and constructs a hierarchy using state… Expand
2004
2004
Model Approximation for HEXQ Hierarchical Reinforcement Learning
HEXQ is a reinforcement learning algorithm that discovers hierarchical structure automatically. The generated task hierarchy… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
2004
2004
Discovering multiple levels of a task hierarchy concurrently
Abstract Task hierarchies can be used to decompose an intractable problem into smaller more manageable tasks. This paper examines… Expand
  • figure 1
  • figure 2
  • figure 5
  • figure 7
  • figure 8
2004
2004
Concurrent Discovery of Task Hierarchies
Task hierarchies can be used to decompose an intractable problem into smaller more manageable tasks. This paper explores how task… Expand
  • figure 1
  • figure 2
  • figure 5
  • figure 3
  • figure 4
2003
2003
Discovering hierarchy in reinforcement learning
This thesis addresses the open problem of automatically discovering hierarchical structure in reinforcement learning. Current… Expand
  • figure 1.1
  • figure 1.2
  • figure 1.3
  • figure 1.4
  • figure 2.1
Highly Cited
2002
Highly Cited
2002
Discovering Hierarchy in Reinforcement Learning with HEXQ
An open problem in reinforcement learning is discovering hierarchical structure. HEXQ, an algorithm which automatically attempts… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE