通过优化推理中的关键表示,提升大模型的链式思考能力。
Enhancing Chain-of-Thought Reasoning with Critical Representation Fine-tuning
- 识别推理过程中影响最终输出的关键表示并动态优化。
- 在8个基准上显著提升算术与常识推理性能,单次提示准确率提升16.4%。
- 轻量级微调,适配少样本场景,可替代传统高效微调方法。
Representation Fine-tuning (ReFT) 是一种新兴的参数高效微调(PEFT)方法,仅通过修改表示空间即可显著提升参数效率。本文研究将 ReFT 应用于复杂推理任务。然而,直接使用原始 ReFT 方法(在每层首尾固定位置修改表示)效果不佳,因其固定位置的表示对输出影响不确定。我们发现,在复杂推理中常存在关键表示:它们或整合前序层的重要信息,或调控后续层表示,经逐层传播后对最终输出有显著影响。因此,优化这些关键表示有望大幅提升推理性能。基于此,我们提出 Critical Representation Fine-Tuning (CRFT),通过信息流分析识别关键表示,并在监督学习框架下,于低秩线性子空间中动态优化它们,同时冻结基础模型。CRFT 在 LLaMA 与 Mistral 模型族上,于八个算术与常识推理基准上验证了有效性与高效性。此外,该方法在少样本设置中表现优异,使单次提示准确率提升 16.4%。本工作揭示了表示层面优化在链式思考推理中的巨大潜力,提供了一种轻量且强大的替代传统 PEFT 的方案。
原文摘要 · Abstract (English)
Representation Fine-tuning (ReFT), a recently proposed Parameter-Efficient Fine-Tuning (PEFT) method, has attracted widespread attention for significantly improving parameter efficiency by editing representation space alone. In this work, we investigate applying ReFT to complex reasoning tasks. However, directly using the native ReFT method, which modifies fixed representations at the beginning and end of each layer, yields suboptimal performance, as these fixed-position representations have uncertain impact on the outputs. We observe that, in complex reasoning tasks, there often exist certain critical representations. These representations either integrate significant information from preceding layers or regulate subsequent layer representations. Through layer-by-layer propagation, they exert a substantial influence on the final output. Naturally, fine-tuning these critical representations has the potential to greatly enhance reasoning performance. Building upon these insights, we propose Critical Representation Fine-Tuning (CRFT), a novel method that identifies and optimizes these critical representations through information flow analysis. CRFT operates within a supervised learning framework, dynamically optimizing critical representations in a low-rank linear subspace while freezing the base model. The effectiveness and efficiency of our method are validated across eight benchmarks for arithmetic and commonsense reasoning, using LLaMA and Mistral model families. Furthermore, our method also adapts effectively to few-shot settings, boosting one-shot accuracy by 16.4%. Our work highlights the untapped potential of representation-level optimization for CoT reasoning, offering a lightweight yet powerful alternative to traditional PEFT methods.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。