Cramer Rao-Type Bounds for Sparse Bayesian Learning
Ranjitha Prasad, Chandra R. Murthy

TL;DR
This paper derives new Cramér-Rao bounds for sparse Bayesian learning with compressible vectors, providing insights into the fundamental limits of estimation accuracy and comparing these bounds with practical algorithms.
Contribution
It introduces hybrid, Bayesian, and marginalized CRBs for SBL with compressible priors, extending bounds to general distributions and demonstrating their tightness through simulations.
Findings
MCRB is the tightest bound among those derived.
The MSE of the EM algorithm matches the MCRB for compressible vectors.
Estimation performance depends on the vector's compressibility and number of observations.
Abstract
In this paper, we derive Hybrid, Bayesian and Marginalized Cram\'{e}r-Rao lower bounds (HCRB, BCRB and MCRB) for the single and multiple measurement vector Sparse Bayesian Learning (SBL) problem of estimating compressible vectors and their prior distribution parameters. We assume the unknown vector to be drawn from a compressible Student-t prior distribution. We derive CRBs that encompass the deterministic or random nature of the unknown parameters of the prior distribution and the regression noise variance. We extend the MCRB to the case where the compressible vector is distributed according to a general compressible prior distribution, of which the generalized Pareto distribution is a special case. We use the derived bounds to uncover the relationship between the compressibility and Mean Square Error (MSE) in the estimates. Further, we illustrate the tightness and utility of the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
