mlsanityData to 7 Oct 2026

Neural Image Compression: Generalization, Robustness, and Spectral Biases

arXiv 2307.08657 ↗First posted 17 Jul 2023eess.IV cs.LGcited by 4

Not on the map. Why?

Abstract (arXiv)

Recent advances in neural image compression (NIC) have produced models that are starting to outperform classic codecs. While this has led to growing excitement about using NIC in real-world applications, the successful adoption of any machine learning system in the wild requires it to generalize (and be robust) to unseen distribution shifts at deployment. Unfortunately, current research lacks comprehensive datasets and informative tools to evaluate and understand NIC performance in real-world settings. To bridge this crucial gap, first, this paper presents a comprehensive benchmark suite to evaluate the out-of-distribution (OOD) performance of image compression methods. Specifically, we provide CLIC-C and Kodak-C by introducing 15 corruptions to the popular CLIC and Kodak benchmarks. Next, we propose spectrally-inspired inspection tools to gain deeper insight into errors introduced by image compression methods as well as their OOD performance. We then carry out a detailed performance comparison of several classic codecs and NIC variants, revealing intriguing findings that challenge our current understanding of the strengths and limitations of NIC. Finally, we corroborate our empirical findings with theoretical analysis, providing an in-depth view of the OOD performance of NIC and its dependence on the spectral properties of the data. Our benchmarks, spectral inspection tools, and findings provide a crucial bridge to the real-world adoption of NIC. We hope that our work will propel future efforts in designing robust and generalizable NIC methods. Code and data will be made available at https://github.com/klieberman/ood_nic.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 44 of its 71 references that are in the map. First posted on arXiv 17 Jul 2023.

Builds on

44 of 71 references.

References · 44

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2019Benchmarking Neural Network Robustness to Common Corruptions and Perturbationscited by 2,857
  3. 2017FiLM: Visual Reasoning with a General Conditioning Layercited by 2,286
  4. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  5. 2020The Many Faces of Robustness: A Critical Analysis of Out-of-Distribution Generalizationcited by 1,842
  6. 2019Do ImageNet Classifiers Generalize to ImageNet?cited by 1,507
  7. 2018Variational image compression with a scale hyperpriorcited by 910
  8. 2016End-to-end Optimized Image Compressioncited by 673
  9. 2020RobustBench: a standardized adversarial robustness benchmarkcited by 659
  10. 2018Joint Autoregressive and Hierarchical Priors for Learned Image Compressioncited by 642
  11. 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 627
  12. 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 596
32 more
  1. 2022ELIC: Efficient Learned Image Compression with Unevenly Grouped Space-Channel Contextual Adaptive Codingcited by 296
  2. 2017Lossy Image Compression with Compressive Autoencoderscited by 289
  3. 2019A Fourier Perspective on Model Robustness in Computer Visioncited by 288
  4. 2018LQ-Nets: Learned Quantization for Highly Accurate and Compact Deep Neural Networkscited by 272
  5. 2020CompressAI: a PyTorch library and evaluation platform for end-to-end compression researchcited by 271
  6. 2021Pruning and Quantization for Deep Neural Network Acceleration: A Surveycited by 259
  7. 2020Channel-wise Autoregressive Entropy Models for Learned Image Compressioncited by 255
  8. 2023Learned Image Compression with Mixed Transformer-CNN Architecturescited by 205
  9. 2021Checkerboard Context Model for Efficient Learned Image Compressioncited by 193
  10. 2022The Devil Is in the Details: Window-based Attention for Image Compressioncited by 141
  11. 2015Density Modeling of Images using a Generalized Normalization Transformationcited by 123
  12. 2019Variable Rate Deep Image Compression With a Conditional Autoencodercited by 109
  13. 2022Benchmarking Robustness of 3D Point Cloud Recognition Against Common Corruptionscited by 78
  14. 2017Exploring Sparsity in Recurrent Neural Networkscited by 75
  15. 2021On the effectiveness of adversarial training against common corruptionscited by 71
  16. 2021A Winning Hand: Compressing Deep Networks Can Improve Out-Of-Distribution Robustnesscited by 62
  17. 2021Multi-Prize Lottery Ticket Hypothesis: Finding Accurate Binary Neural Networks by Pruning A Randomly Weighted Networkcited by 55
  18. 2019Loss Landscapes of Regularized Linear Autoencoderscited by 45
  19. 2022Unified Multivariate Gaussian Mixture for Efficient Neural Image Compressioncited by 43
  20. 2018From Principal Subspaces to Principal Components with Linear Autoencoderscited by 38
  21. 2021Slimmable Compressive Autoencoders for Practical Neural Image Compressioncited by 38
  22. 2019Computationally Efficient Neural Image Compressioncited by 31
  23. 2018The Effects of JPEG and JPEG2000 Compression on Attacks using Adversarial Examplescited by 12
  24. 2021On the relation between statistical learning and perceptual distancescited by 12
  25. 2021Universal Efficient Variable-rate Neural Image Compressioncited by 6
  26. 2022Memory-Efficient Learned Image Compression with Pruned Hyperprior Modulecited by 6
  27. 2021End-to-End Learned Image Compression with Quantized Weights and Activationscited by 4
  28. 2022Exploring Structural Sparsity in Neural Image Compressioncited by 4
  29. 2022MALICE: Manipulation Attacks on Learned Image ComprEssioncited by 3
  30. 2022Learning sparse auto-encoders for green AI image codingcited by 3
  31. 2021Out-of-Distribution Robustness in Deep Learning Compressioncited by 1
  32. 2022Improving Multi-generation Robustness of Learned Image Compressioncited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 1; 2025: 2; 2026: 1.

4 papers.