Challenge: Existing table understanding methods struggle with low initialization accuracy and coarse rewards in tabular contexts.
Approach: They propose a three-stage RL framework that enhances multimodal table understanding through: (1) Warm-up that prompts initial perception and reasoning capabilities; (2) Perception Alignment GRPO (PA-GRPO); (3) Hint-Completion GR PO (HC-GRP);
Outcome: The proposed framework outperforms existing models on held-in and held-out datasets, outperforming SFT and GRPO largely.

Similar Papers

Table-R1: Region-based Reinforcement Learning for Table Understanding (2026.findings-acl)

Copied to clipboard

Challenge: Tables are a widely used data format that poses unique challenges for language models due to their structured row-column interactions.
Approach: They propose a region-based reinforcement learning approach that integrates region evidence into reasoning steps.
Outcome: The proposed method outperforms baseline models on three benchmark datasets and significantly reduces the reasoning token consumption by 67.5%.
GRPO-CARE: Consistency-Aware Reinforcement Learning for Multimodal Reasoning (2026.findings-acl)

Copied to clipboard

Challenge: Recent reinforcement learning approaches have advanced reasoning in Large Language Models (LLMs), yet their adaptation to multimodal LLMs remains underexplored.
Approach: They propose a reinforcement learning framework that eliminates KL penalties and rewards consistency . they propose GRPO-CARE, which outperforms standard GR PO, with a base reward for accuracy and an adaptive bonus for consistency.
Outcome: The proposed framework outperforms standard GRPO on the most difficult evaluation level and reasoning consistency test benchmarks.
DRA-GRPO: Your GRPO Needs to Know Diverse Reasoning Paths for Mathematical Reasoning (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods for group-relative policy optimization rely on scalar correctness rewards that are often non-injective with respect to semantic content.
Approach: They propose a framework that calibrates the reward signal using the semantic density of sampled groups.
Outcome: The proposed framework outperforms strong baselines on five math benchmarks with 7,000 samples and 55 cost.
GRPO-LEAD: A Difficulty-Aware Reinforcement Learning Approach for Concise Mathematical Reasoning in Language Models (2025.emnlp-main)

Copied to clipboard

Challenge: Existing methods for group-relative policy optimization face challenges in reward sparsity, verbosity and inadequate focus on problem difficulty.
Approach: They propose a method to improve group relative policy optimization with length-regularized rewards and explicit penalties for incorrect solutions.
Outcome: The proposed method achieves state-of-the-art performance for 14B-scale models . it improves reasoning accuracy, conciseness, and efficiency .
Graph-GRPO: Stabilizing Multi-Agent Topology Learning via Group Relative Policy Optimization (2026.findings-acl)

Copied to clipboard

Challenge: Recent approaches to optimize communication topology rely on single-sample policy gradients with absolute rewards.
Approach: They propose a topology optimization framework that integrates Group Relative Policy Optimization.
Outcome: The proposed topology optimization framework outperforms state-of-the-art methods on reasoning and code generation benchmarks.
Outcome-Grounded Advantage Reshaping for Fine-Grained Credit Assignment in Mathematical Reasoning (2026.acl-long)

Copied to clipboard

Challenge: Group Relative Policy Optimization (GRPO) uses a coarse-grained credit assignment mechanism that propagates group-level rewards uniformly to to every token in a sequence, neglecting the varying contribution of individual reasoning steps.
Approach: They introduce Outcome-grounded Advantage Reshaping (OAR) which redistributes advantages based on how much each token influences the model’s final answer.
Outcome: Empirical results show that OAR-G outperforms GRPO on a high-fidelity attribution signal and suppresses low-impact tokens while preserving the advantage mass.
G2RPO-A: Guided Group Relative Policy Optimization with Adaptive Guidance (2026.acl-long)

Copied to clipboard

Challenge: Recent advances in reasoning-centric large language models (LLMs) have significantly expanded the performance boundaries of LLMs, showcasing the immense potential of reasoning-enhanced models.
Approach: They propose an adaptive algorithm that injects ground-truth reasoning steps into roll-out trajectories to compensate for SLMs’ inherent weaknesses.
Outcome: Experiments on mathematical reasoning and code-generation benchmarks confirm that G2RPO-A substantially outperforms vanilla GRPO.
CSPO: Alleviating Reward Ambiguity for Structured Table-to-LaTeX Generation (2026.acl-long)

Copied to clipboard

Challenge: Tables contain rich structured information, but when stored as images their contents remain "locked" within pixels.
Approach: They propose a framework that disentangles optimization across LaTeX tables components . CSPO assigns component-specific rewards and backpropagates each signal through tokens .
Outcome: The proposed framework disentangles optimization across LaTeX tables components—structure, style, and content.
GR1: Reinforcement-Enhanced LLM for Geoscience Reasoning (2026.findings-acl)

Copied to clipboard

Challenge: Recent advances in large language models have demonstrated RL's substantial capacity to enhance multi-step reasoning beyond what supervised instruction tuning achieves.
Approach: They propose a framework that converts multimodal questions into descriptive text . they propose RL-enhanced geoscience reasoning that can be fine-tuned to a text-only level .
Outcome: The proposed framework improves accuracy and accuracy on multimodal questions while preserving answerability and difficulty.
Don’t Tell the Answer, Truly Guide the Reasoning During RL Rollouts (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods such as GRPO often break down when task difficulty exceeds the model’s capacity, resulting in sparse rewards and inefficient training.
Approach: They propose to measure the compatibility between external guidance and a model's intrinsic policy by introducing an adaptive framework to enhance reasoning performance while explicitly preserving high Affinity.
Outcome: The proposed framework outperforms baseline models while maintaining high Affinity.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations