Abstract
A general class of Bayesian lower bounds when the underlying loss function is a Bregman divergence is demonstrated. This class can be considered as an extension of the Weinstein-Weiss family of bounds for the mean squared error and relies on finding a variational characterization of Bayesian risk. This approach allows for the derivation of a version of the Cramér-Rao bound that is specific to a given Bregman divergence. This new generalization of the Cramér-Rao bound reduces to the classical one when the loss function is taken to be the Euclidean norm. In order to evaluate the effectiveness of the new lower bounds, the paper also develops upper bounds on Bayesian risk, which are based on optimal linear estimators. The effectiveness of the new bound is evaluated in the Poisson noise setting.
Original language | English (US) |
---|---|
Pages (from-to) | 1985-2000 |
Number of pages | 16 |
Journal | IEEE Transactions on Information Theory |
Volume | 68 |
Issue number | 3 |
DOIs | |
State | Published - Mar 1 2022 |
Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Information Systems
- Computer Science Applications
- Library and Information Sciences
Keywords
- Bregman divergence
- Cramér-Rao
- Gaussian Noise
- Linear estimation
- Poisson noise
- minimum mean squared error (MMSE)