An MMSE Lower Bound via Poincar\'e Inequality
Abstract
This paper studies the minimum mean squared error (MMSE) of estimating from the noisy observation , under the assumption that the noise (i.e., ) 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\'{e}r-Rao bound, the new bound holds for all possible distributions on the input . Moreover, the lower bound is shown to be tight in the high-noise regime for the Gaussian noise setting under the assumption that is sub-Gaussian. Finally, several numerical examples are shown which demonstrate that the bound performs well in all noise regimes.
Keywords
Cite
@article{arxiv.2205.05848,
title = {An MMSE Lower Bound via Poincar\'e Inequality},
author = {Ian Zieder and Alex Dytso and Martina Cardone},
journal= {arXiv preprint arXiv:2205.05848},
year = {2022}
}
Comments
To be presented at International Symposium on Information Theory (ISIT 2022)