Language Models Fabricate Answers When Forced by Formats
Summary
Research shows that requiring specific answer formats, like JSON fields, can force language models to invent information even when they lack evidence. This "coerced fabrication" occurs across many models, with open-weight models often ignoring "insufficient evidence" options.
Why it matters
Professionals relying on LLMs for data extraction, automation, or structured output generation must be aware of this inherent tendency to hallucinate under format constraints, which can lead to critical errors and unreliable data.
How to implement this in your domain
- 1Design LLM prompts and schemas to include explicit "insufficient evidence" or "not applicable" options for all fields.
- 2Validate LLM outputs, especially for required fields, against source material to detect fabrication.
- 3Test models using the PhantomFill benchmark to assess their Coerced Fabrication Rate before deployment.
- 4Prioritize models that demonstrate better "Escape Utilization Rate" when selecting LLMs for structured data tasks.
Who benefits
Key takeaways
- LLMs often fabricate answers when forced to fill required structured fields, even if information is absent.
- This "coerced fabrication" is prevalent across many models, including open-weight ones.
- Explicit "insufficient evidence" options are often ignored by open-weight models.
- Careful schema design and output validation are crucial to mitigate this hallucination risk.
Original post by Rana Muhammad Usman
"arXiv:2607.20492v1 Announce Type: new Abstract: Language models in production do not write prose. They fill forms: JSON fields, function arguments, extraction templates. We show that the form itself causes hallucination. We ask thirteen models the same question about the same inp…"
View on XOriginally posted by Rana Muhammad Usman on X · view source
Want to go deeper?
Turn these trends into skills with Learnijoy's hands-on AI & tech courses.
Explore coursesMore in AI Engineering & DevTools
New Q-Learning Algorithm Boosts Robustness Against Data Corruption
Researchers introduce BR-Async-Q, an epoch-based robust Q-learning algorithm that uses data batching and robust Bellman operator estimates to defend against adversarial reward and state corruption, achieving strong error bounds.
New Algorithms Expand Tractability for Neural Network Training
This research presents novel algorithms that push the boundaries of polynomial-time tractability for optimally training neural networks with linear and ReLU activation functions, identifying new solvable architectures.
New Metrics for External Clustering Validation Unify Criteria
Researchers propose new normalized scores for cluster homogeneity and parsimony to evaluate clusterings against known classes, addressing the trade-off between informativeness and fragmentation. These scores unify common evaluation criteria and extend the information-theoretic framework.