TR2018-076

Misspecified Bayesian Cramer-Rao Bound for Sparse Bayesian Learning


    •  Pajovic, M., "Misspecified Bayesian Cramer-Rao Bound for Sparse Bayesian Learning", IEEE Statistical Signal Processing Workshop (SSP), DOI: 10.1109/SSP.2018.8450780, June, pp. 263-267.
      BibTeX TR2018-076 PDF
      • @inproceedings{Pajovic2018jun,
      • author = {Pajovic, Milutin},
      • title = {Misspecified Bayesian Cramer-Rao Bound for Sparse Bayesian Learning},
      • booktitle = {IEEE Statistical Signal Processing Workshop (SSP)},
      • year = 2018,
      • pages = {263--267},
      • month = jun,
      • doi = {10.1109/SSP.2018.8450780},
      • url = {https://www.merl.com/publications/TR2018-076}
      • }
  • Research Areas:

    Communications, Signal Processing

We consider a misspecified Bayesian Cramer-Rao bound (MBCRB), justified in a scenario where the assumed data model is different from the true generative model. As an example of this scenario, we study a popular sparse Bayesian learning (SBL) algorithm where the assumed data model, different from the true model, is constructed so as to facilitate a computationally feasible inference of a sparse signal within the Bayesian framework. Formulating the SBL as a Bayesian inference with a misspecified data model, we derive a lower bound on the mean square error (MSE) corresponding to the estimated sparse signal. The simulation study validates the derived bound and shows that the SBL performance approaches the MBCRB at very high signal-to-noise ratios.