Inference-Time Conformal Reasoning with Valid Factuality Control for Large Language Models (opens in new tab) 📄AI Papers Content type: Academic
Large language models (LLMs) increasingly perform multi-step reasoning, where intermediate claims form implicit directed acyclic graphs whose node correctness is structurally conditioned on their ancestors. This makes factuality uncertainty structural, rather than a trivial accumulation of node-wise errors, and necessitates inference-time uncertainty quantification over the reasoning structure. While conformal prediction (CP) offers flexible use...
Read the original article