Lossless Compression via Chained Lightweight Neural Predictors with Information Inheritance
Yuriy Kim, Evgeny Belyaev

TL;DR
This paper introduces a neural network-based lossless data compression method using a chain of lightweight predictors with information inheritance, achieving high compression ratios and superior throughput on GPUs.
Contribution
It proposes a minimal-weight neural predictor chain architecture with information inheritance for efficient lossless compression, improving speed while maintaining competitive ratios.
Findings
Achieves compression ratios close to state-of-the-art PAC compressor.
Outperforms PAC in encoding throughput by 1.2 to 6.3 times.
Outperforms PAC in decoding throughput by 2.8 to 12.3 times.
Abstract
This paper is dedicated to lossless data compression with probability estimation using neural networks. First, we propose a probability estimation architecture based on a chain of neural predictors, so that each unit of the chain is defined as a neural network with the minimum possible number of weights, which is sufficient for efficient compression of data generated by Markov sources of a given order. We show that this architecture allows us to minimize the overall number of weights participating in the probability estimation process depending on the statistical properties of the input data. Second, in order to improve compression efficiency, we introduce an information inheritance mechanism, where the probability estimate obtained by a low-order unit is used at the next higher-order unit. Experimental results show that the proposed lossless data compressor equipped with the chained…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
