揭示测试时扩展策略的样本效率差异,证明自校正可实现多任务泛化。
Sample Complexity and Representation Ability of Test-time Scaling Paradigms
- 对比自一致性与最佳n选一,发现后者样本需求更低
- 自校正结合验证反馈,使模型在测试时模拟在线学习
- 理论+实证支持,适合研究大模型推理机制者阅读
测试时扩展范式显著提升了大语言模型在复杂任务上的表现。尽管其实验成功明显,但对不同测试时策略(如自一致性、最佳n选一、自校正)的样本效率的理论理解仍有限。本文首先建立两种重复采样策略的分离结果:自一致性需Θ(1/Δ²)次采样才能得出正确答案,而最佳n选一仅需Θ(1/Δ),其中Δ<1为正确答案与第二高概率答案之间的概率差距。其次,我们给出自校正方法结合验证反馈的表达能力结果:它使Transformer在测试时能够模拟专家池中的在线学习。因此,单一Transformer架构可在无先验任务知识的情况下,明确解决多个任务,将Transformer的表示理论从单任务扩展至多任务场景。最后,我们通过实验验证了理论结果,展示了自校正方法的实际有效性。
原文摘要 · Abstract (English)
Test-time scaling paradigms have significantly advanced the capabilities of large language models (LLMs) on complex tasks. Despite their empirical success, theoretical understanding of the sample efficiency of various test-time strategies -- such as self-consistency, best-of-$n$, and self-correction -- remains limited. In this work, we first establish a separation result between two repeated sampling strategies: self-consistency requires $Θ(1/Δ^2)$ samples to produce the correct answer, while best-of-$n$ only needs $Θ(1/Δ)$, where $Δ< 1$ denotes the probability gap between the correct and second most likely answers. Next, we present an expressiveness result for the self-correction approach with verifier feedback: it enables Transformers to simulate online learning over a pool of experts at test time. Therefore, a single Transformer architecture can provably solve multiple tasks without prior knowledge of the specific task associated with a user query, extending the representation theory of Transformers from single-task to multi-task settings. Finally, we empirically validate our theoretical results, demonstrating the practical effectiveness of self-correction methods.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。