mlsanityData to 7 Oct 2026

Truth as a Compression Artifact in Language Model Training

arXiv 2603.11749 ↗First posted 12 Mar 2026cs.CL cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Why do language models trained on contradictory data prefer correct answers? In controlled experiments with small transformers (3.5M--86M parameters), we show that this preference tracks the compressibility structure of errors rather than truth per se. We train GPT-2 style models on corpora where each mathematical problem appears with both correct and incorrect solutions -- a denoising design that directly models conflicting information about the same fact. When errors are random, models extract the correct signal with accuracy scaling from 65% to 85% with model size. When errors follow a coherent alternative rule system, accuracy drops to chance (~45--51%): the model cannot distinguish the false system from truth. A multi-rule experiment reveals a sharp crossover: a single coherent alternative rule eliminates truth bias entirely, but adding a second competing rule restores most of it (47%->78%), with continued growth through N=10 (88%). The same pattern reproduces on real Wikipedia text (71% vs 46%). We propose the Compression--Consistency Principle as an explanatory hypothesis: in these settings, gradient descent favors the most compressible answer cluster, not truth per se. Truth bias emerges only when falsehood is structurally incoherent. Whether this principle extends to large-scale pretraining remains an open question.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 28 of its 37 references that are in the map. First posted on arXiv 12 Mar 2026.

Builds on

28 of 37 references.

References · 28

  1. 2022Language Models (Mostly) Know What They Knowcited by 1,783
  2. 2023Inference-Time Intervention: Eliciting Truthful Answers from a Language Modelcited by 1,259
  3. 2024The FineWeb Datasets: Decanting the Web for the Finest Text Data at Scalecited by 1,104
  4. 2023Progress measures for grokking via mechanistic interpretabilitycited by 822
  5. 2022Discovering Latent Knowledge in Language Models Without Supervisioncited by 733
  6. 2023The Geometry of Truth: Emergent Linear Structure in Large Language Model Representations of True/False Datasetscited by 673
  7. 2023The Internal State of an LLM Knows When It's Lyingcited by 644
  8. 2022Large Language Models Struggle to Learn Long-Tail Knowledgecited by 452
  9. 2022Emergent World Representations: Exploring a Sequence Model Trained on a Synthetic Taskcited by 417
  10. 2021Entity-Based Knowledge Conflicts in Question Answeringcited by 349
  11. 2023Adaptive Chameleon or Stubborn Sloth: Revealing the Behavior of Large Language Models in Knowledge Conflictscited by 333
  12. 2023Language Models Represent Space and Timecited by 306
16 more
  1. 2023Language Modeling Is Compressioncited by 225
  2. 2018Deep learning generalizes because the parameter-function map is biased towards simple functionscited by 180
  3. 2017Deep Learning is Robust to Massive Label Noisecited by 164
  4. 2023Calibrated Language Models Must Hallucinatecited by 114
  5. 2024Truth is Universal: Robust Detection of Lies in LLMscited by 78
  6. 2023The No Free Lunch Theorem, Kolmogorov Complexity, and the Role of Inductive Biases in Machine Learningcited by 63
  7. 2022Measuring Causal Effects of Data Statistics on Language Model's `Factual' Predictionscited by 57
  8. 2024Compression Represents Intelligence Linearlycited by 56
  9. 2020Is SGD a Bayesian sampler? Well, almostcited by 50
  10. 2023Personas as a Way to Model Truthfulness in Language Modelscited by 46
  11. 2025Understanding LLM Behaviors via Compression: Data Generation, Knowledge Acquisition and Scaling Lawscited by 15
  12. 2023Grokking as Compression: A Nonlinear Complexity Perspectivecited by 14
  13. 2025Emergence of Linear Truth Encodings in Language Modelscited by 12
  14. 2024Formality is Favored: Unraveling the Learning Preferences of Large Language Models on Data with Conflicting Knowledgecited by 8
  15. 2025Large Language Models as Computable Approximations to Solomonoff Inductioncited by 6
  16. 2025Predictable Compression Failures: Order Sensitivity and Information Budgeting for Evidence-Grounded Binary Adjudicationcited by 2

Built on by

Not cited yet.