Challenge: Reinforcement Learning with Verifiable Rewards (RLVR) has proven effective in enhancing LLMs’ short-context reasoning but falters in long-contemporal scenarios requiring precise grounding and multi-hop reasoning.
Approach: They propose a framework that constructs high-difficulty, multi-hop long-context QA pairs with inherent reasoning chains to overcome this bottleneck.
Outcome: The proposed framework outperforms RLVR baselines and matches frontier LLMs while using far fewer parameters.

Similar Papers

LongReward: Improving Long-context Large Language Models with AI Feedback (2025.acl-long)

Copied to clipboard

Challenge: In recent years, significant advancements have been achieved in the development of long-context large language models (LLMs).
Approach: They propose a method that utilizes an off-the-shelf LLM to provide rewards for long-context model responses from four human-valued dimensions: helpfulness, logicality, faithfulness, and completeness.
Outcome: The proposed method improves models’ long-context performance and enhances their ability to follow short instructions.
Step Potential Advantage Estimation: Harnessing Intermediate Confidence and Correctness for Efficient Mathematical Reasoning (2026.findings-acl)

Copied to clipboard

Challenge: Existing approaches to RLVR provide sparse supervision since reward arrives only after the full generation is complete.
Approach: They propose a step-level reward system that extracts confidence and correctness and combines them into a Step Potential signal that explicitly estimates reasoning state at each step.
Outcome: The proposed method outperforms existing methods on multiple benchmarks and improves accuracy while reducing response length.
LongFaith: Enhancing Long-Context Reasoning in LLMs with Faithful Synthetic Data (2025.findings-acl)

Copied to clipboard

Challenge: Long-context processing ability has emerged as a significant challenge for large language models.
Approach: They propose a pipeline for synthesizing faithful long-context reasoning instruction datasets . they integrate ground truth and citation-based reasoning prompts integrating them .
Outcome: The proposed pipeline eliminates distractions and improves reasoning chains.
Chain-of-Thought Matters: Improving Long-Context Language Models with Reasoning Path Supervision (2025.findings-emnlp)

Copied to clipboard

Challenge: Recent advances in Large Language Models (LLMs) have highlighted the challenge of handling long-context tasks.
Approach: They propose a chain-of-thought framework that teaches models to generate high-quality reasoning paths for enhanced long-context performance.
Outcome: The proposed framework generalizes across most long-context scenarios and amplifys with increasing context length.
Dynamic Long Context Reasoning over Compressed Memory via End-to-End Reinforcement Learning (2026.acl-long)

Copied to clipboard

Challenge: Large Language Models face quadratic computational costs, information forgetting, and context fragmentation . current methodologies diverge into three paradigms, each facing inherent trade-offs between Equal contribution.
Approach: They propose a framework that enables efficient long-context inference via chunk-wise compression and selective memory recall.
Outcome: The proposed framework reduces peak GPU memory usage and speeds up inference on multi-hop reasoning benchmarks.
Stabilizing Efficient Reasoning with Step-Level Advantage Selection (2026.findings-acl)

Copied to clipboard

Challenge: Large language models generate long and verbose reasoning traces at inference time . short context post-training alone induces substantial reasoning compression .
Approach: They propose a step-level advantage selection approach that reduces reasoning length by over 30% . they propose to use GRPO without any length-aware objective to train models in a shorter context window .
Outcome: The proposed approach reduces average reasoning length by over 30% while improving Pass@1 accuracy by 3.79 points over the strongest length-aware baseline.
Beyond High-Entropy Exploration: Correctness-Aware Low-Entropy Segment-Based Advantage Shaping for Reasoning LLMs (2026.findings-acl)

Copied to clipboard

Challenge: Recent work studies RLVR through token entropy, arguing that high-entropies drive exploration and should receive stronger updates.
Approach: They propose a correctness-aware reinforcement framework that performs fine-grained advantage modulation over low-entropy segments.
Outcome: The proposed framework improves accuracy over strong RL baselines across three backbones and six math benchmarks while maintaining high-entropy exploration.
From General Reward to Targeted Reward: Improving Open-ended Long-context Generation Models (2025.emnlp-main)

Copied to clipboard

Challenge: Current research on long-form context in Large Language Models (LLMs) focuses on understanding of long-contexts, but the open-ended Long Text Generation (Open-LTG) remains underexplored.
Approach: They propose a method that uses data synthesis and a reward signal to enhance model performance.
Outcome: The proposed method outperforms GPT-4-Turbo and improves performance by 20% on the Open-LTG task.
Unlocking Exploration in RLVR: Uncertainty-aware Advantage Shaping for Deeper Reasoning (2026.findings-acl)

Copied to clipboard

Challenge: Reinforcement Learning with Verifiable Rewards (RLVR) has shown significant promise for enhancing the reasoning capabilities of large language models (LLMs).
Approach: They propose a model-free method that refines credit assignment by leveraging the model's internal uncertainty signals.
Outcome: Extensive experiments on five mathematical reasoning benchmarks show that the proposed method outperforms strong RLVR baselines on multiple model scales, including 1.5B and 7B.
Beyond Length Scaling: Synergizing Breadth and Depth for Generative Reward Models (2026.findings-acl)

Copied to clipboard

Challenge: Recent advances in Generative Reward Models have demonstrated that scaling the length of Chain-of-Thought reasoning enhances reliability of evaluation.
Approach: They propose a framework that reconfigures raw rationales into structured Breadth-CoT and Depth-Co T through a modular synthesis pipeline.
Outcome: The proposed framework surpasses open-source RMs by an average of 8.2%.

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