GraphReason: Enhancing Reasoning Capabilities of Large Language Models through A Graph-Based Verification Approach
Lang Cao

TL;DR
GraphReason introduces a graph-based verification method that models multiple reasoning solutions as graphs, significantly improving the reasoning accuracy of large language models without additional training.
Contribution
The paper presents a novel graph-based verification approach that enhances LLM reasoning by analyzing multiple solutions as reasoning graphs, outperforming existing verification methods.
Findings
Significant improvement in reasoning accuracy with GraphReason
Outperforms existing verifier methods in experiments
Effective analysis of multiple reasoning paths as graphs
Abstract
Large Language Models (LLMs) have showcased impressive reasoning capabilities, particularly when guided by specifically designed prompts in complex reasoning tasks such as math word problems. These models typically solve tasks using a chain-of-thought approach, which not only bolsters their reasoning abilities but also provides valuable insights into their problem-solving process. However, there is still significant room for enhancing the reasoning abilities of LLMs. Some studies suggest that the integration of an LLM output verifier can boost reasoning accuracy without necessitating additional model training. In this paper, we follow these studies and introduce a novel graph-based method to further augment the reasoning capabilities of LLMs. We posit that multiple solutions to a reasoning task, generated by an LLM, can be represented as a reasoning graph due to the logical connections…
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
Taxonomy
TopicsTopic Modeling · Natural Language Processing Techniques · Text Readability and Simplification
