跳到正文
arXiv cs.AI· Nirmit Joshi, Roey Magen, Nathan Srebro, Nikolaos Tsilivis, Gal Vardi·· 11 小时前AI 评分26

从多个思考者中学习:CoT 异质性如何影响高效可学习性

Learning to Think from Multiple Thinkers: How Chain-of-Thought Heterogeneity Affects Efficient Learnability

AI 导读

研究从学习理论视角分析多来源异构 CoT 监督对可学习性的影响:即使拟合单一来源的同质 CoT 轨迹在计算上可行,从多来源被动收集的轨迹学习仍存在密码学难度,原因可能是决定各来源在不同领域部分贡献轨迹的难学习贡献偏差,或收到未过滤的异构混合数据。作者提出一种计算高效算法,主动自适应地从多来源收集 CoT,且每来源 CoT 预算完全独立于目标误差 ε。

正文 · 原文

View PDF HTML (experimental)

Abstract:Chain-of-thought (CoT) supervision makes computationally hard learning problems tractable by exposing intermediate steps that are easy to learn via next-token prediction. However, in practice, CoT datasets draw on heterogeneous sources with different reasoning styles, and substantial effort goes into curating supervision suitable for next-token training. What role does this curation play in enabling the computational advantage of CoT supervision? In this work, we take a first step toward understanding this question from a learning-theoretic perspective. We introduce several models of $heterogeneous$ $CoT$ $supervision$ from multiple sources, each providing correct traces with the same final answer but different intermediate steps. Assuming that fitting a next-token predictor to $homogeneous$ traces from any single source is computationally tractable, we ask when this suffices for efficient learning from heterogeneous supervision.
We show $cryptographic$ $hardness$ of learning from $passively$ collected traces from multiple sources, even though learning from homogeneous CoTs is easy. This hardness can stem either from $hard$-$to$-$learn$ $contribution$ $biases$ determining which sources contribute traces on different parts of the domain, or from receiving an $unfiltered$ heterogeneous mixture (though a filtered subset of homogeneous traces is sufficient for efficient learning). On the positive side, inspired by iterative and adaptive fine-tuning of language models, we give a computationally efficient learning algorithm that $actively$ and $adaptively$ collects CoTs from multiple sources with a per-source CoT budget completely independent of the target error $\varepsilon$. We argue that our results illuminate data collection and curation practices central to making CoT supervision effective for learning.
Comments: Comments are welcome. Revised the presentation to highlight the connections of the main theorems to practice with conceptual messages
Subjects: Machine Learning (cs.LG); Artificial Intelligence (cs.AI); Computational Complexity (cs.CC); Machine Learning (stat.ML)
Cite as: arXiv:2604.24737 [cs.LG]
  (or arXiv:2604.24737v2 [cs.LG] for this version)
  https://doi.org/10.48550/arXiv.2604.24737

arXiv-issued DOI via DataCite

Submission history

From: Nirmit Joshi [view email]
[v1] Mon, 27 Apr 2026 17:43:44 UTC (166 KB)
[v2] Thu, 5 Nov 2026 10:27:14 UTC (321 KB)

来源:arXiv cs.AI · arxiv.org