AI & ML
Rate-Distortion-Perception Tradeoff for Vector Gaussian Sources with Limited Common Randomness: Exact Characterization and Approximate Universality
arXiv math.IT0 views
arXiv:2611.04693v1 Announce Type: new Abstract: 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$.
Source:https://arxiv.org/abs/2611.04693PreviousNon-asymptotic Sphere-Packing Bounds for Finite-Blocklength Scalar Gaussian Multiple-Access and Broadcast ChannelsNextConstruction of New Complete Complementary Codes Using Extended Boolean Functions and Permutations
Related posts
Hugging Face’s CEO Says His P(Doom) Is ‘Close to Zero’
0Wired
Knives Are Out in the White House
0Wired
Open source AI is booming. Hugging Face explains who profits.
0TechCrunch
From disclosure to durable protection: lessons from CVE-2026-113341
0dev.to
Do AI crawlers read llms.txt? What three days of server logs show
0dev.to

About $50 per breach: inside the AI-agent campaigns that probed 1,200+ websites
0dev.to News