SearcharxivSearch

arXiv · 2509.02381

Low-Power Optimal Strategy for Witsenhausen Counterexample

Abstract

We discuss the Witsenhausen counterexample from the perspective of varying power budgets and propose a low-power estimation (LoPE) strategy. Specifically, our LoPE approach designs the first decision-maker (DM) a quantization step function of the Gaussian source state, making the target system state a piecewise linear function of the source with slope one. This approach contrasts with Witsenhausen's original two-point strategy, which instead designs the system state itself to be a binary step. While the two-point strategy can outperform the linear strategy in estimation cost, it, along with its multi-step extensions, typically requires a substantial power budget. Analogous to Binary Phase Shift Keying (BPSK) communication for Gaussian channels, we show that the binary LoPE strategy attains first-order optimality in the low-power regime, matching the performance of the linear strategy as the power budget increases from zero. Our analysis also provides an interpretation of the previously observed near-optimal sloped step function ("sawtooth") structure to the Witsenhausen counterexample: In the low-power regime, power saving is prioritized, in which case the LoPE strategy dominates, making the system state a piecewise linear function with slope close to one. Conversely, in the high-power regime, setting the system state as a step function with the slope approaching zero facilitates accurate estimation. Hence, the sawtooth solution can be seen as a combination of both strategies.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mengyuan Zhao, Maël Le Treust, Tobias J. Oechtering. 2025-09-02. Low-Power Optimal Strategy for Witsenhausen Counterexample. https://arxiv.org/abs/2509.02381

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Deterministic and Random Bipartite Matching on General Networks: Convex Flow Reformulation, Asymptotic Properties, and Fast Algorithms

Minimum-distance bipartite matching on general networks has numerous applications various fields. This paper first focuses on deterministic problems and presents an exact edgewise-separable convex-flow reformulation. By introducing a smooth monotone rearrangement approximation of the edge-wise imbalance profiles, the convex-flow reformulation's can be solved efficiently. If we further conduct a first-order resistance-based approximation of the convex program, a one-step Laplacian-based estimator can be analytically derived in closed forms. The paper also studies random problems where supply and demand points are randomly distributed. We show that the expected optimal matching distance scales with the square root of the number of points if the supply/demand point distributions are identical, or linearly otherwise. In the former case, the optimal flow is proven to be centered, symmetric, and sub-Gaussian. In the latter case, the limiting resistance network characterizes how supply-demand imbalance is redistributed and motivates a fast algorithm that approximate the optimal flow based on the limiting resistance. Numerical experiments show that the proposed estimators closely approximate the exact matching cost while substantially reducing computation time. The proven theoretical properties of the random matching solution are numerically verified by large-scale Monte Carlo simulations.

math.OC

Conformal-DRO: Distributionally Robust Optimization with Conformalized Ambiguity Set

Data-driven distributionally robust optimization (DRO) typically treats the conditional outcome law as fixed and uses ambiguity sets to capture estimation error. This paper studies latent distributional heterogeneity, where each instance has an unobserved law but contributes only one observation, so uncertainty persists even if the mixture law is known. We propose Conformal-DRO, which uses nested conformal regions to construct an ambiguity set for the future latent law. Under exchangeability, the set covers this law with probability at least $1-\alpha$ in finite samples, without estimating underlying latent laws or their mixing mechanism. The conformal path induces a data-driven transport geometry, while $\alpha$ determines the radius. The worst-case problem reduces to a finite linear program over conformal shells and admits sparse adversarial solutions. The resulting robust value provides a finite-sample certificate for the selected decision's expected cost.

math.OC

The best approximation tuple: an extension of the Cheney-Goldstein algorithm and results to the multiple sets case

In this paper we extend the algorithm and several results published in the celebrated 1959 paper of Cheney and Goldstein about the best approximation pair (BAP) problem in two separate directions. One is the consideration of more than two sets. The other is the ability to handle each set as an intersections of a finite family of sets. We call the resulting problem the "Best Approximation Tuple (BAT) problem". The fundamental observation that leads to this generalizations is to recognize and handle one set (the "pivot set") as different from the remaining sets (the "satellite sets") instead of seeking cycles as the minimizers of a target functional. This enable us to overcome a certain theoretical obstacle related to cycles and minimizers of general functionals. We prove the convergence of the algorithm to the unique solution of the problem in the Euclidean case with strictly convex and compact satellite sets. Because of the lack of Fej\'er monotonicity, our convergence analysis is not standard, and is based on almost unknown properties of orthogonal projections regarding equality and inequality in the definition of nonexpansiveness.

math.OC