Skip to content
Back to the collection

LLMs Will Always Hallucinate, and We Need to Live With This

Sourav Banerjee, Ayushi Agarwal, Saloni Singla

2024 · arXiv

Read the paper
HN score
0
Mentions
5
Readers
3
Months
3
What’s in a score?

From the abstract

As Large Language Models become more ubiquitous across domains, it becomes important to examine their inherent limitations critically. This work argues that hallucinations in language models are not just occasional errors but an inevitable feature of these systems. We demonstrate that hallucinations stem from the fundamental mathematical and logical structure of LLMs. It is, therefore, impossible to eliminate them through architectural improvements, dataset enhancements, or fact-checking mechanisms. Our analysis draws on computational theory and Godel's First Incompleteness Theorem, which references the undecidability of problems like the Halting, Emptiness, and Acceptance Problems. We demonstrate that every stage of the LLM process-from training data compilation to fact retrieval, intent classification, and text generation-will have a non-zero probability of producing hallucinations. This work introduces the concept of Structural Hallucination as an intrinsic nature of these systems. By establishing the mathematical certainty of hallucinations, we challenge the prevailing notion that they can be fully mitigated.

Metadata: arXiv. Abstracts retain their original authors’ rights.

In the conversation

Original HN comments, with labels from simple text rules. A label describes the whole comment and may miss context or irony. Read the discussion to make up your own mind. About the labels

5 selected excerpts · 5 total mentions

ezst
Neutral mention · rule
> Still struggling to find anything in your wall of words that actually backs up your claims. I mean, one easy thing you could do is to explain how LLMs are adequate as >> thinking machines, search engines, knowledge archives, … How much practical experience do you have with LLMs? Have you even tried running models locally? Then how have you not experienced yourself tweaking few parameters and gotten the same model to say one thing and its opposite just after? Through your extensive use of commercial LLMs, aren't you getting daily occurrences of confabulations? Making stuff up is what defines¹ LLMs, and that's not me saying it. If your field is so inconsequential that reliability and faithfulness of your output has no practical merit or repercussion, I'm glad that you get some entertainment out of this. Still doesn't make it the norm, though. ¹: https://arxiv.org/abs/2409.05746
Retr0id
Neutral mention · rule
Much like you can search the internet until you find a source that agrees with you, you can select a set of papers that "confirm" a particular viewpoint, especially in developing fields of research. In this case, the selected papers all support the view LLMs "know what they know" on some internal level, which iiuc is not (yet?) a consensus viewpoint (from my outsider perspective). But from the list alone, you might get that impression. Related: Still no lie detector for language models: probing empirical and conceptual roadblocks - https://link.springer.com/article/10.1007/s11098-023-02094-3 Hallucination is Inevitable: An Innate Limitation of Large Language Models - https://arxiv.org/abs/2401.11817 LLMs Will Always Hallucinate, and We Need to Live With This - https://arxiv.org/abs/2409.05746 (disclaimer, I also have not read any of these papers beyond the title!)
az09mugen
Neutral mention · rule
On what basis you think you will avoid hallucination(s) ? LLM will always hallucinate. People did already some research, among which : https://arxiv.org/abs/2409.05746 and https://arxiv.org/abs/2401.11817 for example.
az09mugen
Neutral mention · rule
I'm not overthinking it, some papers describe it [0] and [1] for example. I agree for some subjects you can deal with some error. The problem is not how often but how bad just one single error can be. My point was on controversial topic, where a single error can deal serious damage. Yes it must be error-free like for a nuclear reactor. Just imagine a Q&A chatbot answering questions on the subject of Israel and Palestine or something else really touchy, do you really think you can afford any error/hallucination ? [0] : https://arxiv.org/abs/2409.05746 [1] : https://arxiv.org/abs/2401.11817
az09mugen
Neutral mention · rule
Since the first day I consider AI as a noob working very fast and always making errors. My main usage is for tedious and non-critical tasks such as boilerplates. And I always review what has been generated like a merge/pull request, because in a sense that's what it is. What reinforces my opinion are papers like these : https://arxiv.org/abs/2409.05746 https://arxiv.org/abs/2401.11817

Keep following the thread.

More in Mathematics

More from the same topics.

1994arXiv

On proof and progress in mathematics

William P. Thurston

In response to Jaffe and Quinn [math.HO/9307227], the author discusses forms of progress in mathematics that are not captured by formal proofs of theorems, especially in his own work in the theory of foliations and geometrization of 3-manifolds and dynamical systems.

29 mentions21 months
9HN score