Causal Vector-valued Witsenhausen Counterexamples with Feedback
Mengyuan Zhao, Ma\"el Le Treust, Tobias J. Oechtering

TL;DR
This paper analyzes the vector-valued Witsenhausen counterexample using empirical coordination coding, exploring how feedback and causality constraints affect the achievable cost regions and optimal coding strategies.
Contribution
It characterizes the achievable cost regions for vector-valued Witsenhausen problems under various feedback and causality scenarios, highlighting the necessity of time-sharing strategies.
Findings
Feedback improves performance with non-causal decoding.
Optimal schemes require time-sharing due to non-convexity.
Feedback benefits are limited to non-causal decoder scenarios.
Abstract
We study the continuous vector-valued Witsenhausen counterexample through the lens of empirical coordination coding. We characterize the region of achievable pairs of costs in three scenarios: (i) causal encoding and causal decoding, (ii) causal encoding and causal decoding with channel feedback, and (iii) causal encoding and noncausal decoding with channel feedback. In these vector-valued versions of the problem, the optimal coding schemes must rely on a time-sharing strategy, since the region of achievable pairs of costs might not be convex in the scalar version of the problem. We examine the role of the channel feedback when the encoder is causal and the decoder is either causal or non-causal, and we show that feedback improves the performance, only when the decoder is non-causal.
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.
Taxonomy
TopicsAdvanced Algebra and Logic
