Reinforcement Learning from Verifiable Rewards (RLVR) has substantially enhanced the reasoning capabilities of large language models in abstract reasoning tasks. However, its application to Large Vision-Language Models (LVLMs) remains constrained by a structural representational bottleneck. Existing approaches generally lack explicit modeling and effective utilization of visual information, preventing visual representations from being tightly coupled with the reinforcement learning optimization process and thereby limiting further improvements in multimodal reasoning performance. To address this limitation, we propose KAWHI (Key-Region Aligned Weighted Harmonic Incentive), a plug-and-play reward reweighting mechanism that explicitly incorporates structured visual information into uniform reward policy optimization methods (e.g., GRPO and GSPO). The method adaptively localizes semantically salient regions through hierarchical geometric aggregation, identifies vision-critical attention heads via structured attribution, and performs paragraph-level credit reallocation to align spatial visual evidence with semantically decisive reasoning steps. Extensive empirical evaluations on diverse reasoning benchmarks substantiate KAWHI as a general-purpose enhancement module, consistently improving the performance of various uniform reward optimization methods. Project page: KAWHI (https://kawhiiiileo.github.io/KAWHI_PAGE/)
Figures & tables
Figure 1: (a) Error distribution across five categories: VP (visual perception error), AO (answer only), CE (calculation error), RAE (rule application error), and Others. (b) Two VP cases from MathVerse. Red highlights indicate visual misinterpretation.
Figure 2: Overview of the KAWHI mechanism. Critical regions are selected using the SGUF algorithm (see section 3.2 for details). The decoded sequence denotes the textual output generated from response tokens, segmented by the paragraph delimiter \n\n .
Figure 3: Vision-Critical head identification via global ablation on the MME benchmark. Here, b denotes the performance score of the baseline models (Qwen2.5-VL-7B-Instruct [ 5 ] and Qwen3-VL-4B-Instruct [ 4 ] ).
Method
MathVista
MathVerse
MathVision
WeMath
Avg
Qwen2.5-VL-7B-Instruct
Base
67.47
45.56
23.36
54.32
47.68
fine-grained reward
Step-GRPO
66.87 − 0.60
44.32 − 1.24
24.76 + 1.40
55.32 + 1.00
47.82 + 0.14
FT-RL
67.68 + 0.21
46.88 + 1.32
26.12 + 2.76
56.78 + 2.46
49.37 + 1.69
VPPO
68.42 + 0.95
47.21 + 1.65
28.42 + 5.06
57.12 + 2.80
50.29 + 2.61
Table 1: Main results on Qwen2.5-VL-7B-Instruct and Qwen3-VL-4B-Instruct . +Δ / −Δ denote changes vs. baselines; (+X.XX) shows gains over base RL methods. Bold = best per model size; gray rows = ours.
Method
CharXiv Desc
CharXiv Rea
Chart QA
Chart QAPro
Chart Mimic
Qwen2.5-VL-7B-Instruct
67.9
42.1
87.4
41.9
40.2
+ GRPO
70.1 + 2.2
44.3 + 2.2
88.3 + 0.9
43.7 + 1.8
42.8 + 2.6
+ GRPO + KAWHI (Ours)
72.2 + 4.3
46.4 + 4.3
89.1 + 1.7
45.3 + 3.4
45.1 + 4.9
Table 2: Main results on chart understanding benchmarks . +Δ / −Δ denote changes vs. baselines; Bold = best per benchmark; gray rows = ours.
Ablation
Experiment
MathVerse (%) ↑
MathVision (%) ↑
Average
–
GRPO
45.94 ↓1.62
28.29 ↓0.99
37.11
–
GRPO+ KAWHI (Ours)
47.56
29.28
38.42
① Region Selection
All vision tokens
46.58 ↓0.98
28.45 ↓0.83
37.52
Random
46.34 ↓1.22
28.98 ↓0.30
37.66
Inverse selection
45.74 ↓1.82
27.82 ↓1.46
36.78
② Reward Metric
Key–Key
47.08 ↓0.48
28.95 ↓0.33
38.02
Table 3: Ablation on Qwen2.5-VL-7B-Instruct. Results on MathVerse and MathVision. ↓ X.XX indicates drop vs. GRPO+ KAWHI .
Figure 4: Validation of VisionZip as an effective alternative to SGUF under 50% visual tokens.
Figure 5: Computational Efficiency Analysis of KAWHI . Component-wise isolation analysis using GRPO to assess the additional computational complexity introduced by our method.
Figure 6: Qualitative Analysis of Weight Allocation in KAWHI . Results are illustrated using cases from Geo3K [ 33 ] . Color intensity represents weight magnitude, where darker colors indicate larger weights, illustrating the allocation behavior of KAWHI .
Appendix figures & tables1 asset
Supplementary material from the paper’s appendix.
Appendix
Figure 7: Sensitivity Analysis of the SGUF Hyperparameter skip_ratio (Qwen2.5-VL-7B-Instruct with GRPO+ KAWHI on MathVerse and MathVision)
Vision-Language Models (VLMs) frequently suffer from visual perception errors and hallucinations that compromise answer accuracy in complex reasoning tasks. Reinforcement Learning with Verifiable Rewards (RLVR) offers a promising solution by optimizing policies using answer correctness signals. Despite their effectiveness, prevailing RLVR methods face two critical limitations. First, much of the sampling budget is wasted on trajectories doomed to fail due to early visual description errors. Second, sparse rewards cannot distinguish whether failures stem from visual perception or reasoning stages. We introduce MIRL, a decoupled framework that addresses both limitations by leveraging mutual information (MI) between generated descriptions and visual inputs as a cheap pre-screening signal. This enables intelligent budget allocation toward high-potential trajectories via forking, while decoupled training provides independent MI-based rewards for visual perception optimization, resolving reward blindness. Experiments on six vision-language reasoning benchmarks demonstrate that MIRL achieves 70.22% average accuracy and successfully surpasses the performance of sampling 16 complete trajectories using only 10 pre-samples with top-6 selection (25% fewer complete trajectories). Our code is available at: https://anonymous.4open.science/r/mirl-main/.
Yin Zhang, Jiaxuan Zhao, Zonghan Wu +5
School of Mathematics, Tianjin University, Tianjin, China · Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China · Shanghai Advanced Institute of Finance (SAIFS), East China Normal University, Shanghai, China +4
Reinforcement learning with verifiable rewards (RLVR) has significantly improved the reasoning capabilities of large vision-language models (LVLMs). However, standard on-policy RLVR algorithms face a critical optimization bottleneck in preserving and reinforcing visually grounded reasoning behaviors: valuable visually-grounded reasoning trajectories are discarded after a single update, while uniform token advantage allocation prevents the model from reinforcing critical perception or reasoning steps. To bridge this gap, we propose PIVOT, a dual-level learning framework that anchors policy optimization around informative visual reasoning signals. Specifically, PIVOT introduces a self-calibrated experience replay mechanism, which selectively collects and replays visually-grounded historical experiences as stable reference anchors for policy optimization. Building upon this, we further design a vision-guided advantage allocation mechanism to allocate additional vision-aware advantages to tokens based on their local visual support and impact on downstream reasoning. Extensive experiments across diverse benchmarks demonstrate that PIVOT achieves highly competitive performance in enhancing the multimodal reasoning capabilities of LVLMs.
Xinxin Song, Siyuan Li, Tingxiong Xiao +1
Department of Automation, Tsinghua University · Institute for Brain and Cognitive Science, Tsinghua University
While Reinforcement Learning from Verifiable Rewards (RLVR) has advanced reasoning in Large Vision-Language Models (LVLMs), prevailing frameworks suffer from a foundational methodological flaw: by distributing identical advantages across all generated tokens, these methods inherently dilute the learning signals essential for optimizing the critical, visually-grounded steps of multimodal reasoning. To bridge this gap, we formulate Token Visual Dependency, quantifying the causal information gain of visual inputs via the Kullback-Leibler (KL) divergence between visual-conditioned and text-only predictive distributions. Revealing that this dependency is highly sparse and semantically pivotal, we introduce Perception-Grounded Policy Optimization (PGPO), which is a novel fine-grained credit assignment framework that dynamically reshapes advantages at the token level. Through a threshold-gated, mass-conserving mechanism, PGPO actively amplifies learning signals for visually-dependent tokens while suppressing gradient noise from linguistic priors. Extensive experiments based on the Qwen2.5-VL series across seven challenging multimodal reasoning benchmarks demonstrate that PGPO boosts models by 18.7% on average. Both theoretical and empirical analyses confirm that PGPO effectively reduces gradient variance, prevents training collapse, and acts as a potent regularizer for robust, perception-grounded multimodal reasoning. Code will be released on https://github.com/Yzk1114/PGPO.
Zekai Ye, Qiming Li, Xiaocheng Feng +6
Harbin Institute of Technology · Peng Cheng Laboratory · Huawei Technologies Co., Ltd