提出FRPO框架,让大模型在微调时避免安全行为崩溃。
Robust Policy Optimization to Prevent Catastrophic Forgetting
- 通过KL约束邻域内的策略优化,确保奖励稳定
- 实测多模型下微调后安全性能下降减少50%以上
- 适合需长期保持安全性的大模型应用
大语言模型通常采用多阶段后训练:先经强化学习人类反馈(RLHF),再针对下游任务微调。然而,即使微小的下游更新也可能损害先前学习的行为(如安全性),暴露所谓的灾难性遗忘问题。这表明标准RLHF目标无法保证未来适应的鲁棒性。现有方法多在微调阶段设计保留机制。本文认为,预防该问题需在预微调阶段就具备鲁棒性:基础策略应避免那些在标准微调下奖励急剧下降的脆弱高奖励解。为此,提出微调鲁棒策略优化(FRPO),一种鲁棒的RLHF框架,不仅优化当前策略的奖励,还考虑由下游适配可达的KL有界邻域内所有策略的奖励。核心思想是通过最大-最小公式确保策略迁移下的奖励稳定性。基于GRPO改进,算法无额外计算开销。实验证明,其显著降低多个基础模型和下游微调场景(SFT与RL)中的安全退化,同时保持下游任务性能。进一步在数学推理强化学习设置中验证,FRPO可有效维持微调后的准确率。
原文摘要 · Abstract (English)
Large language models are commonly trained through multi-stage post-training: first via RLHF, then fine-tuned for other downstream objectives. Yet even small downstream updates can compromise earlier learned behaviors (e.g., safety), exposing a brittleness known as catastrophic forgetting. This suggests standard RLHF objectives do not guarantee robustness to future adaptation. To address it, most prior work designs downstream-time methods to preserve previously learned behaviors. We argue that preventing this requires pre-finetuning robustness: the base policy should avoid brittle high-reward solutions whose reward drops sharply under standard fine-tuning. We propose Fine-tuning Robust Policy Optimization (FRPO), a robust RLHF framework that optimizes reward not only at the current policy, but across a KL-bounded neighborhood of policies reachable by downstream adaptation. The key idea is to ensure reward stability under policy shifts via a max-min formulation. By modifying GRPO, we develop an algorithm with no extra computation, and empirically show it substantially reduces safety degradation across multiple base models and downstream fine-tuning regimes (SFT and RL) while preserving downstream task performance. We further study a math-focused RL setting, demonstrating that FRPO preserves accuracy under subsequent fine-tuning.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。