requential-coding-pushing-the-limits-of-model-compression-with-self-generated-training-data-abd4e5a0·1 events·first seen Aliases: Requential Coding: Pushing the Limits of Model Compression with Self-Generated Training Data
A new arXiv preprint introduces requential coding, a compression scheme where a teacher model selects training samples from the student model's own distribution, so the code records only teacher-student disagreements rather than the full data sequence. The resulting code lengths are independent of both parameter count and data entropy, yielding codes orders of magnitude shorter than prequential coding baselines. Plugged into a PAC-Bayes framework, the method produces state-of-the-art generalization guarantees for billion-parameter LLMs that tighten with scale in the compute-optimal regime, and reveals that larger models and ensembles become increasingly compressible relative to dataset size.