Target Transfer Q-Learning and Its Convergence Analysis
Not on the map. Why?
Abstract (arXiv)
Q-learning is one of the most popular methods in Reinforcement Learning (RL). Transfer Learning aims to utilize the learned knowledge from source tasks to help new tasks to improve the sample complexity of the new tasks. Considering that data collection in RL is both more time and cost consuming and Q-learning converges slowly comparing to supervised learning, different kinds of transfer RL algorithms are designed. However, most of them are heuristic with no theoretical guarantee of the convergence rate. Therefore, it is important for us to clearly understand when and how will transfer learning help RL method and provide the theoretical guarantee for the improvement of the sample complexity. In this paper, we propose to transfer the Q-function learned in the source task to the target of the Q-learning in the new task when certain safe conditions are satisfied. We call this new transfer Q-learning method target transfer Q-Learning. The safe conditions are necessary to avoid the harm to the new tasks and thus ensure the convergence of the algorithm. We study the convergence rate of the target transfer Q-learning. We prove that if the two tasks are similar with respect to the MDPs, the optimal Q-functions in the source and new RL tasks are similar which means the error of the transferred target Q-function in new MDP is small. Also, the convergence rate analysis shows that the target transfer Q-Learning will converge faster than Q-learning if the error of the transferred target Q-function is smaller than the current Q-function in the new task. Based on our theoretical results, we design the safe condition as the Bellman error of the transferred target Q-function is less than the current Q-function. Our experiments are consistent with our theoretical founding and verified the effectiveness of our proposed target transfer Q-learning method.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). First posted on arXiv 21 Sep 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 1; 2024: 2; 2025: 1; 2026: 1.
6 papers.
- 2021Lifetime policy reuse and the importance of task capacitycited by 4
- 2023Uncertainty-aware transfer across tasks using hybrid model-based successor feature reinforcement learningcited by 1
- 2024A Cantor-Kantorovich Metric Between Markov Decision Processes with Application to Transfer Learningcited by 0
- 2024Exploration in Knowledge Transfer Utilizing Reinforcement Learningcited by 0
- 2025Data-driven inventory management for new products: An adjusted Dyna-Q approach with transfer learningcited by 0
- 2026Cross-Domain Policy Optimization via Bellman Consistency and Hybrid Criticscited by 0
- 2026Cross-Domain Policy Optimization via Bellman Consistency and Hybrid Critics12 Mar 2026
- 2025Data-driven inventory management for new products: An adjusted Dyna-Q approach with transfer learning14 Jan 2025
- 2024Exploration in Knowledge Transfer Utilizing Reinforcement Learning15 Jul 2024
- 2024A Cantor-Kantorovich Metric Between Markov Decision Processes with Application to Transfer Learning11 Jul 2024
- 2023Uncertainty-aware transfer across tasks using hybrid model-based successor feature reinforcement learning16 Oct 2023
- 2021Lifetime policy reuse and the importance of task capacity3 Jun 2021