mlsanityData to 7 Oct 2026

The Rate-Distortion-Perception Trade-off: The Role of Private Randomness

arXiv 2404.01111 ↗First posted 1 Apr 2024cs.IT math.IT stat.MLcited by 6

Not on the map. Why?

Abstract (arXiv)

In image compression, with recent advances in generative modeling, the existence of a trade-off between the rate and the perceptual quality (realism) has been brought to light, where the realism is measured by the closeness of the output distribution to the source. It has been shown that randomized codes can be strictly better under a number of formulations. In particular, the role of common randomness has been well studied. We elucidate the role of private randomness in the compression of a memoryless source Xn=(X1,...,Xn) under two kinds of realism constraints. The near-perfect realism constraint requires the joint distribution of output symbols (Y1,...,Yn) to be arbitrarily close the distribution of the source in total variation distance (TVD). The per-symbol near-perfect realism constraint requires that the TVD between the distribution of output symbol Yt and the source distribution be arbitrarily small, uniformly in the index t. We characterize the corresponding asymptotic rate-distortion trade-off and show that encoder private randomness is not useful if the compression rate is lower than the entropy of the source, however limited the resources in terms of common randomness and decoder private randomness may be.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 11 of its 29 references that are in the map. First posted on arXiv 1 Apr 2024.

Builds on

11 of 29 references.

References · 11

  1. 2017The Perception-Distortion Tradeoffcited by 582
  2. 2018Generative Adversarial Networks for Extreme Learned Image Compressioncited by 213
  3. 2019Rethinking Lossy Compression: The Rate-Distortion-Perception Tradeoffcited by 207
  4. 2022Lossy Compression with Gaussian Diffusioncited by 87
  5. 2020Universally Quantized Neural Compressioncited by 60
  6. 2021Universal Rate-Distortion-Perception Representations for Lossy Compressioncited by 46
  7. 2021A coding theorem for the rate-distortion-perception functioncited by 30
  8. 2022The Rate-Distortion-Perception Tradeoff: The Role of Common Randomnesscited by 21
  9. 2023Compression with Exact Error Distribution for Federated Learningcited by 9
  10. 2023Communication Efficient Private Federated Learning Using Ditheringcited by 8
  11. 2023Wasserstein Distortion: Unifying Fidelity and Realismcited by 8

Built on by

Cited by year (2026 to 7 Oct)

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

6 papers.