Cross-domain transfer for reinforcement learning
The DOI matches its Crossref record.
Abstract
A typical goal for transfer learning algorithms is to utilize knowledge gained in a source task to learn a target task faster. Recently introduced transfer methods in reinforcement learning settings have shown considerable promise, but they typically transfer between pairs of very similar tasks. This work introduces Rule Transfer, a transfer algorithm that first learns rules to summarize a source task policy and then leverages those rules to learn faster in a target task. This paper demonstrates that Rule Transfer can effectively speed up learning in Keepaway, a benchmark RL problem in the robot soccer domain, based on experience from source tasks in the gridworld domain. We empirically show, through the use of three distinct transfer metrics, that Rule Transfer is effective across these domains.
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
Cited by
Pan, S. J., & Yang, Q. (2010) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2009.191 · Cited by 23,387
“There has been a large amount of work on transfer learning for reinforcement learning in the machine learning literature (e.g., [9], [10]).”
BackgroundTransfer Learning for Reinforcement Learning Domains: A Survey
Taylor, M. E., & Stone, P. (2009) · doi:10.5555/1577069.1755839 · Cited by 1,488
Self-citationChen, Z., & Liu, B. (2018) · Synthesis Lectures on Artificial Intelligence and Machine Learning · doi:10.1007/978-3-031-01581-6 · Cited by 466
Panigrahi, S., Nanda, A., & Swarnkar, T. (2021) · Smart Innovation, Systems and Technologies · doi:10.1007/978-981-15-5971-6_83 · Cited by 354
Markov Logic: An Interface Layer for Artificial Intelligence
Domingos, P., & Lowd, D. (2009) · Synthesis lectures on artificial intelligence and machine learning · doi:10.2200/s00206ed1v01y200907aim007 · Cited by 314
Zhu, R., Qiu, T., Wang, J., Sui, S., Hao, C., Liu, T., Li, Y., Feng, M., Zhang, A., Qiu, C.-W., et al. (2021) · Nature Communications · doi:10.1038/s41467-021-23087-y · Cited by 273
Yang, Q., Zhang, Y., Dai, W., & Pan, S. J. (2020) · Cambridge University Press eBooks · doi:10.1017/9781139061773 · Cited by 254
Chen, Z., & Liu, B. (2018) · Synthesis Lectures on Artificial Intelligence and Machine Learning · doi:10.2200/s00737ed1v01y201610aim033 · Cited by 154
Meta Reinforcement Learning with Latent Variable Gaussian Processes
Sæmundsson, S., Hofmann, K., & Deisenroth, M. P. (2018) · arXiv · doi:10.48550/arxiv.1803.07551 · Cited by 106
Blind spot detection for safe sim-to-real transfer
Ramakrishnan, R., Kamar, E., Dey, D., Horvitz, E., & Shah, J. (2020) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1.11436 · Cited by 21
Metadata
- Authors
- Taylor, M. E., & Stone, P.
- Venue
- Proceedings of the 24th international conference on Machine learning
- Publisher
- ACM
- Published
- 2007-06-20
- Pages
- 879-886
- OpenAlex
- W2164114810
- Cited by
- 204
- References
- 0
- FWCI
- 8.46
- 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.