mlsanityData to 14 Oct 2026

Importance Weighted Transfer of Samples in Reinforcement Learning

arXiv 1805.10886 ↗First posted 28 May 2018cs.LG stat.MLcited by 16

On the map: Offline RL and imitation learning from data → Offline RL algorithms

Abstract (arXiv)

We consider the transfer of experience samples (i.e., tuples < s, a, s', r >) in reinforcement learning (RL), collected from a set of source tasks to improve the learning process in a given target task. Most of the related approaches focus on selecting the most relevant source samples for solving the target task, but then all the transferred samples are used without considering anymore the discrepancies between the task models. In this paper, we propose a model-based technique that automatically estimates the relevance (importance weight) of each source sample for solving the target task. In the proposed approach, all the samples are transferred and used by a batch RL algorithm to solve the target task, but their contribution to the learning process is proportional to their importance weight. By extending the results for importance weighting provided in supervised learning literature, we develop a finite-sample analysis of the proposed batch RL algorithm. Furthermore, we empirically compare the proposed algorithm to state-of-the-art approaches, showing that it achieves better learning performance and is very robust to negative transfer, even when some source tasks are significantly different from the target task.

Key facts. Cited by 16 papers in the map (data through 14 Oct 2026). Placed in Offline RL algorithms, one of 13 directions in Offline RL and imitation learning from data. First posted on arXiv 28 May 2018.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 5; 2022: 3; 2023: 3; 2024: 1; 2025: 2; 2026: 2.

16 papers.

Sort:

By area:

Similar, not cited

Close in wording, no citation either way

  1. 2024Towards Sample-Efficiency and Generalization of Transfer and Inverse Reinforcement Learning: A Comprehensive Literature Review
  2. 2025When Importance Sampling Misallocates Credit: Asymmetric Ratios for Outcome-Supervised RL
  3. 2024Reusing Historical Trajectories in Natural Policy Gradient via Importance Sampling: Convergence and Convergence Rate
  4. 2024Model-Based Transfer Learning for Contextual Reinforcement Learning
  5. 2024Offline Multi-task Transfer RL with Representational Penalization
  6. 2025Deep Transfer Q-Learning for Offline Non-Stationary Reinforcement Learning
  7. 2025Supervised Fine Tuning on Curated Data is Reinforcement Learning (and can be improved)
  8. 2024Policy Gradient with Active Importance Sampling