OSOA: One-Shot Online Adaptation of Deep Generative Models for Lossless Compression
Not on the map. Why?
Abstract (arXiv)
Explicit deep generative models (DGMs), e.g., VAEs and Normalizing Flows, have shown to offer an effective data modelling alternative for lossless compression. However, DGMs themselves normally require large storage space and thus contaminate the advantage brought by accurate data density estimation. To eliminate the requirement of saving separate models for different target datasets, we propose a novel setting that starts from a pretrained deep generative model and compresses the data batches while adapting the model with a dynamical system for only one epoch. We formalise this setting as that of One-Shot Online Adaptation (OSOA) of DGMs for lossless compression and propose a vanilla algorithm under this setting. Experimental results show that vanilla OSOA can save significant time versus training bespoke models and space versus using one model for all targets. With the same adaptation step number or adaptation time, it is shown vanilla OSOA can exhibit better space efficiency, e.g., 47% less space, than fine-tuning the pretrained model and saving the fine-tuned model. Moreover, we showcase the potential of OSOA and motivate more sophisticated OSOA algorithms by showing further space or time efficiency with multiple updates per batch and early stopping.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 27 of its 57 references that are in the map. First posted on arXiv 2 Nov 2021.
Builds on
27 of 57 references.
References · 27
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2016Densely Connected Convolutional Networkscited by 6,720
- 2018Glow: Generative Flow with Invertible 1x1 Convolutionscited by 1,545
- 2016Improving Variational Inference with Inverse Autoregressive Flowcited by 640
- 2018Do Deep Generative Models Know What They Don't Know?cited by 443
- 2017PixelCNN++: Improving the PixelCNN with Discretized Logistic Mixture Likelihood and Other Modificationscited by 417
- 2017A Downsampled Variant of ImageNet as an Alternative to the CIFAR datasetscited by 377
- 2015A note on the evaluation of generative modelscited by 292
- 2019Flow++: Improving Flow-Based Generative Models with Variational Dequantization and Architecture Designcited by 262
- 2019Video Compression With Rate-Distortion Autoencoderscited by 97
- 2018Practical Full Resolution Learned Lossless Image Compressioncited by 94
- 2019Practical Lossless Compression with Latent Variables using Bits Back Codingcited by 86
15 more
- 2019Integer Discrete Flows and Lossless Compressioncited by 83
- 2019VideoFlow: A Conditional Flow-Based Model for Stochastic Video Generationcited by 74
- 2018The Description Length of Deep Learning Modelscited by 72
- 2013RNADE: The real-valued neural autoregressive density-estimatorcited by 66
- 2018Minimal Random Code Learning: Getting Bits Back from Compressed Model Parameterscited by 58
- 2019Bit-Swap: Recursive Bits-Back Coding for Lossless Compression with Hierarchical Latent Variablescited by 52
- 2021Overfitting for Fun and Profit: Instance-Adaptive Data Compressioncited by 38
- 2019HiLLoC: Lossless Image Compression with Hierarchical Latent Variable Modelscited by 37
- 2020IDF++: Analyzing and Improving Integer Discrete Flows for Lossless Compressioncited by 36
- 2019Compression with Flows via Local Bits-Back Codingcited by 34
- 2018DeepZip: Lossless Data Compression using Recurrent Neural Networkscited by 33
- 2020Learning Better Lossless Compression Using Lossy Compressioncited by 33
- 2021iVPF: Numerical Invertible Volume Preserving Flow for Efficient Lossless Compressioncited by 27
- 2020Learning Discrete Distributions by Dequantizationcited by 18
- 2021Lossless Compression with Latent Variable Modelscited by 4
Built on by
Not cited yet.