- Rating
- 2
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper views LLMs under the lens of optimal lossy compression of the data-generating process under a budget. The authors construct a hierarchical rate-distortion model and claim to derive three predictions: power-law loss, abrupt task acquisition, and hallucination. They test this on (1) small transformers trained on a synthetic data, where the optimum is computable, and (2) factual recall in open models, where they fit a temperature that predicts which facts get acquired.
Critical strengths
- The authors present a sensible framework to tie scaling, emergence and hallucination to one objective and make per-task predictions.
- Experiment 1 is nicely designed since the optimum is actually computable, and the result that networks conflate the same tasks the optimum does is interesting.
Critical weaknesses
-
There isn't much "derivation" of the scaling laws. From what I understand, the theory only predicts loss as a function of rate R. The dependence on N -- R in Exp. 1 is fitted from the networks, with no capacity theory connecting N to R. Proposition 1 only covers a single query, and for a single query a network has no capacity constraint to begin with. The constraint only shows up when many queries have to share the same parameters, which is not covered by the proof. So the claim that limited capacity acts like a KL budget is assumed. Also, dataset size and compute are listed as resources in the abstract but are never used or specified.
-
Evaluation issues:
2(a) Section 4 describes three control libraries (Flat, Order 4, Twins) and held-out tasks, but only Twins appears in the results. Flat and the held-out tasks, which would test Prediction 3 are not reported.
2(b) The description term is what distinguishes the model from the information bottleneck, but the authors do not carry out any ablation.
2(c) In Exp. 2, models close only 29–54% of the gap between a need-blind baseline and the frontier, i.e., in most families they are closer to random acquisition than to the optimum. This is not the 'optimal' behavior claimed in the abstract.
- Missing related work: The router–prototype hierarchy with KL costs is similar to Genewein et al. [1]. Rate-distortion explanations of hallucination are an active line of research [2]. It would be helpful if the authors explain their novel contributions over [1] + Michaud et al. (2023).
References:
[1] Genewein et al. (2015). Bounded Rationality, Abstraction, and Hierarchical Decision-Making: An Information-Theoretic Optimality Principle.
[2] Guo and Li (2026). Hallucination is a Consequence of Space-Optimality: A Rate-Distortion Theorem for Membership Testing.
Questions for authors
N/A