Q-Pensieve: Boosting Sample Efficiency of Multi-Objective RL Through Memory Sharing of Q-Snapshots
Not on the map. Why?
Abstract (arXiv)
Many real-world continuous control problems are in the dilemma of weighing the pros and cons, multi-objective reinforcement learning (MORL) serves as a generic framework of learning control policies for different preferences over objectives. However, the existing MORL methods either rely on multiple passes of explicit search for finding the Pareto front and therefore are not sample-efficient, or utilizes a shared policy network for coarse knowledge sharing among policies. To boost the sample efficiency of MORL, we propose Q-Pensieve, a policy improvement scheme that stores a collection of Q-snapshots to jointly determine the policy update direction and thereby enables data sharing at the policy level. We show that Q-Pensieve can be naturally integrated with soft policy iteration with convergence guarantee. To substantiate this concept, we propose the technique of Q replay buffer, which stores the learned Q-networks from the past iterations, and arrive at a practical actor-critic implementation. Through extensive experiments and an ablation study, we demonstrate that with much fewer samples, the proposed algorithm can outperform the benchmark MORL methods on a variety of MORL benchmark tasks.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). First posted on arXiv 6 Dec 2022.
Builds on
0 of 0 references.
No references here yet.
Built on by
Citing papers per year: 2024: 4; 2025: 3; 2026: 2.
9 papers.
- 2024The Max-Min Formulation of Multi-Objective Reinforcement Learning: From Theory to a Model-Free Algorithmcited by 13
- 2025Efficient Action-Constrained Reinforcement Learning via Acceptance-Rejection Method and Augmented MDPscited by 8
- 2024MODULI: Unlocking Preference Generalization via Diffusion Models for Offline Multi-Objective Reinforcement Learningcited by 4
- 2024C-MORL: Multi-Objective Reinforcement Learning through Efficient Discovery of Pareto Frontcited by 4
- 2024In Search for Architectures and Loss Functions in Multi-Objective Reinforcement Learningcited by 3
- 2026A Reward-Free Viewpoint on Multi-Objective Reinforcement Learningcited by 2
- 2025Reward Dimension Reduction for Scalable Multi-Objective Reinforcement Learningcited by 1
- 2025Interpretability by Design for Efficient Multi-Objective Reinforcement Learningcited by 0
- 2026Constrained Multi-Objective Reinforcement Learning with Max-Min Criterioncited by 0
- 2026Constrained Multi-Objective Reinforcement Learning with Max-Min Criterion29 May 2026
- 2026A Reward-Free Viewpoint on Multi-Objective Reinforcement Learning27 Apr 2026
- 2025Interpretability by Design for Efficient Multi-Objective Reinforcement Learning4 Jun 2025
- 2025Efficient Action-Constrained Reinforcement Learning via Acceptance-Rejection Method and Augmented MDPs17 Mar 2025
- 2025Reward Dimension Reduction for Scalable Multi-Objective Reinforcement Learning28 Feb 2025
- 2024C-MORL: Multi-Objective Reinforcement Learning through Efficient Discovery of Pareto Front3 Oct 2024
- 2024MODULI: Unlocking Preference Generalization via Diffusion Models for Offline Multi-Objective Reinforcement Learning28 Aug 2024
- 2024In Search for Architectures and Loss Functions in Multi-Objective Reinforcement Learning23 Jul 2024
- 2024The Max-Min Formulation of Multi-Objective Reinforcement Learning: From Theory to a Model-Free Algorithm12 Jun 2024