Learning is Forgetting: LLM Training As Lossy Compression

Henry C. Conklin, Tom Hosking, Tan Yi-Chern, Julian Gold, Jonathan D. Cohen +3 more
4/8/2026
cs.LGcs.AIcs.CL

No confident code implementation found for this paper.

Abstract

Despite the increasing prevalence of large language models (LLMs), we still have a limited understanding of how their representational spaces are structured. This limits our ability to interpret how and what they learn or relate them to learning in humans. We argue LLMs are best seen as an instance of lossy compression, where over training they learn by retaining only information in their training data relevant to their objective(s). We show pre-training results in models that are optimally compressed for next-sequence prediction, approaching the Information Bottleneck bound on compression. Across an array of open weights models, each compresses differently, likely due to differences in the data and training recipes used. However even across different families of LLMs the optimality of a model's compression, and the information present in it, can predict downstream performance on across a wide array of benchmarks, letting us directly link representational structure to actionable insights about model performance. In the general case the work presented here offers a unified Information-Theoretic framing for how these models learn that is deployable at scale.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{conklin2026learning,
  title  = {Learning is Forgetting: LLM Training As Lossy Compression},
  author = {Henry C. Conklin and Tom Hosking and Tan Yi-Chern and Julian Gold and Jonathan D. Cohen and Thomas L. Griffiths and Max Bartolo and Seraphina Goldfarb-Tarrant},
  year   = {2026},
  eprint = {2604.07569},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2604.07569v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2604.07569.svg)](https://codeofpaper.com/paper/2604.07569)

Discussion