English
Related papers

Related papers: How Fast Should a Model Commit to Supervision? Tra…

200 papers

The standard post-training recipe for large reasoning models, supervised fine-tuning followed by reinforcement learning (SFT-then-RL), may limit the benefits of the RL stage: while SFT imitates expert demonstrations, it often causes…

Machine Learning · Computer Science 2026-02-10 Hao Wang , Hao Gu , Hongming Piao , Kaixiong Gong , Yuxiao Ye , Xiangyu Yue , Sirui Han , Yike Guo , Dapeng Wu

Despite significant progress, Vision-Language Models (VLMs) still struggle with complex visual reasoning, where multi-step dependencies cause early errors to cascade through the reasoning chain. Existing post-training paradigms are limited:…

Computer Vision and Pattern Recognition · Computer Science 2025-11-14 Yanbei Jiang , Chao Lei , Yihao Ding , Krista Ehinger , Jey Han Lau

The remarkable capabilities of modern large reasoning models are largely unlocked through post-training techniques such as supervised fine-tuning (SFT) and reinforcement learning (RL). However, the architectural mechanisms behind such…

Artificial Intelligence · Computer Science 2026-04-15 Yein Park , Minbyul Jeong , Jaewoo Kang

Recent research enhances language model reasoning by scaling test-time compute via longer chain-of-thought traces. This often improves accuracy but also introduces redundancy and high computational cost, especially for small language models…

Machine Learning · Computer Science 2025-05-26 Xuechen Zhang , Zijian Huang , Chenshun Ni , Ziyang Xiong , Jiasi Chen , Samet Oymak

This work revisits the dominant supervised fine-tuning (SFT) then reinforcement learning (RL) paradigm for training Large Vision-Language Models (LVLMs), and reveals a key finding: SFT can significantly undermine subsequent RL by inducing…

Computation and Language · Computer Science 2025-04-17 Hardy Chen , Haoqin Tu , Fali Wang , Hui Liu , Xianfeng Tang , Xinya Du , Yuyin Zhou , Cihang Xie

Large language models (LLMs) have achieved remarkable progress in reasoning tasks, yet the optimal integration of Supervised Fine-Tuning (SFT) and Reinforcement Learning (RL) remains a fundamental challenge. Through comprehensive analysis…

Computation and Language · Computer Science 2025-06-25 Yuqian Fu , Tinghong Chen , Jiajun Chai , Xihuai Wang , Songjun Tu , Guojun Yin , Wei Lin , Qichao Zhang , Yuanheng Zhu , Dongbin Zhao

Reinforcement Learning with Verifiable Rewards (RLVR) has become a standard paradigm for reasoning in Large Language Models. However, optimizing solely for final-answer correctness often drives models into aimless, verbose exploration,…

Computation and Language · Computer Science 2026-01-14 Jiangshan Duo , Hanyu Li , Hailin Zhang , Yudong Wang , Sujian Li , Liang Zhao

Multimodal reasoning in vision-language models (VLMs) typically relies on a two-stage process: supervised fine-tuning (SFT) and reinforcement learning (RL). In standard SFT, all tokens contribute equally to the loss, even though reasoning…

Artificial Intelligence · Computer Science 2026-03-20 Shaked Perek , Ben Wiesel , Avihu Dekel , Nimrod Shabtay , Eli Schwartz

Supervised Fine-Tuning (SFT) is widely used for task-specific adaptation, yet recent work shows it systematically undermines reasoning generalization. We argue the root cause is not memorization itself, but its target: vanilla SFT drives…

Machine Learning · Computer Science 2026-05-26 Ruiying Peng , Mengyu Yang , Jing Lei , Xiaohui Li , Xueyu Wu , Xinlei Chen

Reinforcement learning with verifiable rewards (RLVR) has significantly boosted the reasoning capability of language models (LMs). However, existing RLVR approaches train LMs based on their own on-policy responses and are constrained by the…

Machine Learning · Computer Science 2026-04-17 Chenming Tang , Hsiu-Yuan Huang , Weijie Liu , Clive Bai , Saiyong Yang , Yunfang Wu

Reinforcement Learning with Verifiable Rewards (RLVR) reliably improves the reasoning performance of large language models, yet it appears to modify only a small fraction of parameters. We revisit this paradox and show that sparsity is a…

Through encouraging self-exploration, reinforcement learning from verifiable rewards (RLVR) has significantly advanced the mathematical reasoning capabilities of large language models. As the starting point for RLVR, the capacity of…

Machine Learning · Computer Science 2026-03-18 Yongyu Mu , Jiali Zeng , Fandong Meng , JingBo Zhu , Tong Xiao

Reinforcement Learning from Verifiable Rewards (RLVR) on chain-of-thought reasoning has become a standard part of language model post-training recipes. A common assumption is that the reasoning chains trained through RLVR reliably represent…

Computation and Language · Computer Science 2026-04-27 Qinan Yu , Alexa Tartaglini , Peter Hase , Carlos Guestrin , Christopher Potts

Improving Multi-modal Large Language Models (MLLMs) in the post-training stage typically relies on supervised fine-tuning (SFT) or reinforcement learning (RL), which require expensive and manually annotated multi-modal data--an ultimately…

Computation and Language · Computer Science 2025-10-28 Lai Wei , Yuting Li , Chen Wang , Yue Wang , Linghe Kong , Weiran Huang , Lichao Sun

The prevailing post-training paradigm for Large Reasoning Models (LRMs) - Supervised Fine-Tuning (SFT) followed by Reinforcement Learning (RL) - suffers from an intrinsic optimization mismatch: the rigid supervision inherent in SFT induces…

Machine Learning · Computer Science 2026-03-19 Zhengyang Zhao , Lu Ma , Yizhen Jiang , Xiaochen Ma , Zimo Meng , Chengyu Shen , Lexiang Tang , Haoze Sun , Peng Pei , Wentao Zhang

Reinforcement learning using verifiable rewards (RLVR) improves LLM reasoning, but the conditions under which it transfers across domains -- and why it does so -- remain under-explored. We study cross-domain transfer in a 7B model whose SFT…

Machine Learning · Computer Science 2026-05-29 Mayug Maniparambil , Arjun Karuvally , Terrence Sejnowski , Fergal Reid

Large language models (LLMs) trained for step-by-step reasoning often become excessively verbose, raising inference cost. Standard Reinforcement Learning with Verifiable Rewards (RLVR) pipelines filter out ``easy'' problems for training…

Reinforcement learning with verifiable reward (RLVR) has been instrumental in eliciting strong reasoning capabilities from large language models (LLMs) via long chains of thought (CoT). During RLVR training, we formalize and systemically…

Computation and Language · Computer Science 2026-02-24 Cheonbok Park , Jeonghoon Kim , Joosung Lee , Sanghwan Bae , Jaegul Choo , Kang Min Yoo

Despite advances in multilingual capabilities, most large language models (LLMs) remain English-centric in their training and, crucially, in their production of reasoning traces. Even when tasked with non-English problems, these models…

Computation and Language · Computer Science 2026-04-15 Daniil Gurgurov , Tom Röhr , Sebastian von Rohrscheidt , Josef van Genabith , Alexander Löser , Simon Ostermann

Recent advances in vision-language models (VLMs) reasoning have been largely attributed to the rise of reinforcement Learning (RL), which has shifted the community's focus away from the supervised fine-tuning (SFT) paradigm. Many studies…