Skip to content
Preprint

Taming the Implicit: Dual-Channel Risk-Aware Reinforcement Fine-Tuning for Continual Multimodal Post-Training

Aug 2026 · 0 citations · 19 references
Computer Science

TL;DR

RAPO is proposed, the first dual-channel framework for explicit risk governance in continual RFT, and is a plug-and-play strategy requiring no cross-task memory, generalizes to any RFT algorithm without modification.

Abstract

Reinforcement fine-tuning (RFT) is widely believed to inherently resist catastrophic forgetting in continual post-training of multimodal large language models. Under pronounced task distributional shifts, however, forgetting across representative RFT algorithms escalates sharply. This stems from the implicit reward-variance regularization inherent to RFT, which proves incapable of suppressing uncontrolled optimization risk. We propose Risk-Aware Policy Optimization (RAPO), the first dual-channel framework for explicit risk governance in continual RFT. On the policy channel, Risk-Aware Policy Scaling adaptively calibrates per-sample update magnitude via rollout reliability and Fisher-inspired local predictive sensitivity; on the data channel, Risk-Aware Dynamic Bucket Sampling reorganizes training batches through dynamic risk stratification, steering optimization toward informative yet stable samples. As a plug-and-play strategy requiring no cross-task memory, RAPO generalizes to any RFT algorithm without modification. On the public MLLM-CL benchmark, RAPO reduces final forgetting by 79.8% relative to its RLOO backbone while retaining new-task competitiveness.

View source

Similar papers

#artificial intelligence Preprint Oct 2026

Follow the Winners: Conservative Policy Improvement with the Cross-Entropy Method for Critic-Free RFT

Critic-free reinforcement fine-tuning (RFT) for agentic large language models is often done through GRPO-style methods, which compute a group baseline over repeated rollouts to reduce target variance. However, this setup is ill-suited to agents acting in stateful environments such as live services or security sandboxes...

Joery A. de Vries, Neil D. Lawrence, Zhen-Wen Dai · 0 citations
Conference Aug 2026

Post-Training for Reasoning LLMs with Reinforcement Learning: A Stability–Efficiency Perspective

Reinforcement Learning (RL)-based post-training has become a key mechanism for improving reasoning Large Language Models (LLMs), especially when automated verifiers enable Reinforcement Learning with Verifiable Reward (RLVR). Recent methods, however, are increasingly modular: many apparent algorithmic advances recombin...

Liu Yang, Han Zhu, Zheng-Yang Zhong et al. · 2 citations
#artificial intelligence Preprint Oct 2026

Variance-Averse $n$-Step Offline Reinforcement Learning for Sparse Long-Horizon Environments

Generative actors are transforming offline reinforcement learning (RL) by enabling expressive policy classes that model complex action distributions. However, this expressiveness also exposes a key challenge in heterogeneous datasets: generative policies can reproduce unreliable action modes whose return distributions...

Gu-Heon Kang, Minhae Kwon · 0 citations
#natural language process... Preprint Aug 2026

Uncovering and Mitigating Aggregation-Induced Reward Hacking in Multi-Reward Reinforcement Learning

Adaptive Multi-Reward Projection is proposed, a lightweight online method that reallocates aggregation weights using three signals, relative shortfall, reward volatility, and recent progress, increasing pressure on lagging, unstable, or stagnant dimensions while relieving saturated ones.

Yu Yuan, Yao Fan, Lili Zhao et al. · 3 citations
Preprint Aug 2026

Fairness-Aware Test-Time Prompt Tuning

FairTPT is developed, a novel fairness-aware episodic TTA method that jointly minimizes target marginal entropy while maximizing spurious marginal entropy through soft-prompt tuning and establishes a foundation for robust TTA, which is essential for achieving fairness in practice.

Yoann L. Launay, P. Kamalaruban, Tom Kempton et al. · 0 citations
#natural language process... Preprint Sep 2026

Informed Masking: Structure-Aware Perturbation for Reinforcement Learning in Diffusion Large Language Models

This work identifies a systematic upstream/downstream structure in dLLM rollouts and proposes Informed Masking (IM), which derives a per-token priority score from the denoising trajectory at zero extra inference cost and biases mask sampling toward downstream tokens.

Xiao-Yi Yu, E. Sangineto, Pei Fu et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.