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%.

Similar Papers

Can GRPO Boost Complex Multimodal Table Understanding? (2025.emnlp-main)

Copied to clipboard

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.
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.
Table-R1: Inference-Time Scaling for Table Reasoning Tasks (2025.emnlp-main)

Copied to clipboard

Challenge: In this study, we explore inference-time scaling on table reasoning tasks.
Approach: They propose a large-scale dataset of reasoning traces and a reinforcement learning with verifiable rewards approach to enable inference-time scaling on table reasoning tasks.
Outcome: The proposed model matches or exceeds GPT-4.1 and DeepSeek-R1 models on diverse table reasoning tasks.
TART: An Open-Source Tool-Augmented Framework for Explainable Table-based Reasoning (2025.findings-naacl)

Copied to clipboard

Challenge: Current Large Language Models lack ability to understand table structures and apply precise numerical reasoning.
Approach: They propose a tool-augmented reasoning framework for table-based tasks that integrates LLMs with specialized tools.
Outcome: The proposed framework improves on the TOOLTAB dataset, a benchmark for LLMs in table–tool integration.
Memory-R1: Enhancing Large Language Model Agents to Manage and Utilize Memories via Reinforcement Learning (2026.acl-long)

Copied to clipboard

Challenge: Large Language Models (LLMs) are stateless and limited by a finite context window, preventing them from maintaining knowledge across long conversations or evolving tasks.
Approach: They propose a reinforcement learning framework that empowers LLMs to actively manage external memory through two specialized agents.
Outcome: The proposed framework outperforms baselines and benchmarks across diverse question types, three benchmarks, and multiple model scales.
Table Question Answering in the Era of Large Language Models: A Comprehensive Survey of Tasks, Methods, and Evaluation (2026.acl-long)

Copied to clipboard

Challenge: Table Question Answering (TQA) aims to answer natural language questions using tabular data.
Approach: They propose a systematic overview of TQA research using large language models and summarize available benchmarks based on task features.
Outcome: The proposed framework provides a comprehensive overview of the current state of the art in the field of Table Question Answering.
Region-R1: Reinforcing Query-Side Region Cropping for Multi-Modal Re-Ranking (2026.findings-acl)

Copied to clipboard

Challenge: Multi-modal retrieval-augmented generation relies heavily on re-rankers to surface the most relevant evidence for image-question queries.
Approach: They propose a query-side region cropping framework that makes region selection a decision-making problem during re-ranking.
Outcome: The proposed framework learns to retain the full image or focus only on a question-relevant region before scoring the retrieved candidates.
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 .
AAPO: Enhancing the Reasoning Capabilities of LLMs with Advantage Margin (2026.acl-long)

Copied to clipboard

Challenge: Reinforcement learning (RL) has emerged as an effective approach for enhancing the reasoning capabilities of large language models.
Approach: They propose an algorithm that optimizes cross-entropy loss using advantages enhanced through a margin-based estimation scheme.
Outcome: Experimental results show that AAPO improves group relative advantage estimation compared to other methods.
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.

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