用单一模型实现多维度偏好对齐,降低推理成本并提升控制精度。
PARM: Multi-Objective Test-Time Alignment via Preference-Aware Autoregressive Reward Model
- 设计统一的偏好感知自回归奖励模型,通过双线性低秩适配融合多维偏好。
- 推理成本仅为原有方法的1/3,对齐误差下降22.6%,支持弱模型引导强模型。
- 适合资源受限场景下的高效多目标偏好调整,尤其适合部署在边缘设备。
多目标测试时对齐旨在推理阶段适应大语言模型(LLMs)的多样化多维用户偏好,同时保持模型冻结。近期方法GenARM(Xu等,2025)分别独立训练每个偏好维度的自回归奖励模型(ARM),推理时基于用户偏好向量组合输出,存在两大缺陷:需多个ARM导致推理开销高;各ARM独立训练造成生成与偏好间的错位。为此,本文提出偏好感知自回归奖励模型(PARM),一个跨所有偏好维度统一训练的单模型。PARM采用提出的偏好感知双线性低秩适配(PBLoRA),以双线性形式将偏好向量融入模型,实现推理中对偏好权衡的精准控制。实验表明,PARM显著降低推理成本,并在偏好对齐上优于现有方法。此外,其支持弱到强的引导机制,使小型PARM可指导大型冻结LLM,无需昂贵训练,让多目标对齐在计算资源有限时也可行。代码已开源:https://github.com/Baijiong-Lin/PARM。
原文摘要 · Abstract (English)
Multi-objective test-time alignment aims to adapt large language models (LLMs) to diverse multi-dimensional user preferences during inference while keeping LLMs frozen. Recently, GenARM (Xu et al., 2025) first independently trains Autoregressive Reward Models (ARMs) for each preference dimension without awareness of each other, then combines their outputs based on user-specific preference vectors during inference to achieve multi-objective test-time alignment, leading to two key limitations: the need for \textit{multiple} ARMs increases the inference cost, and the separate training of ARMs causes the misalignment between the guided generation and the user preferences. To address these issues, we propose Preference-aware ARM (PARM), a single unified ARM trained across all preference dimensions. PARM uses our proposed Preference-Aware Bilinear Low-Rank Adaptation (PBLoRA), which employs a bilinear form to condition the ARM on preference vectors, enabling it to achieve precise control over preference trade-offs during inference. Experiments demonstrate that PARM reduces inference costs and achieves better alignment with preference vectors compared with existing methods. Additionally, PARM enables weak-to-strong guidance, allowing a smaller PARM to guide a larger frozen LLM without expensive training, making multi-objective alignment accessible with limited computing resources. The code is available at https://github.com/Baijiong-Lin/PARM.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。