user: text: Write a concise one-sentence TLDR summary of the scientific paper content below.

Title: HiLLoC: lossless image compression with hierarchical latent variable models

Paper content:
We make the following striking observation: fully convolutional VAE models trained on 32x32 ImageNet can generalize well, not just to 64x64 but also to far larger photographs, with no changes to the model.
We use this property, applying fully convolutional models to lossless compression, demonstrating a method to scale the VAE-based 'Bits-Back with ANS' algorithm for lossless compression to large color photographs, and achieving state of the art for compression of full size ImageNet images.
We release Craystack, an open source library for convenient prototyping of lossless compression using probabilistic models, along with full implementations of all of our compression results.
Bits back coding (Wallace, 1990; Hinton & van Camp, 1993 ) is a method for performing lossless compression using a latent variable model.
In an ideal implementation, the method can achieve an expected message length equal to the variational free energy, often referred to as the negative evidence lower bound (ELBO) of the model.
Bits back was first introduced to form a theoretical argument for using the ELBO as an objective function for machine learning (Hinton & van Camp, 1993) .
The first implementation of bits back coding (Frey, 1997; Frey & Hinton, 1996) made use of first-infirst-out (FIFO) arithmetic coding (AC) (Witten et al., 1987) .
However, the implementation did not achieve optimal compression, due to an incompatibility between a FIFO coder and bits back coding, and its use was only demonstrated on a small dataset of 8×8 binary images.
Compression' (HiLLoC).
In our experiments (Section 4), we demonstrate that HiLLoC can be used to compress color images from the ImageNet test set at rates close to the ELBO, outperforming all of the other codecs which we benchmark.
We also demonstrate the speedup, of nearly three orders of magnitude, resulting from vectorization.
We release an open source implementation based on 'Craystack', a Python package which we have written for general prototyping of lossless compression with ANS.
Our experiments demonstrate HiLLoC as a bridge between large scale latent variable models and compression.
To do this we use simple variants of pre-existing VAE models.
Having shown that bits back coding is flexible enough to compress well with large, complex models, we see plenty of work still to be done in searching model structures (i.e. architecture search), optimizing with a trade-off between compression rate, encode/decode time and memory usage.
Particularly pertinent for HiLLoC is latent dimensionality, since compute time and memory usage both scale with this.
Since the model must be stored/transmitted to use HiLLoC, weight compression is also highly relevant.
This is a well-established research area in machine learning (Han et al., 2016; Ullrich et al., 2017) .
Our experiments also demonstrated that one can achieve good performance on a dataset of large images by training on smaller images.
This result is promising, but future work should be done to discover what the best training datasets are for coding generic images.
One question in particular is whether results could be improved by training on larger images and/or images of varying size.
We leave this to future work.
Another related direction for improvement is batch compression of images of different sizes using masking, analogous to how samples of different length may be processed in batches by recurrent neural nets.
Whilst this work has focused on latent variable models, there is also promise in applying state of the art fully observed auto-regressive models to lossless compression.
We look forward to future work investigating the performance of models such as WaveNet (van den Oord et al., 2016) for lossless audio compression as well as PixelCNN++ (Salimans et al., 2017) and the state of the art models in Menick & Kalchbrenner (2019) for images.
Sampling speed for these models, and thus decompression, scales with autoregressive sequence length, and can be very slow.
This could be a serious limitation, particularly in common applications where encoding is performed once but decoding is performed many times.
This effect can be mitigated by using dynamic programming (Le Paine et al., 2016; Ramachandran et al., 2017) , and altering model architecture (Reed et al., 2017) , but on parallel architectures sampling/decompression is still significantly slower than with VAE models.
On the other hand, fully observed models, as well as the flow based models of Hoogeboom et al. (2019) and , do not require bits back coding, and therefore do not have to pay the one-off cost of starting a chain.
Therefore they may be well suited to situations where one or a few i.i.d. samples are to be communicated.
Similar to the way that we use FLIF to code the first images for our experiments, one could initially code images using a fully observed model then switch to a faster latent variable model once a stack of bits has been built up.
We presented HiLLoC, an extension of BB-ANS to hierarchical latent variable models, and show that HiLLoC can perform well with large models.
We open-sourced our implementation, along with the Craystack package for prototyping lossless compression.
We have also explored generalization of large VAE models, and established that fully convolutional VAEs can generalize well to other datasets, including images of very different size to those they were trained on.
We have described how to compress images of arbitrary size with HiLLoC, achieving a compression rate superior to the best available codecs on ImageNet images.
We look forward to future work reuniting machine learning and lossless compression.

assistant: text: We scale up lossless compression with latent variables, beating existing approaches on full-size ImageNet images.