mlsanityData to 7 Oct 2026

Neural Estimation of the Rate-Distortion Function With Applications to Operational Source Coding

arXiv 2204.01612 ↗First posted 4 Apr 2022cs.IT cs.LG math.ITcited by 9

Not on the map. Why?

Abstract (arXiv)

A fundamental question in designing lossy data compression schemes is how well one can do in comparison with the rate-distortion function, which describes the known theoretical limits of lossy compression. Motivated by the empirical success of deep neural network (DNN) compressors on large, real-world data, we investigate methods to estimate the rate-distortion function on such data, which would allow comparison of DNN compressors with optimality. While one could use the empirical distribution of the data and apply the Blahut-Arimoto algorithm, this approach presents several computational challenges and inaccuracies when the datasets are large and high-dimensional, such as the case of modern image datasets. Instead, we re-formulate the rate-distortion objective, and solve the resulting functional optimization problem using neural networks. We apply the resulting rate-distortion estimator, called NERD, on popular image datasets, and provide evidence that NERD can accurately estimate the rate-distortion function. Using our estimate, we show that the rate-distortion achievable by DNN compressors are within several bits of the rate-distortion function for real-world datasets. Additionally, NERD provides access to the rate-distortion achieving channel, as well as samples from its output marginal. Therefore, using recent results in reverse channel coding, we describe how NERD can be used to construct an operational one-shot lossy compression scheme with guarantees on the achievable rate and distortion. Experimental results demonstrate competitive performance with DNN compressors.

Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 14 of its 45 references that are in the map. First posted on arXiv 4 Apr 2022.

Builds on

14 of 45 references.

References · 14

  1. 2015Unsupervised Representation Learning with Deep Convolutional Generative Adversarial Networkscited by 2,048
  2. 2016End-to-end Optimized Image Compressioncited by 673
  3. 2018Understanding disentangling in β-VAEcited by 332
  4. 2017Learning Generative Models with Sinkhorn Divergencescited by 310
  5. 2017Lossy Image Compression with Compressive Autoencoderscited by 289
  6. 2018Formal Limitations on the Measurement of Mutual Informationcited by 189
  7. 2017Soft-to-Hard Vector Quantization for End-to-End Learning Compressible Representationscited by 149
  8. 2020Nonlinear Transform Codingcited by 132
  9. 2020Compressing Images by Encoding Their Latent Representations with Relative Entropy Codingcited by 36
  10. 2021Algorithms for the Communication of Samplescited by 31
  11. 2020Evaluating Lossy Compression Rates of Deep Generative Modelscited by 16
  12. 2021Towards Empirical Sandwich Bounds on the Rate-Distortion Functioncited by 13
2 more
  1. 2020Neural Networks Optimally Compress the Sawbridgecited by 11
  2. 2019Exact Rate-Distortion in Autoencoders via Echo Noisecited by 5

Built on by

Cited by year (2026 to 7 Oct)

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

9 papers.