CUP: Critic-Guided Policy Reuse
Jin Zhang, Siyuan Li, Chongjie Zhang
Abstract
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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 627f260a-4ec9-4a0b-87df-b7266ef12c3bCited by top-tier papers5
- Unsupervised Behavior Extraction via Random Intent PriorsHao Hu, Yiqin Yang, Jianing Ye, Ziqing Mai et al.NeurIPS 2023 · 15 citations
- Efficient Multi-task Reinforcement Learning with Cross-Task Policy GuidanceJinmin He, Kai Li, Yifan Zang, Haobo Fu et al.NeurIPS 2024 · 11 citations
- Beyond Single Stationary Policies: Meta-Task Players as Naturally Superior CollaboratorsHaoming Wang, Zhaoming Tian, Yunpeng Song, Xiangliang Zhang et al.NeurIPS 2024 · 3 citations
- Learning to Reuse Policies in State Evolvable EnvironmentsZiqian Zhang, Bohan Yang, Lihe Li, Yuqi Bian et al.ICML 2025
- QMP: Q-switch Mixture of Policies for Multi-Task Behavior SharingGrace Zhang, Ayush Jain, Injune Hwang, Shao-Hua Sun et al.ICLR 2025
Builds on8
- A Minimalist Approach to Offline Reinforcement LearningScott Fujimoto, Shixiang Shane GuNeurIPS 2021 · 1,292 citations
- Multi-Task Reinforcement Learning with Soft ModularizationRuihan Yang, Huazhe Xu, Yi Wu, Xiaolong WangNeurIPS 2020 · 247 citations
- Multi-Task Reinforcement Learning with Context-based RepresentationsShagun Sodhani, Amy Zhang, Joelle PineauICML 2021 · 241 citations
- MDP Homomorphic Networks: Group Symmetries in Reinforcement LearningElise van der Pol, Daniel E. Worrall, Herke van Hoof, Frans A. Oliehoek et al.NeurIPS 2020 · 203 citations
- Revisiting Rainbow: Promoting more insightful and inclusive deep reinforcement learning researchJohan S. Obando-Ceron, Pablo Samuel CastroICML 2021 · 125 citations
Related papers
- REPAINT: Knowledge Transfer in Deep Reinforcement LearningYunzhe Tao, Sahika Genc, Jonathan Chung, Tao Sun et al.ICML 2021 · 32 citations
- Knowledge Transfer in Multi-Task Deep Reinforcement Learning for Continuous ControlZhiyuan Xu, Kun Wu, Zhengping Che, Jian Tang et al.NeurIPS 2020 · 58 citations
- Flexible Option LearningMartin Klissarov, Doina PrecupNeurIPS 2021 · 38 citations
- Composing Task-Agnostic Policies with Deep Reinforcement LearningAhmed Hussain Qureshi, Jacob J. Johnson, Yuzhe Qin, Taylor Henderson et al.ICLR 2020 · 35 citations
- Constrained Update Projection Approach to Safe Policy OptimizationLong Yang, Jiaming Ji, Juntao Dai, Linrui Zhang et al.NeurIPS 2022 · 95 citations
