An MMSE Lower Bound via PoincarΓ© Inequality

05/12/2022
βˆ™
by   Ian Zieder, et al.
βˆ™
0
βˆ™

This paper studies the minimum mean squared error (MMSE) of estimating π—βˆˆβ„^d from the noisy observation π˜βˆˆβ„^k, 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Γ© inequality to provide a new lower bound on the MMSE. Unlike, for example, the CramΓ©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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset
Success!
Error Icon An error occurred

Sign in with Google

×

Use your Google Account to sign in to DeepAI

×
Pro

Consider DeepAI Pro