aiqbench analysis
This paper formalizes the bidirectional relationship between lossless compression algorithms and auto-regressive models, proposing a new design framework for compression-based machine learning. The authors demonstrate that this approach not only competes with conventional baselines but also significantly outperforms them on malware detection tasks. By leveraging principles like Minimum Description Length, this research offers a novel theoretical foundation for improving model accuracy and efficiency in specific domains.
An Introduction to Compression-Based Machine Learning
arXiv:2609.21309v1 Announce Type: new Abstract: Any lossless compression algorithm (like gzip) may be converted into a machine learning method, via either Normalized Compression Distance or the Minimum Description Length principle. Any auto-regressive model may be converted into a lossless compression method via entropy coding. This seemingly circular dependence has unrealized potential in modern artificial intelligence and machine learning, and we survey and formalize the various strategies that have been used to leverage compression for machine learning. We introduce and empirically validate a design framework for compression-based ML, finding compression-based methods competitive with conventional baselines and decisively stronger on malware. We find that varying these design choices yields accuracy gains of up to 0.62.
Abstract:Any lossless compression algorithm (like gzip) may be converted into a machine learning method, via either Normalized Compression Distance or the Minimum Description Length principle. Any auto-regressive model may be converted into a lossless compression method via entropy coding. This seemingly circular dependence has unrealized potential in modern artificial intelligence and machine learning, and we survey and formalize the various strategies that have been used to leverage compression for machine learning. We introduce and empirically validate a design framework for compression-based ML, finding compression-based methods competitive with conventional baselines and decisively stronger on malware. We find that varying these design choices yields accuracy gains of up to 0.62.
Machine Learning (cs.LG)
arXiv:2609.21309 [cs.LG]
(or arXiv:2609.21309v1 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2609.21309 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 · 202 words
Related coverage

PySpark Optimization: 12 Proven Techniques to Speed Up Your Spark Jobs
Analytics Vidhya · May 27, 2026

Sebastian Hassinger (The New Quantum Era): why neutral atoms lead the qubit race for now
The Quantum Insider · Sep 26, 2026

OpenRouter: from Seed to Stripe — with OpenRouter’s Alex Atallah & AMP’s Anjney Midha
Latent Space · Sep 25, 2026
Constrained Hebbian Learning Supports Efficient Representational Allocation under Structural Constraints
arXiv · Jul 20, 2026