8 problems

Let $n^*$ denote the classical sample complexity of simple binary hypothesis testing, let $n^*_{\mathrm{id}}$ denote the sample complexity when each channel has an output alphabet…

Deterministic-maximizer conjecture. For all $\alpha,\lambda\in\mathbb{R}_+$, the vectors $\mathbf{a}_\alpha^*$ and $\mathbf{b}_\alpha^*$ that maximize…

Finite-ratio single-channel conjecture. When $\alpha$ does not take extreme values, using one channel for the training sequence and another, possibly the same, channel for the sour…

Let $n$ be the number of nodes and $m$ the number of edges in a sensor network. Consider BQ-CADMM with the decreasing parameter strategy, applied to the Gaussian example, where eac…

Gaussian threshold conjecture. Choosing $\eta_i=x_\mathrm{L}$ makes the inequality

Let $(P_{d}^{k*},P_{fa}^{k*})$ denote the optimal operating point for nodes in a tree network, and let $D(\phi)$ be the Kullback–Leibler divergence when there are no Byzantine node…

PSPC Gaussian error-exponent conjecture. When $n_i$ are Gaussian,

Centralized performance conjecture. Even under the centralized setup, Lebesgue sampling delivers better performance than canonical deterministic sampling.