用目标引导的监督学习提升大模型对齐效果,无需强化学习也能高效优化。
Goal-Conditioned Supervised Learning for LLM Fine-Tuning

- 将反馈信号视为显式目标,纯监督学习驱动模型生成达标响应
- 在三个任务中均超越传统微调方法,尤其在非毒性生成上提升显著
- 适合追求高效、可扩展微调方案的研究者与开发者
大语言模型在部署时需微调以更好匹配用户意图。现有方法分为在线和离线两类:在线方法(如基于强化学习的对齐)虽能直接优化输出质量,但依赖外部奖励模型和迭代推演,成本高且难部署;离线方法效率更高,但主流方案如监督微调(SFT)常将分级反馈简化为二元标签,而直接偏好优化(DPO)又依赖昂贵的配对偏好数据。本文提出目标条件监督学习(GCSL),作为离线微调框架。核心思想是将反馈信号直接视为明确目标,仅通过监督学习训练模型生成达成该目标的回应。为更好利用分级反馈,我们引入新目标设定:持续追求质量超过目标阈值的输出,而非仅模仿高质量样本集。此设计缓解了SFT和经典GCSL的局限性,明确引导模型学习质量提升方向。同时采用自然语言表示目标,更充分调动大模型的语义理解与推理能力。在非毒性生成、代码生成及推荐任务上的实验表明,本方法在保持监督学习高效、可扩展和低数据需求优势的同时,持续优于标准离线微调基线。
原文摘要 · Abstract (English)
Large language models often require fine-tuning to better align their behavior with user intent at deployment. Existing approaches are commonly divided into online and offline paradigms. Online methods, such as RL-based alignment, can directly optimize outcome quality but typically rely on external reward models and iterative rollouts, making them costly and difficult to deploy in many cases. Offline methods are more efficient, but prevailing approaches such as supervised fine-tuning (SFT) and direct preference optimization (DPO) remain limited: SFT typically collapses graded feedback into binary supervision, while DPO depends on paired preference data that is often unavailable or expensive to construct. In this paper, we propose goal-conditioned supervised learning (GCSL) as an offline fine-tuning framework for LLMs. Our core idea is to treat feedback signals directly as an explicit goal and train the model, purely through supervised learning, to generate responses that achieve that goal. To better exploit graded feedback, we further introduce a novel goal formulation that defines learning as consistently pursuing outcomes above a target quality threshold, rather than imitating samples from a selected high-quality subset. This design mitigates the bounded-learning effect of SFT and classic GCSL by explicitly guiding the model to learn the directional progression of quality. We also propose natural-language goal representations to better leverage the semantic understanding and reasoning capabilities of LLMs. We evaluate our method on three tasks: non-toxic generation, code generation, and LLM for recommendation. Results show that our approach consistently outperforms standard offline fine-tuning baselines while retaining the efficiency, scalability, and simple data requirements of supervised learning.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。