CUP: Critic-Guided Policy Reuse
Not on the map. Why?
Abstract (arXiv)
The ability to reuse previous policies is an important aspect of human intelligence. To achieve efficient policy reuse, a Deep Reinforcement Learning (DRL) agent needs to decide when to reuse and which source policies to reuse. Previous methods solve this problem by introducing extra components to the underlying algorithm, such as hierarchical high-level policies over source policies, or estimations of source policies' value functions on the target task. However, training these components induces either optimization non-stationarity or heavy sampling cost, significantly impairing the effectiveness of transfer. To tackle this problem, we propose a novel policy reuse algorithm called Critic-gUided Policy reuse (CUP), which avoids training any extra components and efficiently reuses source policies. CUP utilizes the critic, a common component in actor-critic methods, to evaluate and choose source policies. At each state, CUP chooses the source policy that has the largest one-step improvement over the current target policy, and forms a guidance policy. The guidance policy is theoretically guaranteed to be a monotonic improvement over the current target policy. Then the target policy is regularized to imitate the guidance policy to perform efficient policy search. Empirical results demonstrate that CUP achieves efficient transfer and significantly outperforms baseline algorithms.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 29 of its 43 references that are in the map. First posted on arXiv 15 Oct 2022.
Builds on
29 of 43 references.
References · 29
- 2015Continuous control with deep reinforcement learningcited by 3,279
- 2018Addressing Function Approximation Error in Actor-Critic Methodscited by 2,302
- 2016Asynchronous Methods for Deep Reinforcement Learningcited by 2,218
- 2018Off-Policy Deep Reinforcement Learning without Explorationcited by 1,227
- 2018Soft Actor-Critic Algorithms and Applicationscited by 1,179
- 2019Meta-World: A Benchmark and Evaluation for Multi-Task and Meta Reinforcement Learningcited by 1,168
- 2018Experience Replay for Continual Learningcited by 1,074
- 2021A Minimalist Approach to Offline Reinforcement Learningcited by 882
- 2017Reinforcement Learning with Deep Energy-Based Policiescited by 659
- 2019Behavior Regularized Offline Reinforcement Learningcited by 654
- 2020AWAC: Accelerating Online Reinforcement Learning with Offline Datasetscited by 647
- 2016Successor Features for Transfer in Reinforcement Learningcited by 331
17 more
- 2020Towards Continual Reinforcement Learning: A Review and Perspectivescited by 268
- 2017Distral: Robust Multitask Reinforcement Learningcited by 231
- 2021Multi-Task Reinforcement Learning with Context-based Representationscited by 169
- 2020Multi-Task Reinforcement Learning with Soft Modularizationcited by 138
- 2020MDP Homomorphic Networks: Group Symmetries in Reinforcement Learningcited by 133
- 2019Transfer in Deep Reinforcement Learning Using Successor Features and Generalised Policy Improvementcited by 88
- 2020Revisiting Rainbow: Promoting more Insightful and Inclusive Deep Reinforcement Learning Researchcited by 78
- 2020Plannable Approximations to MDP Homomorphisms: Equivariance under Actionscited by 61
- 2021The Difficulty of Passive Learning in Deep Reinforcement Learningcited by 50
- 2020Learning Cross-Domain Correspondence for Control with Dynamics Cycle-Consistencycited by 43
- 2019Hierarchical Reinforcement Learning with Advantage-Based Auxiliary Rewardscited by 38
- 2019AC-Teach: A Bayesian Actor-Critic Method for Policy Learning with an Ensemble of Suboptimal Teacherscited by 27
- 2019MULTIPOLAR: Multi-Source Policy Aggregation for Transfer Reinforcement Learning between Diverse Environmental Dynamicscited by 18
- 2018Context-Aware Policy Reusecited by 15
- 2017An Optimal Online Method of Selecting Source Policies for Reinforcement Learningcited by 13
- 2020Mutual Information Based Knowledge Transfer Under State-Action Dimension Mismatchcited by 8
- 2020Efficient Deep Reinforcement Learning via Adaptive Policy Transfercited by 4
Built on by
Citing papers per year: 2023: 5; 2024: 0; 2025: 1.
6 papers.
- 2023Unsupervised Behavior Extraction via Random Intent Priorscited by 13
- 2023QMP: Q-switch Mixture of Policies for Multi-Task Behavior Sharingcited by 6
- 2023Investigating the role of model-based learning in exploration and transfercited by 5
- 2025Efficient Multi-Task Reinforcement Learning with Cross-Task Policy Guidancecited by 3
- 2023On the Value of Myopic Behavior in Policy Reusecited by 1
- 2023IOB: Integrating Optimization Transfer and Behavior Transfer for Multi-Policy Reusecited by 1
- 2025Efficient Multi-Task Reinforcement Learning with Cross-Task Policy Guidance9 Jul 2025
- 2023Unsupervised Behavior Extraction via Random Intent Priors28 Oct 2023
- 2023IOB: Integrating Optimization Transfer and Behavior Transfer for Multi-Policy Reuse14 Aug 2023
- 2023On the Value of Myopic Behavior in Policy Reuse28 May 2023
- 2023Investigating the role of model-based learning in exploration and transfer8 Feb 2023
- 2023QMP: Q-switch Mixture of Policies for Multi-Task Behavior Sharing1 Feb 2023