Skip to content

EcoReason: A Graph-Guided Evolutionary and Negative-Aware Reinforcement Learning Framework for LLM Commonsense Reasoning

2026 · IEEE Transactions on Audio, Speech, and Language Processing · Vol 34, pp. 4114-4127 · 0 citations · 48 references

Abstract

While large language models (LLMs) have achieved impressive gains in commonsense reasoning, they often fall into “associative shortcuts,” failing to distinguish correct answers from plausible but constraint-violating hard negatives. This reliance on semantic priors rather than specific situational constraints limits their fine-grained reasoning capabilities. To address this issue, we propose EcoReason (Evolved Commonsense Reasoning), a graph-guided evolutionary and negative-aware reinforcement learning (RL) framework. First, we introduce Graph-Guided Data Evolution, an iterative data generation strategy coupled with the student model’s training progress. In each round, we use knowledge graphs (KGs) to identify deceptive sibling concepts and employ a teacher LLM to create constraint-heavy question answering (QA) data targeting the student’s current blind spots. As training progresses, the synthesized curriculum becomes increasingly challenging. Second, we propose Negative-Aware Policy Optimization (NAPO), an RL algorithm built upon Group Relative Policy Optimization (GRPO). NAPO identifies “stubborn negatives,” defined as incorrect options that are repeatedly selected by sampled policies within the same rollout group, and applies stronger penalties to these recurring distractor-specific errors. Experiments show that EcoReason substantially improves LLM commonsense reasoning in complex constraint-heavy scenarios.

View source

Similar papers

#artificial intelligence Preprint Aug 2026

RACER: Reinforced Agent Collaboration for Explainable Reasoning on Knowledge Graphs

RACER employs a semantic-aware action pruning and teacher-guided reinforcement learning mechanism to efficiently extract high-quality reasoning pathways from large-scale KGs, and introduces a cross-task accumulated shared memory graph paired with an attention-driven multi-path knowledge refinement module.

Yuwei Lou, Hao Hu, Yu-Zhou Jiang et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Beyond Verified Answers: Solver-Informed Self-Distillation for Bootstrapping Operations Research Language Models

SOLID is proposed, a novel framework for self-improving OR language models without verified answers or external evaluators that improves solution accuracy for both general-purpose and OR-tuned models over outcome-only group-relative training.

Rui-Chen Zhu, Ming-Long Cao, Chen-Yu Zhou et al. · 0 citations
Preprint Sep 2026

Reasoning Quality Matters: Combating Reasoning Collapse in LLM-based Embedding Learning

Large Language Models (LLMs) have recently shown strong potential for producing context-rich text embeddings for retrieval. Most existing methods either treat embedding learning as passive feature extraction or exploit LLM reasoning through instruction following for better embedding optimization. However, specializatio...

Zi-Han Gong, Xiaohan Ye, Jiang-Chao Yao et al. · 0 citations
#artificial intelligence Preprint Sep 2026

GraMRAG: Orchestrating Multi-Agent Multi-Step Reasoning via Graph Memory with Reinforcement Learning

GraMRAG is proposed, a graph memory-guided multi-agent RAG framework that integrates a dynamic multimodal memory graph to enable stable, multi-step multimodal reasoning and introduces a vision-text bridged reasoning paradigm that unifies multi-scale entity cropping with a ReAct-style visual toolchain, enhancing the lon...

Zhong-Yu Wang · 0 citations

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