Sign inGet started
Paper · arXiv

Lossless Compression via Chained Lightweight Neural Predictors with Information Inheritance

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 mecha...

AuthorsYuriy Kim, Evgeny Belyaev
Primary categorycs.IT
Published16 April 2026
Last updated at source16 April 2026
cs.ITcs.LG
Embed this entry
<iframe src="https://silytics.si/embed/item/9091f4a9-10de-4ba9-b75e-d9af49303286" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.