English
Related papers

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

200 papers

In post-training for reasoning Large Language Models (LLMs), the current state of practice trains LLMs in two independent stages: Supervised Fine-Tuning (SFT) and Reinforcement Learning with Verifiable Rewards (RLVR, shortened as ``RL''…

Machine Learning · Computer Science 2025-10-03 Feiyang Kang , Michael Kuchnik , Karthik Padthe , Marin Vlastelica , Ruoxi Jia , Carole-Jean Wu , Newsha Ardalani

Large language models have achieved significant reasoning improvements through reinforcement learning with verifiable rewards (RLVR). Yet as model capabilities grow, constructing high-quality reward signals becomes increasingly difficult,…

Machine Learning · Computer Science 2026-04-21 Salman Rahman , Jingyan Shen , Anna Mordvina , Hamid Palangi , Saadia Gabriel , Pavel Izmailov

Supervised Fine-Tuning (SFT) and Reinforcement Learning (RL) dominate the post-training landscape for mathematical reasoning, yet differ fundamentally in their reliance on expert trajectories. To understand the optimal way to harness these…

Machine Learning · Computer Science 2026-05-12 Bowen Ding , Yuhan Chen , Jiayang Lyv , Jiyao Yuan , Qi Zhu , Shuangshuang Tian , Dantong Zhu , Futing Wang , Heyuan Deng , Fei Mi , Lifeng Shang , Tao Lin

SFT and RLVR represent two fundamental yet distinct paradigms for LLM post-training, each excelling in distinct dimensions. SFT expands knowledge breadth while RLVR enhances reasoning depth. Yet integrating these complementary strengths…

Machine Learning · Computer Science 2026-05-04 Chaohao Yuan , Chenghao Xiao , Yu Rong , Hong Cheng , Long-Kai Huang

The standard post-training recipe for large multimodal models (LMMs) applies supervised fine-tuning (SFT) on curated demonstrations followed by reinforcement learning with verifiable rewards (RLVR). However, SFT introduces distributional…

Computer Vision and Pattern Recognition · Computer Science 2026-05-05 Sudong Wang , Weiquan Huang , Xiaomin Yu , Zuhao Yang , Hehai Lin , Keming Wu , Chaojun Xiao , Chen Chen , Wenxuan Wang , Beier Zhu , Yunjian Zhang , Chengwei Qin

Reinforcement Learning with Verifiable Rewards (RLVR) for Multimodal Large Language Models (MLLMs) is highly dependent on high-quality labeled data, which is often scarce and prone to substantial annotation noise in real-world scenarios.…

After the pretraining stage of LLMs, techniques such as SFT, RLHF, RLVR, and RFT are applied to enhance instruction-following ability, mitigate undesired responses, improve reasoning capability and enable efficient domain adaptation with…

Computation and Language · Computer Science 2025-10-17 Zhichao Wang , Andy Wong , Ruslan Belkin

The prevailing paradigm for training large reasoning models--combining Supervised Fine-Tuning (SFT) with Reinforcement Learning with Verifiable Rewards (RLVR)--is fundamentally constrained by its reliance on high-quality, human-annotated…

Machine Learning · Computer Science 2026-03-24 Yuanfu Wang , Zhixuan Liu , Xiangtian Li , Chaochao Lu , Chao Yang

Reinforcement learning with verifiable rewards (RLVR) has emerged as a promising paradigm for post-training large language models (LLMs) on complex reasoning tasks. Yet, the conditions under which RLVR yields robust generalization remain…

Machine Learning · Computer Science 2026-03-05 Brian Lu , Hongyu Zhao , Shuo Sun , Hao Peng , Rui Ding , Hongyuan Mei

Reinforcement learning with verifiable rewards (RLVR) enables large language models to acquire slow, multi-step reasoning from sparse final-answer signals. We provide a statistical-physics picture of this emergence. We show that an…

Artificial Intelligence · Computer Science 2026-05-08 Sihan Hu , Xiansheng Cai , Yuan Huang , Zhiyuan Yao , Linfeng Zhang , Pan Zhang , Youjin Deng , Kun Chen

Reinforcement Learning with Verifiable Rewards (RLVR) effectively trains reasoning models that rely on abundant perfect labels, but its vulnerability to unavoidable noisy labels due to expert scarcity remains critically underexplored. In…

Machine Learning · Computer Science 2026-04-07 Shenzhi Yang , Guangcheng Zhu , Bowen Song , Sharon Li , Haobo Wang , Xing Zheng , Yingfan Ma , Zhongqi Chen , Weiqiang Wang , Gang Chen

Large Language Models (LLMs) often struggle with problems that require multi-step reasoning. For small-scale open-source models, Reinforcement Learning with Verifiable Rewards (RLVR) fails when correct solutions are rarely sampled even…

Computation and Language · Computer Science 2026-03-02 Yihe Deng , I-Hung Hsu , Jun Yan , Zifeng Wang , Rujun Han , Gufeng Zhang , Yanfei Chen , Wei Wang , Tomas Pfister , Chen-Yu Lee

Supervised Fine-Tuning (SFT) followed by Reinforcement Learning (RL) is a standard post-training recipe for improving Large Language Models (LLM) reasoning, but why it works remains unclear. We revisit the common claim that ``SFT memorizes,…

Machine Learning · Computer Science 2026-05-12 Hangzhan Jin , Sitao Luan , Tianwei Ni , Sicheng Lyu , Guillaume Rabusseau , Reihaneh Rabbany , Doina Precup , Mohammad Hamdaqa

Reinforcement learning (RL) with verifiable rewards has recently catalyzed a wave of "MLLM-r1" approaches that bring RL to vision language models. Most representative paradigms begin with a cold start, typically employing supervised…

Machine Learning · Computer Science 2026-02-02 Kun Chen , Peng Shi , Haibo Qiu , Zhixiong Zeng , Siqi Yang , Wenji Mao , Lin Ma

Post-training methods, especially Supervised Fine-Tuning (SFT) and Reinforcement Learning (RL), play an important role in improving large language models' (LLMs) complex reasoning abilities. However, the dominant two-stage pipeline (SFT…

Machine Learning · Computer Science 2025-12-22 Mingyu Su , Jian Guan , Yuxian Gu , Minlie Huang , Hongning Wang

With the advent of foundation models, prompt tuning has positioned itself as an important technique for directing model behaviors and eliciting desired responses. Prompt tuning regards selecting appropriate keywords included into the input,…

Machine Learning · Computer Science 2024-07-23 Yunseon Choi , Sangmin Bae , Seonghyun Ban , Minchan Jeong , Chuheng Zhang , Lei Song , Li Zhao , Jiang Bian , Kee-Eung Kim

Test-time scaling has been shown to substantially improve large language models' (LLMs) mathematical reasoning. However, for a large portion of mathematical corpora, especially theorem proving, RLVR's scalability is limited: intermediate…

Computation and Language · Computer Science 2025-11-24 Zhen Wang , Zhifeng Gao , Guolin Ke

Post-training of reasoning LLMs is a holistic process that typically consists of an offline SFT stage followed by an online reinforcement learning (RL) stage. However, SFT is often optimized in isolation to maximize SFT performance alone.…

Machine Learning · Computer Science 2026-05-29 Dylan Zhang , Yufeng Xu , Haojin Wang , Qingzhi Chen , Hao Peng

Foundation models encode rich structural knowledge but often rely on post-training procedures to adapt their reasoning behavior to specific tasks. Popular approaches such as reinforcement learning with verifiable rewards (RLVR) and…

Machine Learning · Computer Science 2026-01-21 Dake Bu , Wei Huang , Andi Han , Atsushi Nitanda , Bo Xue , Qingfu Zhang , Hau-San Wong , Taiji Suzuki

Designing effective reasoning-capable LLMs typically requires training using Reinforcement Learning with Verifiable Rewards (RLVR) or distillation with carefully curated Long Chain of Thoughts (CoT), both of which depend heavily on…

Artificial Intelligence · Computer Science 2026-02-02 Safal Shrestha , Minwu Kim , Aadim Nepal , Anubhav Shrestha , Keith Ross
‹ Prev 1 2 3 10 Next ›