An Introduction to Intertask Transfer for Reinforcement Learning
Open accessThe DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
Transfer learning has recently gained popularity due to the development of algorithms that can successfully generalize information across multiple tasks. This article focuses on transfer in the context of reinforcement learning domains, a general learning framework where an agent acts in an environment to maximize a reward signal. The goals of this article are to (1) familiarize readers with the transfer learning problem in reinforcement learning domains, (2) explain why the problem is both interesting and difficult, (3) present a selection of existing techniques that demonstrate different solutions, and (4) provide representative open problems in the hope of encouraging additional research in this exciting area.
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
Learning to predict by the methods of temporal differences
Sutton, R. S. (1988) · Machine Learning · doi:10.1007/bf00115009 · Cited by 5,148 · cited 2×
“There are many possible approaches to learning such a policy, but this article will focus ontemporal difference(TD) methods, such asQ-learning (Sutton 1988; Watkins 1989) andSarsa (Rummery & Niranjan 1994; Singh & Sutton 1996), which learn to approximateQ : S × A 7→ R.”
MethodA survey of robot learning from demonstration
Argall, B. D., Chernova, S., Veloso, M., & Browning, B. (2009) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2008.10.024 · Cited by 3,227
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
The structure-mapping engine: Algorithm and examples
Falkenhainer, B., Forbus, K. D., & Gentner, D. (1989) · Artificial Intelligence · doi:10.1016/0004-3702(89)90077-5 · Cited by 1,454
Cited by
PathNet: Evolution Channels Gradient Descent in Super Neural Networks
Fernando, C., Banarse, D., Blundell, C., Zwólš, Y., Ha, D., Rusu, A. A., Pritzel, A., & Wierstra, D. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1701.08734 · Cited by 591
Deep reinforcement learning with successor features for navigation across similar environments
Zhang, J., Springenberg, J. T., Boedecker, J., & Burgard, W. (2017) · 2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2017.8206049 · Cited by 278
Hierarchical Reinforcement Learning: A Survey and Open Research Challenges
Hutsebaut-Buysse, M., Mets, K., & Latré, S. (2022) · Machine Learning and Knowledge Extraction · doi:10.3390/make4010009 · Cited by 129
Measuring the Distance Between Finite Markov Decision Processes
(2016) · Adaptive Agents and Multi-Agents Systems · doi:10.5555/2936924.2936994 · Cited by 47
Procedural Content Generation: Better Benchmarks for Transfer Reinforcement Learning
Muller-Brockhausen, M., Preuss, M., & Plaat, A. (2021) · 2021 IEEE Conference on Games (CoG) · doi:10.1109/cog52621.2021.9619000 · Cited by 11
“These surveys formulate frameworks to encompass the different TRL literature they encounter [6], [8], or analyze specific sub-fields of TRL [7], [9]–[12].”
Background
Metadata
- Authors
- Taylor, M. E., & Stone, P.
- Venue
- AI Magazine
- Publisher
- Wiley
- Published
- 2011-03
- Volume
- 32
- Issue
- 1
- Pages
- 15-34
- ISSN
- 0738-4602 (ISSN-L)
- 2371-9621
- OpenAlex
- W2114580749
- Cited by
- 55
- References
- 4
- FWCI
- 1.77
- Type
- journal article
- Language
- en
- Open access
- bronze
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: An Introduction to Intertask Transfer for Reinforcement Learning. https://app.cochat.ai/papers/10.1609/aimag.v32i1.2329
- The paper
- Taylor, M. E., & Stone, P. (2011). An Introduction to Intertask Transfer for Reinforcement Learning. AI Magazine. https://doi.org/10.1609/aimag.v32i1.2329
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.