An MMSE Lower Bound via Poincar\'e Inequality
Abstract
This paper studies the minimum mean squared error (MMSE) of estimating X ∈ Rd from the noisy observation Y ∈ Rk, under the assumption that the noise (i.e., Y|X) is a member of the exponential family. The paper provides a new lower bound on the MMSE. Towards this end, an alternative representation of the MMSE is first presented, which is argued to be useful in deriving closed-form expressions for the MMSE. This new representation is then used together with the Poincar\'e inequality to provide a new lower bound on the MMSE. Unlike, for example, the Cram\'er-Rao bound, the new bound holds for all possible distributions on the input X. Moreover, the lower bound is shown to be tight in the high-noise regime for the Gaussian noise setting under the assumption that X is sub-Gaussian. Finally, several numerical examples are shown which demonstrate that the bound performs well in all noise regimes.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.