用高效方法发现大模型知识漏洞,比现有技术多找40倍错误。
Discovering Knowledge Deficiencies of Language Models on Massive Knowledge Base
- 通过相似失败案例迭代搜索高错候选,实现低成本探测。
- 在有限查询下发现40.7倍于基线的错误,成本降低599倍。
- 适合研究模型缺陷、改进训练数据和提升可信度的开发者。
大语言模型虽具强大语言能力,却常无法忠实保留事实知识,导致幻觉与不可靠输出。全面评估其对大规模知识库的知识缺陷在计算上不可行,尤其对闭源模型而言。本文提出随机误差上升(SEA)框架,可在严格查询预算下高效发现闭源大模型的知识错误。不同于盲目探测所有候选,SEA将错误发现建模为随机优化过程:通过利用先前观察到的失败案例的语义相似性,迭代检索新的高错误候选。为提升搜索效率与覆盖范围,SEA采用文档与段落层级的分层检索,并构建关系有向无环图以建模错误传播,识别系统性失效模式。实验表明,SEA发现的知识错误比自动化能力发现多40.7倍,比AutoBencher多26.7%,同时单位错误成本分别降低599倍和9倍。人工评估确认生成问题质量高,消融与收敛分析验证了各组件的有效性。进一步分析揭示不同大模型家族间存在相关错误模式与重复缺陷,凸显未来需加强数据覆盖与针对性微调。
原文摘要 · Abstract (English)
Large language models (LLMs) possess impressive linguistic capabilities but often fail to faithfully retain factual knowledge, leading to hallucinations and unreliable outputs. Understanding LLMs' knowledge deficiencies by exhaustively evaluating against full-scale knowledge bases is computationally prohibitive, especially for closed-weight models. We propose stochastic error ascent (SEA), a scalable and efficient framework for discovering knowledge deficiencies (errors) in closed-weight LLMs under a strict query budget. Rather than naively probing all knowledge candidates, SEA formulates error discovery as a stochastic optimization process: it iteratively retrieves new high-error candidates by leveraging the semantic similarity to previously observed failures. To further enhance search efficiency and coverage, SEA employs hierarchical retrieval across document and paragraph levels, and constructs a relation directed acyclic graph to model error propagation and identify systematic failure modes. Empirically, SEA uncovers 40.7x more knowledge errors than Automated Capability Discovery and 26.7% more than AutoBencher, while reducing the cost-per-error by 599x and 9x, respectively. Human evaluation confirms the high quality of generated questions, while ablation and convergence analyses validate the contribution of each component in SEA. Further analysis on the discovered errors reveals correlated failure patterns across LLM families and recurring deficits, highlighting the need for better data coverage and targeted fine-tuning in future LLM development.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。