提出抗近似重复项干扰的强化学习对齐算法,提升模型在非均衡数据下的稳定性。
Clone-Robust AI Alignment
- 基于相似度加权改进最大似然估计,增强对近似重复输入的鲁棒性
- 实验表明标准方法在加入近似重复项后奖励函数显著变化,新方法保持稳定
- 适合关注对齐算法稳健性、实际标注数据不均衡的研究者与开发者
大语言模型训练中的核心挑战是有效对齐人类偏好。基于人类反馈的强化学习(RLHF)通过人工标注的成对比较来训练奖励函数,已成为主流对齐方法。然而,RLHF的数据集在问题和答案类型分布上往往不均衡。因此,我们希望对齐算法在备选方案分布不均时仍能表现良好。借鉴社会选择理论,我们引入‘抗近似克隆’这一理想性质:添加高度相似的备选项不应显著改变学习到的奖励函数。我们首先证明,基于正则化最大似然估计(MLE)的标准RLHF算法不满足该性质。随后提出加权MLE算法,通过根据备选项与其他项的相似度进行加权,修正标准方法。该算法在保证原有理论优势的同时,可严格满足抗近似克隆性。
原文摘要 · Abstract (English)
A key challenge in training Large Language Models (LLMs) is properly aligning them with human preferences. Reinforcement Learning with Human Feedback (RLHF) uses pairwise comparisons from human annotators to train reward functions and has emerged as a popular alignment method. However, input datasets in RLHF are not necessarily balanced in the types of questions and answers that are included. Therefore, we want RLHF algorithms to perform well even when the set of alternatives is not uniformly distributed. Drawing on insights from social choice theory, we introduce robustness to approximate clones, a desirable property of RLHF algorithms which requires that adding near-duplicate alternatives does not significantly change the learned reward function. We first demonstrate that the standard RLHF algorithm based on regularized maximum likelihood estimation (MLE) fails to satisfy this property. We then propose the weighted MLE, a new RLHF algorithm that modifies the standard regularized MLE by weighting alternatives based on their similarity to other alternatives. This new algorithm guarantees robustness to approximate clones while preserving desirable theoretical properties.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。