arXiv:2606.08571cs.CLcs.AI2026-06中稿 · ICML

让大模型学会承认未知,用结构化证书精准指出知识盲区。

Calibration of Structured Ignorance Certificates for Diagnosing Unknown Unknowns in Reasoning Models

论文配图:Calibration of Structured Ignorance Certificates for Diagnosing Unknown Unknowns in Reasoning Models
图 1 · 摘自论文原文
  • 设计可输出的结构化证书格式,强制模型指明缺失领域和所需概念。
  • 在7347个跨域难题上微调后,证书格式正确率达99.46%,特异性得分0.967。
  • 适合关注模型可信度、误判诊断与可解释推理的研究者。

大型语言模型常在超出知识边界时编造流畅但错误的答案。本文提出结构化无知证书(SICs),一种要求模型明确指出缺失领域交集、列出所需概念并生成有效检索查询的JSON格式输出。为训练高质量SICs,我们基于Qwen3-14B构建了包含7,347个样本的未知-未知(UU)数据集,通过拼接物理、生物、工程、计算机、经济、医学、法律七个领域的题目生成跨域新问题。采用组相对策略优化(GRPO)对140亿参数模型进行微调,奖励机制融合检索效用、概念特异性和输出格式有效性。在735个保留的UU问题上评估显示,证书格式正确率达99.46%,平均证书特异性得分为0.967,相比基础模型在检索增强生成任务中提升3.6% ROUGE-L,证明显式认知结构是可学习且可量化的。

原文摘要 · Abstract (English)

Large language models frequently fail in a characteristic way: rather than acknowledging ignorance, they produce fluent but incorrect answers to questions that lie beyond their knowledge boundaries. We introduce \textbf{Structured Ignorance Certificates} (SICs), a JSON-formatted output schema that demands a model explicitly name the missing domain intersection, enumerate required concepts, and propose a productive retrieval query rather than hallucinating an answer. To train models to produce high-quality SICs we construct a 7,347-sample \emph{Unknown-Unknown} (UU) dataset by prompting Qwen3-14B to stitch together questions from seven domains (physics, biology, engineering, CS, economics, medical, legal) into novel cross-domain queries that no single-domain expert could answer. We fine-tune a 14B-parameter model with Group Relative Policy Optimization (GRPO) using a composite reward that combines retrieval utility, concept specificity, and output-format validity. A paraphrase-divergence probe trained on model responses confirms that SIC-tuned outputs systematically exhibit higher unknown-unknown probability scores. Evaluation on 735 held-out UU questions achieves a 99.46\% JSON validity rate, a mean Certificate Specificity Score of 0.967, and a 3.6\% ROUGE-L improvement over the base model on retrieval-grounded generation -- demonstrating that explicit epistemic structuring is a learnable and measurable capability.

模型可信度未知未知可解释性推理机制

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。