# Are You Sure Your LLM Is Sure? > Source: > Published: 2026-10-17 13:39:04+00:00 # Computer Science > Artificial Intelligence [Submitted on 15 Oct 2026] # Title:Are You Sure Your LLM Is Sure? Repairing and Auditing Confidence [View PDF](https://arxiv.org/pdf/2610.22139) [HTML (experimental)](https://arxiv.org/html/2610.22139v1) Abstract:Confidence scores determine whether an LLM answer is accepted, reviewed, or regenerated, yet scalar recalibration can only correct errors visible through the score itself. We introduce RADAR (Repair, Adopt, and Diagnose After Recalibration), a reliability framework that separates confidence repair from deciding whether to deploy the repair and auditing the errors that remain. Under squared loss, we decompose prediction risk into outcome noise, information hidden by the score, and mapping error; restricting repair to order-preserving maps additionally introduces a pooling gap. For repair, we propose Probe-Anchored Isotonic Calibration (PAIC), which learns a monotone map from correctness-probe predictions on unlabeled target prompts. PAIC's excess risk depends on the probe's score-conditional bias and fitting error rather than its overall accuracy. For adoption, we derive a paired procedure with finite-sample control of false improvements. For auditing, we develop a prompt-clustered kernel test that detects feature-aligned residual errors while accounting for dependent answers from the same prompt. Across multiple LLM checkpoints, benchmarks, and distribution shifts, richer predictors can improve confidence estimation, but projecting their information back to a scalar score can lose these gains, and lower prediction risk need not yield better review decisions. Across 47,400 replayed raw-score allocations, paired betting adopts candidates with lower held-out test risk in 42.95% of allocations, versus 15.09% for one-sided empirical Bernstein. RADAR thus provides a principled workflow to repair what a scalar score can express, adopt a repair only when supported by evidence, and diagnose systematic errors that recalibration leaves behind. Code and data will be released upon acceptance. ## Submission history From: Ramya Hebbalaguppe [ [view email](https://arxiv.org/show-email/ac726b30/2610.22139)] **[v1]** Thu, 15 Oct 2026 16:12:29 UTC (198 KB) ### Additional Features ### References & Citations Loading... # Bibliographic and Citation Tools Bibliographic Explorer *(*[What is the Explorer?](https://info.arxiv.org/labs/showcase.html#arxiv-bibliographic-explorer)) Connected Papers *(*[What is Connected Papers?](https://www.connectedpapers.com/about)) Litmaps *(*[What is Litmaps?](https://www.litmaps.co/)) scite Smart Citations *(*[What are Smart Citations?](https://www.scite.ai/)) # Code, Data and Media Associated with this Article alphaXiv *(*[What is alphaXiv?](https://alphaxiv.org/)) CatalyzeX Code Finder for Papers *(*[What is CatalyzeX?](https://www.catalyzex.com)) DagsHub *(*[What is DagsHub?](https://dagshub.com/)) Gotit.pub *(*[What is GotitPub?](http://gotit.pub/faq)) Hugging Face *(*[What is Huggingface?](https://huggingface.co/huggingface)) ScienceCast *(*[What is ScienceCast?](https://sciencecast.org/welcome)) # Demos # Recommenders and Search Tools Influence Flower *(*[What are Influence Flowers?](https://influencemap.cmlab.dev/)) CORE Recommender *(*[What is CORE?](https://core.ac.uk/services/recommender)) # arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? [**Learn more about arXivLabs**](https://info.arxiv.org/labs/index.html).