Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > stat > arXiv:2506.06382v1

Help | Advanced Search

Statistics > Machine Learning

arXiv:2506.06382v1 (stat)
[Submitted on 4 Jun 2025 (this version) , latest version 15 Oct 2025 (v7) ]

Title: On the Fundamental Impossibility of Hallucination Control in Large Language Models

Title: 大型语言模型中幻觉控制的根本不可能性

Authors:Michał P. Karpowicz
Abstract: This paper explains \textbf{why it is impossible to create large language models that do not hallucinate and what are the trade-offs we should be looking for}. It presents a formal \textbf{impossibility theorem} demonstrating that no inference mechanism can simultaneously satisfy four fundamental properties: \textbf{truthful (non-hallucinatory) generation, semantic information conservation, relevant knowledge revelation, and knowledge-constrained optimality}. By modeling LLM inference as an \textbf{auction of ideas} where neural components compete to contribute to responses, we prove the impossibility using the Green-Laffont theorem. That mathematical framework provides a rigorous foundation for understanding the nature of inference process, with implications for model architecture, training objectives, and evaluation methods.
Abstract: 本文解释了\textbf{为什么不可能创建不会产生幻觉的大语言模型,以及我们应该寻找什么样的权衡?}。 它提出了一个正式的\textbf{不可能性定理},证明没有任何推理机制能够同时满足四个基本属性: \textbf{真实的(非幻觉性)生成,语义信息保留,相关知识揭示,以及知识约束下的最优性}。 通过将LLM推理建模为一个\textbf{创意拍卖},其中神经组件竞争以对响应做出贡献,我们利用Green-Laffont定理证明了这种不可能性。 这个数学框架为理解推理过程的本质提供了严格的理论基础,并对模型架构、训练目标和评估方法具有影响。
Subjects: Machine Learning (stat.ML) ; Artificial Intelligence (cs.AI); Computation and Language (cs.CL); Computer Science and Game Theory (cs.GT); Machine Learning (cs.LG)
Cite as: arXiv:2506.06382 [stat.ML]
  (or arXiv:2506.06382v1 [stat.ML] for this version)
  https://doi.org/10.48550/arXiv.2506.06382
arXiv-issued DOI via DataCite

Submission history

From: Michal Karpowicz Dr [view email]
[v1] Wed, 4 Jun 2025 23:28:39 UTC (25 KB)
[v2] Wed, 2 Jul 2025 12:24:10 UTC (33 KB)
[v3] Tue, 8 Jul 2025 11:43:16 UTC (36 KB)
[v4] Wed, 6 Aug 2025 11:34:54 UTC (48 KB)
[v5] Thu, 21 Aug 2025 08:58:34 UTC (53 KB)
[v6] Sun, 14 Sep 2025 15:56:29 UTC (58 KB)
[v7] Wed, 15 Oct 2025 22:25:41 UTC (63 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
license icon view license
Current browse context:
stat.ML
< prev   |   next >
new | recent | 2025-06
Change to browse by:
cs
cs.AI
cs.CL
cs.GT
cs.LG
stat

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

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.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号