跳到正文
arXiv cs.AI· Saeed Hedayatian, Harsh Shah, Celine Mneimneh, Stefanos Nikolaidis·· 13 小时前AI 评分24

RePPO:用排斥性种群策略梯度实现行为多样的强化学习

Repulsive Population Policy Gradients for Behaviorally Diverse Reinforcement Learning

AI 导读

研究者提出 RePPO(Repulsive Population Policy Optimization),将 PPO 改造为用依赖种群、动态塑形的奖励联合优化一小组多样且高质量的策略,在标准连续控制任务上取得优于现有 QD-RL 方法的质量-多样性权衡。在基于像素的任务中,RePPO 在保持与标准 PPO 相当质量的同时多样性显著更高,并首次将 QD-RL 方法成功扩展到大型语言模型微调。

正文 · 原文

View PDF HTML (experimental)

Abstract:The goal of Quality-Diversity Reinforcement Learning (QD-RL) is to find a population of high-performing policies that solve a decision-making problem in diverse ways. Despite recent progress, QD-RL methods predominantly rely on evolutionary operators--including black-box optimizers, mutations, and crossovers--to facilitate exploration and induce diversity. Scaling these methods becomes increasingly costly as policies and behavior spaces grow larger. Building on the Soft QD view of quality-diversity optimization, we introduce \textbf{Re}pulsive \textbf{P}opulation \textbf{P}olicy \textbf{O}ptimization (\textbf{RePPO}), which adapts PPO to jointly optimize a compact population of diverse, high-quality policies using a population-dependent, dynamically shaped reward. On standard continuous-control tasks, RePPO achieves a strong quality-diversity tradeoff compared with state-of-the-art QD-RL methods. Ablations further characterize this tradeoff by examining how each component affects individual quality and collective diversity. To assess RePPO's scalability, we extend our evaluation to learning from pixels and fine-tuning large language models. In pixel-based tasks, where large policies make most traditional QD-RL methods infeasible, RePPO maintains quality on par with standard PPO while achieving substantially higher diversity. Its successful application to language model fine-tuning further demonstrates, for the first time, that QD-RL methods can scale to this domain. Together, these results show that directly optimizing compact populations with RePPO provides a scalable approach to QD-RL across increasingly complex domains.
Subjects: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
Cite as: arXiv:2610.36425 [cs.LG]
  (or arXiv:2610.36425v1 [cs.LG] for this version)
  https://doi.org/10.48550/arXiv.2610.36425

arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Saeed Hedayatian [view email]
[v1] Tue, 27 Oct 2026 00:16:33 UTC (9,130 KB)

来源:arXiv cs.AI · arxiv.org