
TL;DR
This paper characterizes the optimal trade-off between common randomness and description rate in distributed channel synthesis, revealing connections to common information and introducing a novel proof technique using a soft covering lemma.
Contribution
It provides a comprehensive characterization of the rate-randomness trade-off in distributed channel synthesis, including new derivations and a strengthened soft covering lemma.
Findings
Optimal trade-off between common randomness and description rate established
Soft covering lemma generalized and strengthened
Insights into common information duality and applications to secrecy and game theory
Abstract
Two familiar notions of correlation are rediscovered as the extreme operating points for distributed synthesis of a discrete memoryless channel, in which a stochastic channel output is generated based on a compressed description of the channel input. Wyner's common information is the minimum description rate needed. However, when common randomness independent of the input is available, the necessary description rate reduces to Shannon's mutual information. This work characterizes the optimal trade-off between the amount of common randomness used and the required rate of description. We also include a number of related derivations, including the effect of limited local randomness, rate requirements for secrecy, applications to game theory, and new insights into common information duality. Our proof makes use of a soft covering lemma, known in the literature for its role in quantifying…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
