aiqbench analysis
This research introduces Weight Pair Encoding (WeightPE), a novel technique that explicitly optimizes neural network weights to admit smaller grammars using Re-Pair compression within a straight-through estimator. By treating grammar size as an explicit training objective, the method achieves significant compression ratios compared to standard quantization-aware training while maintaining acceptable accuracy trade-offs. This approach represents a meaningful step toward more efficient model representations and structured weight compression in machine learning systems.
Weight Pair Encoding: Inducing a Smaller Grammar in Neural Network Weights
arXiv:2609.31564v1 Announce Type: new Abstract: We show that neural network weights can be explicilty fintuned to admit a smaller grammar. Weight Pair Encoding (WeightPE) does so by placing a lossy Re-Pair compressor inside a straight-through estimator. The int8 weights of the network are flattened into one string, and near-matching Re-Pair patterns are made exactly equal within a global L2 budget. The network computes with the rewritten weights and trains through them with a straight-through estimator. Unlike a flat codebook of fixed-size entries, a grammar offers variable-length patterns and reuses them hierarchically inside larger ones. On the MLP weights of ViT-B/16 and ViT-L/16 finetuned on CIFAR-10, WeightPE produces a Re-Pair grammar 0.43x and 0.38x the size of the one produced by an equivalent int8 QAT run, at a cost of 1.9 and 1.1 accuracy points. The trend extends to different grammar compressors (LZ78, SEQUITUR), over which the networks has not be finetuned against. To our knowledge, this is the first time grammar size has been used as an explicit training objective for network weights.
Abstract:We show that neural network weights can be explicilty fintuned to admit a smaller grammar. Weight Pair Encoding (WeightPE) does so by placing a lossy Re-Pair compressor inside a straight-through estimator. The int8 weights of the network are flattened into one string, and near-matching Re-Pair patterns are made exactly equal within a global L2 budget. The network computes with the rewritten weights and trains through them with a straight-through estimator. Unlike a flat codebook of fixed-size entries, a grammar offers variable-length patterns and reuses them hierarchically inside larger ones. On the MLP weights of ViT-B/16 and ViT-L/16 finetuned on CIFAR-10, WeightPE produces a Re-Pair grammar 0.43x and 0.38x the size of the one produced by an equivalent int8 QAT run, at a cost of 1.9 and 1.1 accuracy points. The trend extends to different grammar compressors (LZ78, SEQUITUR), over which the networks has not be finetuned against. To our knowledge, this is the first time grammar size has been used as an explicit training objective for network weights.
Machine Learning (cs.LG)
arXiv:2609.31564 [cs.LG]
(or arXiv:2609.31564v1 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2609.31564 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 262 words
Related coverage

PIRAMID: Progress and Plans
LessWrong · Jul 27, 2026
[AINews] High Taste Testers Ep. 1
Latent Space · Oct 17, 2026

Generalization and infinite width
LessWrong · Aug 1, 2026

Opaque recurrence, and other AI terms that you should probably know
TechCrunch · Sep 7, 2026