arXiv:2502.15145cs.LGcs.AI2025-02ICML被引 11

提出高效非线性多目标强化学习对齐框架,支持群体差异与零训练更新。

Projection Optimization: A General Framework for Multi-Objective and Multi-Group RLHF

  • 将非线性聚合转化为多个线性子问题求解,计算效率高
  • 实现多目标帕累托最优,且在群体场景中可达成共识或最大化总收益
  • 理论证明亚线性损失,实测仅需少量微调即可适配新偏好

基于人类反馈的强化学习(RLHF)是主流模型对齐方法,尤其适用于语言模型。由于人类更易表达各目标间的相对偏好而非全局偏好,多目标RLHF通过聚合各目标偏好以实现帕累托最优。然而现有方法多依赖线性聚合,无法支持偏爱特定目标(如最差目标)的策略;而唯一非线性方法因基于奖励且需重训练,计算开销大。本文将非线性聚合最大化问题转化为一系列仅含线性聚合的子问题,显著提升效率。进一步扩展至多群体场景,每组可有不同目标权重,支持跨群体共识或总目标最大化。理论上证明算法具亚线性遗憾,且可自然转为免训练算法。实验上,基于理论洞察,提出一种几乎无需训练的算法——一旦获得各目标最优策略,即可快速适应新聚合参数。

原文摘要 · Abstract (English)

Reinforcement Learning with Human Feedback (RLHF) is a widely used fine-tuning approach that aligns machine learning model, particularly Language Model (LM) with human preferences. There are typically multiple objectives driving the preference, hence humans find it easier to express per-objective comparisons rather than a global preference between two choices. Multi-Objective RLHF (MORLHF) aims to use per-objective preference feedback and achieve Pareto optimality among these objectives by aggregating them into a single unified objective for optimization. However, nearly all prior works rely on linear aggregation, which rules out policies that favor specific objectives such as the worst one. The only existing approach using non-linear aggregation is computationally expensive due to its reward-based nature and the need for retraining whenever the aggregation parameters change. In this work, we address this limitation by transforming the non-linear aggregation maximization problem into a series of sub-problems. Each sub-problem involves only linear aggregation, making it computationally efficient to solve. We further extend our framework to handle multi-group scenarios, where each group has distinct weights for the objectives. Our method enables achieving consensus or maximizing the aggregated objective across all groups. Theoretically, we demonstrate that our algorithmic framework achieves sublinear regret and can be easily adapted to a reward-free algorithm. Empirically, leveraging our theoretical insights, we propose a nearly training-free algorithm once the optimal policies for individual objectives are obtained.

强化学习多目标优化对齐高效算法

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。