about
Practical Lossless Compression with Latent Variables Using Bits Back Coding [pdf] (arxiv.org)
1 point by espeed on May 26, 2019 | hide | past | pdf | discuss on HN

In plain words: A trick called bits-back coding squeezes lossless files by using a generative model's hidden randomness to refund some of the bits it spends, getting close to the smallest possible size. On handwritten digits it beat standard compressors using only a simple generative model.

Abstract · Practical Lossless Compression with Latent Variables using Bits Back Coding

Deep latent variable models have seen recent success in many data domains. Lossless compression is an application of these models which, despite having the potential to be highly useful, has yet to be implemented in a practical manner. We present `Bits Back with ANS' (BB-ANS), a scheme to perform lossless compression with latent variable models at a near optimal rate. We demonstrate this scheme by using it to compress the MNIST dataset with a variational auto-encoder model (VAE), achieving compression rates superior to standard methods with only a simple VAE. Given that the scheme is highly amenable to parallelization, we conclude that with a sufficiently high quality generative model this scheme could be used to achieve substantial improvements in compression rate with acceptable running time. We make our implementation available open source at https://github.com/bits-back/bits-back .

James Townsend, Tom Bird, David Barber
arXiv:1901.04866 · cs.LG, cs.AI, cs.IT, stat.CO, stat.ML · submitted Jan 15, 2019
abstract · pdf · html

add comment on HN