Kuangpu Guo
Author directory2026
Understanding and Mitigating Spurious Signal Amplification in Test-Time Reinforcement Learning for Math Reasoning
Yongcan Yu | Lingxiao He | Jian Liang | Kuangpu Guo | Meng Wang | Qianlong Xie | Xingxing Wang | Ran He
Findings of the Association for Computational Linguistics: ACL 2026
Yongcan Yu | Lingxiao He | Jian Liang | Kuangpu Guo | Meng Wang | Qianlong Xie | Xingxing Wang | Ran He
Findings of the Association for Computational Linguistics: ACL 2026
Test-time reinforcement learning (TTRL) always adapts models at inference time via pseudo-labeling, leaving it vulnerable to spurious optimization signals from label noise.Through an empirical study, we observe that responses with medium consistency form an ambiguity region and constitute the primary source of reward noise.Crucially, we find that such spurious signals can be even amplified through group-relative advantage estimation.Motivated by these findings, we propose a unified framework, Debiased and Denoised test-time Reinforcement Learning (DDRL), to mitigate spurious signals.Concretely, DDRL first applies a frequency-based sampling strategy to exclude ambiguous samples while maintaining a balanced set of positive and negative examples.It then adopts a debiased advantage estimation with fixed advantages, removing the bias introduced by group-relative policy optimization.Finally, DDRL incorporates a consensus-based off-policy refinement stage, which leverages the rejection-sampled dataset to enable efficient and stable model updates.Experiments on three large language models across multiple mathematical reasoning benchmarks demonstrate that DDRL consistently outperforms existing TTRL baselines.The code is available at https://github.com/yuyongcan/DDRL.
Supervised Fine-Tuning for Reasoning Large Language Models: A Survey
Yongcan Yu | Kuangpu Guo | Jian Liang | Lingxiao He | Meng Wang | Ran He
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Yongcan Yu | Kuangpu Guo | Jian Liang | Lingxiao He | Meng Wang | Ran He
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Large reasoning models have recently demonstrated remarkable capabilities in solving complex tasks, where supervised fine-tuning (SFT) on long chain-of-thought data serves as a crucial foundation for eliciting and enhancing their reasoning abilities. Despite rapid progress in both improving and analyzing reasoning-oriented SFT, the field still lacks a systematic survey that consolidates its fast-growing literature. To fill this gap, we present a comprehensive review of recent advancements in reasoning SFT, examining the literature through the dual lenses of methodological design and analytical investigation. First, we review methodological improvements across the SFT pipeline and categorize them into data-centric approaches and algorithm-centric innovations. Second, we reorganize analytical studies along three dimensions: data characteristics, optimization dynamics, and mechanistic insights. Finally, by synthesizing current research focuses and remaining bottlenecks, we outline promising future directions for reasoning SFT. We hope this survey deepens the understanding of reasoning SFT and paves the way for advanced reasoning models.