跳到正文
arXiv cs.AI· Jingyan Shen, Ang Li, Salman Rahman, Yifan Sun, Micah Goldblum, Matus Telgarsky, Pavel Izmailov·· 5 小时前AI 评分40

从预训练到后训练理解推理:以国际象棋为受控测试床的研究

Understanding Reasoning from Pretraining to Post-Training

AI 导读

一项研究以国际象棋为受控测试床,考察预训练选择如何影响 RL 后训练收益。研究者在 5M 至 1B 参数模型上进行预训练、合成推理轨迹的 SFT 及可验证奖励的 RL,发现给定 RL 计算量下的性能可由预训练 loss 预测,RL 奖励曲线斜率随预训练 token 数近似线性提升。在数学文本上训练 1B 模型也复现了同样的预测规律。

正文 · 原文

View PDF

Abstract:Reinforcement learning (RL) has become central to improving large language models (LLMs) on complex reasoning tasks, yet RL post-training is largely studied in isolation from the pretraining that precedes it. As a result, two basic questions remain open: (1) how do pretraining choices (model size, data) shape the returns to RL compute, and (2) what does RL actually do to the model? These questions are difficult to study in the standard LLM setting: pretraining corpora are vast and uncontrolled, making it hard to attribute behaviors to pretraining versus RL, and systematic compute sweeps across both stages are prohibitively expensive. To address these challenges, we use chess as a controlled testbed for studying reasoning across the full pretraining-to-post-training pipeline. We follow the standard LLM training pipeline by pretraining language models from 5M to 1B parameters on human chess games, supervised fine-tuning on synthetic reasoning traces, and running RL on chess puzzles with verifiable rewards. Using this framework, we find that the post-RL performance at given RL compute level is well-predicted from the pretraining loss, and slope of the RL reward curves improves approximately linearly with the pretraining tokens. Beyond scaling, we find that RL does not simply sharpen the SFT policy: on easy puzzles it amplifies correct moves the SFT policy already preferred, while on hard puzzles it surfaces correct moves that were nearly absent under SFT. We further test whether our findings transfer beyond chess by training a 1B language model on math-domain text, where the same predictive pattern emerges: longer-pretrained checkpoints reach higher post-RL performance and improve faster under RL. In sum, we provide a quantitative account of the pretraining-to-RL interface and a controlled testbed for studying the science of reasoning across the full pretraining-to-post-training pipeline.
Subjects: Machine Learning (cs.LG); Artificial Intelligence (cs.AI); Computation and Language (cs.CL)
Cite as: arXiv:2607.16097 [cs.LG]
  (or arXiv:2607.16097v3 [cs.LG] for this version)
  https://doi.org/10.48550/arXiv.2607.16097

arXiv-issued DOI via DataCite

Submission history

From: Jingyan Shen [view email]
[v1] Fri, 17 Jul 2026 16:31:58 UTC (2,676 KB)
[v2] Sun, 9 Aug 2026 03:34:06 UTC (2,685 KB)
[v3] Wed, 4 Nov 2026 15:59:35 UTC (2,640 KB)

来源:arXiv cs.AI · arxiv.org