A Deterministic Annealing Approach to Witsenhausen's Counterexample
Preprint
Abstract
This paper proposes a numerical method, based on information theoretic ideas, to a class of distributed control problems. As a particular test case, the well-known and numerically "over-mined" problem of decentralized control and implicit communication, commonly referred to as Witsenhausen's counterexample, is considered. The method provides a small improvement over the best numerical result so far for this benchmark problem. The key idea is to randomize the zero-delay mappings. which become "soft", probabilistic mappings to be optimized in a deterministic annealing process, by incorporating a Shannon entropy constraint in the problem formulation. The entropy of the mapping is controlled and gradually lowered to zero to obtain deterministic mappings, while avoiding poor local minima. Proposed method obtains new mappings that shed light on the structure of the optimal solution, as well as achieving a small improvement in total cost over the state of the art in numerical approaches to this problem.Keywords
All Related Versions
This publication has 9 references indexed in Scilit:
- Approximately Optimal Solutions to the Finite-Dimensional Witsenhausen CounterexampleIEEE Transactions on Automatic Control, 2013
- Numerical solutions to the Witsenhausen counterexample by approximating networksIEEE Transactions on Automatic Control, 2001
- The Witsenhausen counterexample: a hierarchical search approach for nonconvex optimization problemsIEEE Transactions on Automatic Control, 2001
- An ordinal optimization approach to optimal control problemsAutomatica, 1999
- Robust vector quantizer design by noisy channel relaxationIEEE Transactions on Communications, 1999
- Deterministic annealing for clustering, compression, classification, regression, and related optimization problemsProceedings of the IEEE, 1998
- A mapping approach to rate-distortion computation and analysisIEEE Transactions on Information Theory, 1994
- Stochastic teams with nonclassical information revisited: When is an affine law optimal?IEEE Transactions on Automatic Control, 1987
- A Counterexample in Stochastic Optimum ControlSIAM Journal on Control, 1968