Abstract:Supervised fine-tuning (SFT) and reinforcement learning with verifiable rewards (RLVR) are two widely used post-training paradigms for improving the reasoning ability of large language models (LLMs). Recent methods attempt to integrate SFT and RLVR in a single stage by reweighting or scheduling their objectives. However, such coupling can be counterproductive because supervised updates are not uniformly beneficial for reward optimization. To address this, we propose BRIDGE, a scalable framework in which SFT learns to supervise RL by selectively transferring knowledge that improves reward optimization. Specifically, BRIDGE alternates two updates at each meta-training step: a base-model update that fuses the SFT and RL gradients, and an update to a lightweight low-rank adapter (LoRA) that coordinates the two objectives by maximizing a cooperative-gain signal, defined as the reward of joint SFT-RL training over an RL-only baseline. Across five mathematical reasoning benchmarks, BRIDGE consistently outperforms two-stage cold start, naive mixing, and representative single-stage integration baselines, yielding over three points average absolute improvement and more stable training dynamics. We further show that BRIDGE extends to logical reasoning and generalizes out-of-distribution to code and science without additional training, while staying robust under noisy rewards.
| Comments: | ICML 2026 |
| Subjects: | Computation and Language (cs.CL) |
| Cite as: | arXiv:2509.06948 [cs.CL] |
| (or arXiv:2509.06948v3 [cs.CL] for this version) | |
| https://doi.org/10.48550/arXiv.2509.06948 arXiv-issued DOI via DataCite |
Submission history
From: Liang Chen [view email]
[v1]
Mon, 8 Sep 2025 17:58:02 UTC (517 KB)
[v2]
Thu, 16 Oct 2025 17:30:21 UTC (549 KB)
[v3]
Sat, 30 May 2026 09:01:09 UTC (115 KB)
