让大模型通过可组合的思维链学习,实现跨任务推理
Learning Composable Chains-of-Thought
- 设计可组合的思维链格式,使模型能拆解并重组基础推理技能
- 在字符串和自然语言任务上,零样本性能超越现有方法
- 适合希望低成本构建通用推理能力的研究者
大语言模型常通过标注的思维链(CoT)数据训练来提升推理能力,但此类数据获取成本高。我们希望模型能超越训练分布,实现组合式泛化:将基础推理技能组合解决新问题。针对无标注组合任务的情况,发现仅训练原子任务的CoT效果有限;但微调原子任务的CoT格式使其可组合后,显著提升泛化能力。可在原子任务上训练'可组合CoT'模型,结合多任务学习或模型融合,在目标组合任务上获得更好零样本表现。再用少量组合数据通过拒绝采样微调(RFT)进一步优化。在字符串操作与自然语言技能组合任务中,基于可组合CoT的训练方案,在相同数据预算下优于多任务学习与持续微调基线。
原文摘要 · Abstract (English)
A common approach for teaching large language models (LLMs) to reason is to train on chain-of-thought (CoT) traces of in-distribution reasoning problems, but such annotated data is costly to obtain for every problem of interest. We want reasoning models to generalize beyond their training distribution, and ideally to generalize compositionally: combine atomic reasoning skills to solve harder, unseen reasoning tasks. We take a step towards compositional generalization of reasoning skills when addressing a target compositional task that has no labeled CoT data. We find that simply training models on CoT data of atomic tasks leads to limited generalization, but minimally modifying CoT formats of constituent atomic tasks to be composable can lead to improvements. We can train "atomic CoT" models on the atomic tasks with Composable CoT data and combine them with multitask learning or model merging for better zero-shot performance on the target compositional task. Such a combined model can be further bootstrapped on a small amount of compositional data using rejection sampling fine-tuning (RFT). Results on string operations and natural language skill compositions show that training LLMs on Composable CoT outperforms multitask learning and continued fine-tuning baselines within a given training data budget.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。