2 problems

Let $M>2$ and let $N$ be the number of channels. For a problem instance $(M,N,\boldsymbol\mu)$, consider all possible permutations of arms in the set $\mathcal{S}(M)$ and the round…

Sparse estimation tradeoff conjecture. If some protocol estimates the mean for any distribution $P\in\mathcal{P}_s$ with mean-squared loss $R$ and communication cost $C$, then