Some facts about the optimality of the LSE in the Gaussian sequence model with convex constraint

We consider a convex constrained Gaussian sequence model and characterize necessary and sufficient conditions for the least squares estimator (LSE) to be minimax optimal. For a closed convex set K ⊂ Rⁿ we observe Y = μ + ξ for ξ ~ N(0,σ²I_n) and μ ∈ K and aim to estimate μ. We characterize the worst case risk of the LSE in multiple ways by analyzing the behavior of the local Gaussian width on K. We demonstrate that optimality is equivalent to a Lipschitz property of the local Gaussian width mapping. We also provide theoretical algorithms that search for the worst case risk. We then provide examples showing optimality or suboptimality of the LSE on various sets, including ℓ_p balls for p ∈ [1,2], pyramids, solids of revolution, and multivariate isotonic regression, among others.