Can We Trust LLM's Logic? Quantifying Uncertainty, Coherence, and Robustness via a Graph-Based Framework

· Source: cs.AI updates on arXiv.org · Field: Technology & Digital — Artificial Intelligence & Machine Learning, Data Science & Analytics · Depth: Expert, extended

Summary

GraphEVAL, a novel graph-based reasoning framework, quantifies uncertainty, coherence, and robustness in Large Language Model (LLM) reasoning, addressing the limitations of traditional decoding strategies like Self-Consistency (SC). It introduces the Graph Reasoning Coherence Score (GRCS), a distributional uncertainty metric based on Structural-Semantic Graph Edit Distance (SS-GED), which consistently shows a negative correlation with reasoning faithfulness across models like LLaMA 3.1 8B, Phi-4, and DeepSeek R1. GraphEVAL also proposes Graph Self-Consistency (GSC), a medoid-based decoding strategy that improves reasoning fidelity, exposing "lucky guesses" in smaller models while preserving or enhancing accuracy in more capable ones. The framework's SS-GED computation has a time complexity of O(m^3), a significant improvement over O(m^m) for exact GED. Experiments across diverse tasks, including StrategyQA, MedQA, and GPQA, demonstrate that the GSC-selected path acts as a "load-bearing path," where adversarial ablation degrades reasoning faithfulness and, in targeted cases, accuracy.

Key takeaway

For Machine Learning Engineers deploying LLMs in mission-critical environments, relying solely on final answer agreement for trustworthiness is insufficient and risky. You should integrate reasoning-level analysis using frameworks like GraphEVAL to quantify uncertainty and ensure logical fidelity. This approach helps identify "lucky guesses" and unfaithful reasoning, providing a more robust evaluation than traditional Self-Consistency, especially for smaller models where mode collapse and hallucinations are prevalent.

Key insights

LLM trustworthiness hinges on evaluating reasoning fidelity, not just final answer agreement, a gap GraphEVAL addresses.

Principles

Method

GraphEVAL models sampled Chain-of-Thoughts as DAGs, decomposes steps into atomic facts, and quantifies semantic-structural consensus using Graph Reasoning Coherence Score (GRCS) based on Structural-Semantic Graph Edit Distance (SS-GED) to select the most coherent path.

In practice

Topics

Best for: Research Scientist, AI Engineer, AI Scientist, Machine Learning Engineer, NLP Engineer

Related on AIssential

Open in AIssential →

Editorial summary, takeaway, and curation by AIssential. Original article published by cs.AI updates on arXiv.org.