Metraipolis › archive › dc_bca9bc110b43

Rate-Distortion-Perception Tradeoff for Vector Gaussian Sources with Limited Common Randomness: Exact Characterization and Approximate Universality — arXiv:2611.04693

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.04693
License (as archived)
CC0-1.0
Archived
2026-11-04T19:01:52.442Z
SHA-256 of the archived text
f51495ba73362c8fcaa45796b06dfc75ae0b863010481754d06262415a343d85
Stable URL of this page
https://metraipolis.com/documento/dc_bca9bc110b43

How to cite

Rate-Distortion-Perception Tradeoff for Vector Gaussian Sources with Limited Common Randomness: Exact Characterization and Approximate Universality — arXiv:2611.04693 — arXiv (en), https://arxiv.org/abs/2611.04693 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_bca9bc110b43 (Metraipolis archive dc_bca9bc110b43, sha256 f51495ba73362c8fcaa45796b06dfc75ae0b863010481754d06262415a343d85)
BibTeX
@misc{dcbca9bc110b43,
  title = {Rate-Distortion-Perception Tradeoff for Vector Gaussian Sources with Limited Common Randomness: Exact Characterization and Approximate Universality — arXiv:2611.04693},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.04693},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_bca9bc110b43; sha256 f51495ba73362c8fcaa45796b06dfc75ae0b863010481754d06262415a343d85},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.04693. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The distortion-rate-common randomness-perception (DRCP) theory characterizes how limited common randomness (CR) improves reconstruction fidelity under perceptual constraints, thereby providing an information-theoretic foundation for generative compression. In this paper, we characterize the DRCP tradeoff for vector Gaussian sources with limited CR under the squared-error distortion measure and the squared Wasserstein-2 perception measure. Specifically, we first establish a generalized reverse waterfilling characterization of globally optimal allocations. Second, we derive an analytical upper bound on the DRCP function through sequential greedy allocation of rate and CR. For fixed rate and CR budgets, the resulting representation is independent of the perception threshold. Finally, we establish its approximate universality through uniform performance guarantees: the achievable distortion exceeds the optimal distortion by at most $2\rho^*\approx0.2897$ times the total source variance, whereas the optimal-to-greedy distortion ratio is at least $\eta^*\approx0.7517$.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.IT, nuovi lavori del giorno).
Categorie arXiv: Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2611.04693 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-04T18:38:39.761Z dalla pagina https://arxiv.org/list/math.IT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).