Reference-Free Evaluation of Reasoning in Open-Ended Question Answering

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

Summary

The article introduces a reference-free framework for auditing Large Language Model (LLM)-generated reasoning in open-ended question answering. This method decomposes an LLM's reasoning trace into segments, labels local premise–target relations using Natural Language Inference (NLI), and organizes these into a hypergraph. A deterministic backward AND–OR search algorithm then assigns segment-level audit labels (Supported, Unsupported, Orphan) to indicate grounding. Evaluated on deductive mathematical reasoning (Hard2Verify) and a new physician-annotated medical reasoning benchmark, UroReason (40 clinical cases, 305 segments), the framework provides a more reliable signal than direct LLM-as-judge baselines. Direct LLM judges often over-accept fluent but weakly grounded responses in clinical settings, with specificity dropping to 0.04–0.41 on UroReason, while the NLI-hypergraph method achieves balanced-F1 scores of 0.549–0.577.

Key takeaway

For AI Scientists and Machine Learning Engineers developing LLMs for high-stakes open-ended QA, you should move beyond final-answer evaluation and direct LLM-as-judge methods. Your evaluation pipelines should incorporate structural audits like the NLI-hypergraph framework to reliably identify ungrounded or problematic reasoning segments, particularly in domains like medicine where fluency can mask critical errors. This approach enhances trustworthiness and reduces the risk of over-accepting plausible but unsupported outputs.

Key insights

A hypergraph-based NLI audit provides more reliable, reference-free LLM reasoning evaluation than direct LLM judges, especially in high-stakes domains.

Principles

Method

Decompose reasoning into segments, label premise–target NLI relations, build a hypergraph, then use deterministic backward AND–OR search to assign grounding audit labels (Supported, Unsupported, Orphan).

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.CL updates on arXiv.org.