Lossless Compression with Probabilistic Circuits
Anji Liu, Stephan Mandt, and Guy Van den Broeck

TL;DR
This paper introduces Probabilistic Circuits, a new class of neural network models that enable efficient lossless data compression with scalable encoding and decoding, outperforming existing neural methods in speed and quality.
Contribution
The paper presents Probabilistic Circuits as a scalable, efficient model for lossless compression, with novel encoding schemes and state-of-the-art results on image datasets.
Findings
PC-based compression runs 5-40 times faster than similar neural methods.
Achieved state-of-the-art results on MNIST dataset.
PCs can be integrated with existing neural models to enhance performance.
Abstract
Despite extensive progress on image generation, common deep generative model architectures are not easily applied to lossless compression. For example, VAEs suffer from a compression cost overhead due to their latent variables. This overhead can only be partially eliminated with elaborate schemes such as bits-back coding, often resulting in poor single-sample compression rates. To overcome such problems, we establish a new class of tractable lossless compression models that permit efficient encoding and decoding: Probabilistic Circuits (PCs). These are a class of neural networks involving computational units that support efficient marginalization over arbitrary subsets of the feature dimensions, enabling efficient arithmetic coding. We derive efficient encoding and decoding schemes that both have time complexity , where a naive scheme would…
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.
Code & Models
Videos
Taxonomy
TopicsGenerative Adversarial Networks and Image Synthesis · Algorithms and Data Compression · Numerical Methods and Algorithms
Methodspc
