Metraipolis › archive › dc_77d33168e012
From Optimal Transport to Optimal Quantization: A Variational Study of the Witsenhausen Counterexample — arXiv:2609.18992
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.18992
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-15T15:40:27.328Z
- SHA-256 of the archived text
aa762dc0aa70d0787776f303bc3c1b4db49a1bcc39100ad1e2a27b593049b3a7- Stable URL of this page
https://metraipolis.com/documento/dc_77d33168e012
How to cite
From Optimal Transport to Optimal Quantization: A Variational Study of the Witsenhausen Counterexample — arXiv:2609.18992 — arXiv (en), https://arxiv.org/abs/2609.18992 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_77d33168e012 (Metraipolis archive dc_77d33168e012, sha256 aa762dc0aa70d0787776f303bc3c1b4db49a1bcc39100ad1e2a27b593049b3a7)
BibTeX
@misc{dc77d33168e012,
title = {From Optimal Transport to Optimal Quantization: A Variational Study of the Witsenhausen Counterexample — arXiv:2609.18992},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.18992},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_77d33168e012; sha256 aa762dc0aa70d0787776f303bc3c1b4db49a1bcc39100ad1e2a27b593049b3a7},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.18992. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Witsenhausen's counterexample is a canonical problem in decentralized control: a two-stage linear-quadratic-Gaussian team problem in which nonlinear policies strictly outperform every affine one. This paper develops a variational and computational framework for the scalar counterexample based on optimal transport. Building on the transport formulation of Wu and Verdú, we absorb the first controller into a transport map and recast the problem as $J^\star=\inf_Q\{k^2W_2^2(P,Q)+\mathrm{mmse}(Q)\}$, which trades a quadratic Wasserstein transport cost against a minimum mean-square estimation error. The optimal first controller is the monotone rearrangement that pushes the prior $P$ to a minimizer $Q^\star$. We establish the existence and absolute continuity of minimizers, derive an Euler--Lagrange optimality condition, and obtain a semi-closed-form Gaussian benchmark with an explicit second-variation stability threshold. We then show that restricting to finitely supported laws yields an MMSE-regularized optimal quantizer: its optimal values decrease to $J^\star$, its weak limit points are minimizers of the continuous problem, and its stationarity conditions pair centroid levels with power cells, recovering Lloyd--Max quantization as control becomes expensive. This structure leads to an estimation-aware Lloyd algorithm with signalling-based initialization. As $k\to\infty$, the optimal controllers converge to the classical affine pair; as $k\to0$, $J^\star(k)=\sigma^2k^2+o(k^2)$ and the optimal laws collapse onto $\delta_0$, so signalling constellations are a moderate-$k$ phenomenon. Numerical experiments corroborate the theory, and the framework extends to the vector counterexample, where the finite-level program becomes an MMSE-regularized vector quantizer.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-17 in math.OC).
Categorie arXiv: Optimization and Control (math.OC) ; Systems and Control (eess.SY).
Pagina del lavoro: https://arxiv.org/abs/2609.18992 — 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-10-15T15:08:22.607Z dalla pagina https://arxiv.org/catchup/math.OC/2026-09-17?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).