Multi-chain Graph Refinement and Selection for Reliable Reasoning in Large Language Models
Yujiao Yang, Jing Lian, Linhui Li

TL;DR
This paper introduces MGRS, a novel framework that generates, refines, and selects the most reliable reasoning paths in large language models, significantly improving accuracy and efficiency across multiple tasks.
Contribution
MGRS is a new reasoning framework that enhances LLM reasoning by generating diverse trajectories, refining responses, and selecting the most reliable answer through graph-based success estimation.
Findings
Achieves an average accuracy of 82.9% across six datasets.
Attains 100% accuracy on the 24-point game.
Provides a 13.6x speed-up over existing methods.
Abstract
The complex reasoning ability of Large Language Models (LLMs) poses a critical bottleneck for their practical applications. Test-time expansion methods such as Tree-of-Thought (ToT) and Graph-of-Thought (GoT) enhance reasoning by introducing intermediate reasoning structures, tree search, or graph-based exploration mechanisms. However, their reasoning strategies suffer from limited diversity, redundant search branches, and inadequate integration and error correction across heterogeneous reasoning paths. To address these limitations, we propose a novel reasoning framework called Multi-chain Graph Refinement & Selection (MGRS), which first generates multiple diverse reasoning trajectories for a given problem, refines candidate responses using a composite self- and cross-verification strategy, then constructs a reasoning relation graph and estimates the success rate of intermediate nodes,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks · Topic Modeling · Multimodal Machine Learning Applications
