Skip to search form
Skip to main content
>
Semantic Scholar
Semantic Scholar's Logo
Search
Sign In
Create Free Account
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
Create Alert
Related topics
Related topics
2 relations
Algorithm
Reinforcement 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
Luis Carlos Cobo Rus
2013
Corpus ID: 21385168
IONS FOR REINFORCEMENT LEARNING Abstraction is one of the most common ways of scaling up reinforcement learning, along with…
Expand
2011
2011
Episodic task learning in Markov decision processes
Yong Lin
,
F. Makedon
,
Yurong Xu
Artificial Intelligence Review
2011
Corpus ID: 6240083
Hierarchical algorithms for Markov decision processes have been proved to be useful for the problem domains with multiple…
Expand
2007
2007
Automatic Induction of MAXQ Hierarchies
N. Mehta
,
Mike Wynkoop
,
Soumya Ray
,
P. Tadepalli
,
Tom Dietterich
2007
Corpus ID: 6154895
Scaling up reinforcement learning to large domains requires leveraging the structure in the domain. Hierarchical reinforcement…
Expand
2005
2005
Finding Hidden Hierarchy in Reinforcement Learning
G. Poulton
,
Y. Guo
,
W. Lu
KES
2005
Corpus ID: 12324950
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
B. Hengst
ECML
2004
Corpus ID: 16348814
HEXQ is a reinforcement learning algorithm that discovers hierarchical structure automatically. The generated task hierarchy…
Expand
2004
2004
Discovering multiple levels of a task hierarchy concurrently
D. Potts
,
B. Hengst
Robotics Auton. Syst.
2004
Corpus ID: 8620026
Abstract Task hierarchies can be used to decompose an intractable problem into smaller more manageable tasks. This paper examines…
Expand
2004
2004
Concurrent Discovery of Task Hierarchies
D. Potts
,
B. Hengst
2004
Corpus ID: 11669887
Task hierarchies can be used to decompose an intractable problem into smaller more manageable tasks. This paper explores how task…
Expand
2003
2003
Discovering hierarchy in reinforcement learning
B. Hengst
2003
Corpus ID: 43840115
This thesis addresses the open problem of automatically discovering hierarchical structure in reinforcement learning. Current…
Expand
Highly Cited
2002
Highly Cited
2002
Discovering Hierarchy in Reinforcement Learning with HEXQ
B. Hengst
ICML
2002
Corpus ID: 5588386
An open problem in reinforcement learning is discovering hierarchical structure. HEXQ, an algorithm which automatically attempts…
Expand
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