arXiv (All)
open access
Kernel Token Contradiction: a Fast and Principled Approach for LLM Claim Uncertainty Quantification
Claim-level Uncertainty Quantification (UQ) aims to mitigate the lack of reliability of Large Language Models (LLMs) by evaluating the factuality of each claim in their outputs. We introduce Kernel Token Contradiction (KTC), a lightweight approach to compute claim-level UQ under realistic white-box
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Escaping Redundant Reasoning: Structure-Aware Search for Inference-Time LLMs#820751
- Bridging the Data Gap: LLM-Driven Synthetic Data Generation for Low-Resource Natural Language Inference#1120844
- Relevance without existence#87849
- Explanation Generation for Contradiction Reconciliation with LLMs#1357132
- zip2zip++: Towards Inference-Time Token Compression with Minimal Quality Loss#1297957
Record · ID 1468313
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive