Learning Options in Reinforcement Learning
The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Reinforcement Learning: An Introduction
(2005) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2004.842673 · Cited by 24,496
Reinforcement Learning: An Introduction
Johnson, J. D., Li, J., & Chen, Z. (2000) · Neurocomputing · doi:10.1016/s0925-2312(00)00324-6 · Cited by 8,414
Markov decision processes: Discrete stochastic dynamic programming
Hazeghi, K., & Puterman, M. L. (1995) · Journal of the American Statistical Association · doi:10.2307/2291177 · Cited by 8,037
Introduction to Reinforcement Learning
Sutton, R. S., & Barto, A. G. (1998) · The MIT Press eBooks · Cited by 6,855
Axten, N., Newell, A., & Simon, H. A. (1973) · Contemporary Sociology · doi:10.2307/2063712 · Cited by 6,834
Between MDPs and semi-MDPs: A framework for temporal abstraction in reinforcement learning
Sutton, R. S., Precup, D., & Singh, S. (1999) · Artificial Intelligence · doi:10.1016/s0004-3702(99)00052-1 · Cited by 3,119
Hierarchical Reinforcement Learning with the MAXQ Value Function Decomposition
Dietterich, T. G. (2000) · Journal of Artificial Intelligence Research · doi:10.1613/jair.639 · Cited by 1,435
Planning in a hierarchy of abstraction spaces
Sacerdoti, E. D. (1974) · Artificial Intelligence · doi:10.1016/0004-3702(74)90026-5 · Cited by 1,155
Learning and executing generalized robot plans
Fikes, R. E., Hart, P. E., & Nilsson, N. J. (1972) · Artificial Intelligence · doi:10.1016/0004-3702(72)90051-3 · Cited by 1,019
Reinforcement Learning with Hierarchies of Machines
Parr, R., & Russell, S. (1997) · Cited by 618
Chunking in Soar: The Anatomy of a General Learning Mechanism
Laird, J. E., Rosenbloom, P. S., & Newell, A. (1986) · Machine Learning · doi:10.1023/a:1022639103969 · Cited by 507
Automatic Discovery of Subgoals in Reinforcement Learning using Diverse Density
McGovern, A., & Barto, A. G. (2001) · ScholarWorks@UMassAmherst (University of Massachusetts Amherst) · Cited by 418
Macro-operators: A weak method for learning
Korf, R. E. (1985) · Artificial Intelligence · doi:10.1016/0004-3702(85)90012-8 · Cited by 287
The MAXQ Method for Hierarchical Reinforcement Learning
Dietterich, T. G. (1998) · Cited by 285
Reinforcement Learning Methods for Continuous-Time Markov Decision Problems
Bradtke, S. J., & Duff, M. O. (1994) · Cited by 263
Temporal abstraction in reinforcement learning
Precup, D., & Sutton, R. S. (2000) · Cited by 236
Self-citationHierarchical control and learning for markov decision processes
Parr, R., & Russell, S. (1998) · Cited by 221
Learning Search Control Knowledge: An Explanation-Based Approach
Minton, S. (2011) · CERN Document Server (European Organization for Nuclear Research) · Cited by 172
A Heuristic Approach to the Discovery of Macro-Operators
Iba, G. A. (1989) · Machine Learning · doi:10.1023/a:1022693717366 · Cited by 152
Learning to solve problems by searching for macro-operators
Korf, R. E. (1983) · Pitman Advanced Pub. Program eBooks · Cited by 119
Learning Search Control Knowledge
Minton, S. (1988) · Kluwer international series in engineering and computer science · doi:10.1007/978-1-4613-1703-6 · Cited by 118
Reinforcement learning with a hierarchy of abstract models
Singh, S. P. (1992) · Cited by 108
Autonomous discovery of temporal abstractions from interaction with an environment
Mcgovern, E. A., & Barto, A. G. (2002) · ScholarWorks@UMassAmherst (University of Massachusetts Amherst) · Cited by 78
Self-Improving Factory Simulation using Continuous-time Average-Reward Reinforcement Learning
Mahadevan, S., Das, T. K., & Gosavi, A. (2007) · Cited by 67
Macro-Actions in Reinforcement Learning: An Empirical Analysis
McGovern, A., & Sutton, R. S. (1998) · ScholarWorks@UMassAmherst (University of Massachusetts Amherst) · Cited by 42
Cited by
Reinforcement learning in the brain
Niv, Y. (2009) · Journal of Mathematical Psychology · doi:10.1016/j.jmp.2008.12.005 · Cited by 717
The Option-Critic Architecture
Bacon, P.-L., Harb, J., & Precup, D. (2017) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v31i1.10916 · Cited by 687
Self-citationHierarchical Reinforcement Learning: A Comprehensive Survey
Pateria, S., Subagdja, B., Tan, A.-H., & Quek, C. (2022) · ACM Computing Surveys · doi:10.1145/3453160 · Cited by 461
Modular Multitask Reinforcement Learning with Policy Sketches
Andreas, J., Klein, D., & Levine, S. (2016) · arXiv · doi:10.48550/arxiv.1611.01796 · Cited by 274
“Each subpolicy π is uniquely associated with a symbol b implemented as a neural network that maps from a state s i to distributions over A + , and chooses an action a i by sampling from this distribution.”
BackgroundLearning structures: Predictive representations, replay, and generalization
Momennejad, I. (2020) · Current Opinion in Behavioral Sciences · doi:10.1016/j.cobeha.2020.02.017 · Cited by 159
Metadata
- Authors
- Stolle, M., & Precup, D.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2002
- Pages
- 212-223
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1556824961
- Cited by
- 261
- References
- 25
- FWCI
- 0.54
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.