Covariance-Free Sparse Bayesian Learning
arXiv:2105.10439 · doi:10.1109/TSP.2022.3186185
Abstract
Sparse Bayesian learning (SBL) is a powerful framework for tackling the sparse coding problem while also providing uncertainty quantification. The most popular inference algorithms for SBL exhibit prohibitively large computational costs for high-dimensional problems due to the need to maintain a large covariance matrix. To resolve this issue, we introduce a new method for accelerating SBL inference -- named covariance-free expectation maximization (CoFEM) -- that avoids explicit computation of the covariance matrix. CoFEM solves multiple linear systems to obtain unbiased estimates of the posterior statistics needed by SBL. This is accomplished by exploiting innovations from numerical linear algebra such as preconditioned conjugate gradient and a little-known diagonal estimation rule. For a large class of compressed sensing matrices, we provide theoretical justifications for why our method scales well in high-dimensional settings. Through simulations, we show that CoFEM can be up to thousands of times faster than existing baselines without sacrificing coding accuracy. Through applications to calcium imaging deconvolution and multi-contrast MRI reconstruction, we show that CoFEM enables SBL to tractably tackle high-dimensional sparse coding problems of practical interest.
arXiv comment13 pages
References in corpus (10)
- Sparse Signal Recovery with Temporally Correlated Source Vectors Using Sparse Bayesian Learning
- Fast Online Deconvolution of Calcium Imaging Data
- Fast non-negative deconvolution for spike train inference from population calcium imaging
- Variational Relevance Vector Machines
- Compressed Sensing for Energy-Efficient Wireless Telemonitoring of Noninvasive Fetal ECG via Block Sparse Bayesian Learning
- Multi Snapshot Sparse Bayesian Learning for DOA Estimation
- Off-Grid DOA Estimation Using Sparse Bayesian Learning in MIMO Radar With Unknown Mutual Coupling
- A GAMP Based Low Complexity Sparse Bayesian Learning Algorithm
- Two-Dimensional Pattern-Coupled Sparse Bayesian Learning via Generalized Approximate Message Passing
- A Bayesian Framework for Sparse Representation-Based 3D Human Pose Estimation