Linger and Lose: Knowledge Collapse in Low-Bit Language Models
cs.CL
Submitted: 2026-09-26
Updated: 2026-09-26
License: http://creativecommons.org/licenses/by/4.0/
The gist: Training language models with ternary weights is commonly judged by loss and downstream accuracy, which record only a modest cost relative to full precision.
Terminology
Abstract
Training language models with ternary weights is commonly judged by loss and downstream accuracy, which record only a modest cost relative to full precision. We show that these metrics can conceal a much larger failure. We instead measure knowledge capacity, the factual bits stored per parameter, on synthetic biographies with known information content. We train GPT-2-style models from scratch with 2.5M to 50M parameters at five precisions. Under the standard cosine schedule, ternary models retain as little as 6% of an identically trained fp16 model's capacity. The deficit widens with model size while perplexity rises by only 1.4 to 1.6 times. Measured throughout training, these models first acquire capacity and then lose most of it. We identify this knowledge collapse as a learning-rate dwell instability. Held near 1 -- 2 times10-4 with no decay, a pre-collapse model collapses within a few hundred exposures, and returning to a safe rate does not restore capacity. We then locate the collapse in the output head. It happens at a value the model can never predict. The weights there grow unchecked, while every other prediction the model makes is unchanged. We find that making the value predictable removes the collapse, regardless of which attribute carries it. A warmup-stable-decay schedule with a 10% cooldown increases ternary capacity by 2.7 times at 25M and 4.3 times at 50M. Gains are larger at lower precision. Cutting the output head's learning rate prevents failure when training from scratch. The post-training quantization methods we tested recover no measurable capacity below 4 bits. Our findings suggest judging low-precision training by retained capacity during training rather than final loss.
Sources
- Physics of Language Models: Part 3.3, Knowledge Capacity Scaling Laws
- Training Dynamics Impact Post-Training Quantization Robustness
- Perplexity Can Miss SAE Feature Damage Under Quantization
- Factual recall in linear associative memories: sharp asymptotics and mechanistic insights
- Scaling Laws and Compute-Optimal Training Beyond Fixed Training Durations
- MiniCPM: Unveiling the Potential of Small Language Models with Scalable Training Strategies
- Spectra: Surprising Effectiveness of Pretraining Ternary Language Models at Scale
- Scaling Laws for Precision
- ParetoQ: Improving Scaling Laws in Extremely Low-bit LLM Quantization
- The Era of 1-bit LLMs: All Large Language Models are in 1.58 Bits
- How much do language models memorize?
- BitNet b1.58 Reloaded: State-of-the-art Performance Also on Smaller Networks
- (How) Learning Rates Regulate Catastrophic Overtraining
- Mapping the Schedule x Bit-Width Boundary in Sub-100M Quantisation-Aware Training
- Muon Outperforms Adam in Tail-End Associative Memory Learning
- Sharpness-Aware Pretraining Mitigates Catastrophic Forgetting
- Bit-by-Bit: Progressive QAT Strategy with Outlier Channel Splitting for Stable Low-Bit LLMs
Related papers
- Exploring Solution Divergence and Its Effect on Large Language Model Problem Solving
- Ishigaki-IDS-Bench: A Benchmark for Generating Information Delivery Specification from BIM Information Requirements
- Subliminal Steering: Stronger Encoding of Hidden Signals
- MedStruct-S: A Benchmark for Key Discovery, Key-Conditioned QA and Semi-Structured Extraction from OCR Clinical Reports
- The End of Transformers? On Challenging Attention and the Rise of Sub-Quadratic Architectures
- Untangling the Mechanisms of Misleading Context in Medical Question Answering