mlsanityData to 7 Oct 2026

Approaching Rate-Distortion Limits in Neural Compression with Lattice Transform Coding

arXiv 2403.07320 ↗First posted 12 Mar 2024cs.IT cs.LG eess.SPcited by 8

Not on the map. Why?

Abstract (arXiv)

Neural compression has brought tremendous progress in designing lossy compressors with good rate-distortion (RD) performance at low complexity. Thus far, neural compression design involves transforming the source to a latent vector, which is then rounded to integers and entropy coded. While this approach has been shown to be optimal on a few specific sources, we show that it can be highly sub-optimal on synthetic sources whose intrinsic dimensionality is greater than one. With integer rounding in the latent space, the quantization regions induced by neural transformations, remain square-like and fail to match those of optimal vector quantization. We demonstrate that this phenomenon is due to the choice of scalar quantization in the latent space, and not the transform design. By employing lattice quantization instead, we propose Lattice Transform Coding (LTC) and show that it approximately recovers optimal vector quantization at reasonable complexity. On real-world sources, LTC improves upon standard neural compressors. LTC also provides a framework that can integrate structurally (near) optimal information-theoretic designs into lossy compression; examples include block coding, which yields coding gain over optimal one-shot coding and approaches the asymptotically-achievable rate-distortion function, as well as nested lattice quantization for low complexity fixed-rate coding.

Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 19 of its 50 references that are in the map. First posted on arXiv 12 Mar 2024.

Builds on

19 of 50 references.

References · 19

  1. 2017Neural Discrete Representation Learningcited by 4,650
  2. 2016Density estimation using Real NVPcited by 2,029
  3. 2018Variational image compression with a scale hyperpriorcited by 910
  4. 2017Video Enhancement with Task-Oriented Flowcited by 612
  5. 2020Learned Image Compression with Discretized Gaussian Mixture Likelihoods and Attention Modulescited by 570
  6. 2022ELIC: Efficient Learned Image Compression with Unevenly Grouped Space-Channel Contextual Adaptive Codingcited by 296
  7. 2020CompressAI: a PyTorch library and evaluation platform for end-to-end compression researchcited by 271
  8. 2018Formal Limitations on the Measurement of Mutual Informationcited by 189
  9. 2020Nonlinear Transform Codingcited by 132
  10. 2022An Introduction to Neural Data Compressioncited by 78
  11. 2022Image Compression with Product Quantized Masked Image Modelingcited by 32
  12. 2023LVQAC: Lattice Vector Quantization Coupled with Spatially Adaptive Companding for Efficient Learned Image Compressioncited by 19
7 more
  1. 2023NVTC: Nonlinear Vector Transform Codingcited by 14
  2. 2021Towards Empirical Sandwich Bounds on the Rate-Distortion Functioncited by 13
  3. 2020Neural Networks Optimally Compress the Sawbridgecited by 11
  4. 2022Neural Estimation of the Rate-Distortion Function With Applications to Operational Source Codingcited by 9
  5. 2022Fundamental Limits of Two-layer Autoencoders, and Achieving Them with Gradient Methodscited by 3
  6. 2022Do Neural Networks Compress Manifolds Optimally?cited by 2
  7. 2021Principal Bit Analysis: Autoencoding with Schur-Concave Losscited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 1; 2025: 3; 2026: 4.

8 papers.