Papers › Reinforcement Fine-Tuning Naturally Mitigates Forgetting in Continual Post-Training

Reinforcement Fine-Tuning Naturally Mitigates Forgetting in Continual Post-Training

7 Jul 2025arXiv:2507.05386archive 2025-07-28

Song Lai, Haohan Zhao, Rong Feng, Changyi Ma, Wenzhuo LIU, Hongbo Zhao, Xi Lin, Dong Yi, Min Xie, Qingfu Zhang, Hongbin Liu, Gaofeng Meng, Fei Zhu

Continual post-training (CPT) is a popular and effective technique for adapting foundation models like multimodal large language models to specific and ever-evolving downstream tasks. While existing research has primarily concentrated on methods like data replay, model expansion, or parameter regularization, the fundamental role of the learning paradigm within CPT remains largely unexplored. This paper presents a comparative analysis of two core post-training paradigms: supervised fine-tuning (SFT) and reinforcement fine-tuning (RFT), investigating their respective impacts on knowledge retention during CPT. Our experiments are conducted on a benchmark comprising seven diverse multimodal tasks, utilizing Qwen2.5-VL-7B-Instruct as the base model for continual post-training. The investigation yields two significant findings: (1) When continuously learning on downstream tasks, SFT leads to catastrophic forgetting of previously learned tasks. In contrast, RFT inherently preserves prior knowledge and achieve performance comparable to multi-task training. (2) RFT successfully protects and even enhances the model's general knowledge on standard benchmarks (e.g., MMMU and MMLU-Pro). Conversely, SFT degrades general model capabilities severely. Further analysis shows that explicit mechanisms, such as KL penalty and chain-of-thought reasoning, are not the primary factors. Instead, we find that the implicit regularization inherent to RFT is a key factor in mitigating forgetting. Finally, we propose a rollout-based instance filtering algorithm to improve the stability and efficiency of RFT. Our comprehensive study demonstrates the superiority of RFT as a robust paradigm for continual post-training.

PaperPDFCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2507.05386")

Code

Syntology Ran 3 of 10 code samples harvested from 1 repository linked to this paper; 7 have no recorded run. Of those that ran: 3 ran with no contract checked.

By repository: found in paper text by Syntology: 10 samples from 1 repository, 3 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

zhhvvv/rft_vs_sft found in paper text by Syntology report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

10 samples harvested; 3 ran; 0 honoured the contract we drafted; 7 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

3ran
7unverified

Licence: 10 of the 10 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from zhhvvv/rft_vs_sft. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

get_kl_controller zhhvvv/rft_vs_sft/EasyR1/verl/trainer/core_algos.py found in paper text by Syntology ran no licence file found · pointer only · 33a3cccef610855c · report
prepare_fa2_from_position_ids zhhvvv/rft_vs_sft/EasyR1/verl/models/transformers/flash_attention_utils.py found in paper text by Syntology ran no licence file found · pointer only · 4049cf08f994464e · report
unpad_dataproto zhhvvv/rft_vs_sft/EasyR1/verl/protocol.py found in paper text by Syntology ran no licence file found · pointer only · a91c18341292d50e · report
compute_gae_advantage_return zhhvvv/rft_vs_sft/EasyR1/verl/trainer/core_algos.py found in paper text by Syntology unverified no licence file found · pointer only · d3ee7b3d8f0cf2fa · report
compute_grpo_outcome_advantage zhhvvv/rft_vs_sft/EasyR1/verl/trainer/core_algos.py found in paper text by Syntology unverified no licence file found · pointer only · b7dacadfa17e35d2 · report
eval_logit_processor zhhvvv/rft_vs_sft/LLaMA-Factory/src/llamafactory/train/sft/metric.py found in paper text by Syntology unverified no licence file found · pointer only · 2fba3c22367e0778 · report
flash_attention_forward zhhvvv/rft_vs_sft/EasyR1/verl/models/transformers/flash_attention_utils.py found in paper text by Syntology unverified no licence file found · pointer only · d71e909038b965a1 · report
pad_dataproto_to_divisor zhhvvv/rft_vs_sft/EasyR1/verl/protocol.py found in paper text by Syntology unverified no licence file found · pointer only · c5aeb7231bf64063 · report
process_for_parquet zhhvvv/rft_vs_sft/rollout_filter.py found in paper text by Syntology unverified no licence file found · pointer only · b5b031edf82a3af8 · report
union_tensor_dict zhhvvv/rft_vs_sft/EasyR1/verl/protocol.py found in paper text by Syntology unverified no licence file found · pointer only · ad658a1d6fe829ba · report

Tasks

General KnowledgeMMLU

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

BASESFT

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections