SFT-then-RLVR is widely used for post-training reasoning models, but why this specific ordering, and why RLVR-only stalls at cold start, have lacked a unifying theoretical account. We provide that account under a unified loss family using the Tsallis -logarithm. is a single-parameter family that interpolates between RLVR (at , the ) and the log-marginal-likelihood over latent trajectories (at , the ), under which the standard pipeline corresponds to a stepwise schedule. All members share the same per-example gradient direction, differing only by a per-instance amplification that reweights each instance independently of the learning rate. Under gradient flow analysis, we show that the exploitation pole requires time to escape cold start but is robust to label noise, while the density-estimation pole escapes in but memorizes label noise. This separation explains how SFT () first moves the model out of the cold-start regime, followed by the more robust RLVR (), under the SFT-then-RLVR paradigm. We further derive two Monte Carlo estimators that directly optimize fixed- on the continuum, without annotated rationales: Gradient-Amplified RL (GARL) and Posterior-Attenuated Fine-Tuning (PAFT), with shared bias but different variance and stability properties. On FinQA, HotPotQA, and MuSiQue, GARL at sufficiently high substantially mitigates cold-start stalling, escaping cold start where GRPO fails entirely. In warm start, GARL at low dominates FinQA where training is stable; on HotPotQA and MuSiQue, GARL destabilizes and PAFT at remains stable, reaching on HotPotQA ( over GRPO).

生成讲解博客的中文版本

生成AI智能校验的中文版本