Skip to Main content Skip to Navigation
Conference papers

Generalized Swept Approximate Message Passing based Kalman Filtering for Dynamic Sparse Bayesian Learning

Abstract : Sparse Bayesian Learning (SBL), initially proposed in the Machine Learning (ML) literature, is an efficient and well-studied framework for sparse signal recovery. SBL uses hierarchical Bayes with a decorrelated Gaussian prior in which the variance profile is also to be estimated. This is more sparsity inducing than e.g. a Laplacian prior. However, SBL does not scale with problem dimensions due to the computational complexity associated with the matrix inversion in Linear Mimimum Mean Squared Error (LMMSE) estimation. To address this issue, various low complexity approximate Bayesian inference techniques have been introduced for the LMMSE component, including Variational Bayesian (VB) inference, Space Alternating Variational Estimation (SAVE) or Message Passing (MP) algorithms such as Belief Propagation (BP) or Expectation Propagation (EP) or Approximate MP (AMP). These algorithms may converge to the correct LMMSE estimate. However, in ML we are often also interested in having posterior variance information. We observed that SBL via SAVE provides (largely) underestimated variance estimates. AMP style algorithms may provide more accurate variance information (per component) as we have shown recently. However, one practical issue associated with most AMP versions is that they may diverge even if for a slight deviation from i.i.d Gaussian or right orthogonally invariant measurement matrices. To this end we extend here the more robust Swept AMP (SwAMP) algorithm to Generalized SwAMP (GSwAMP), which handles independent but non-i.i.d. priors and to the case of dynamic SBL. The simulations illustrate the desirable convergence behavior of the proposed GSwAMP-SBL under different scenarios on the measurement matrix.
Document type :
Conference papers
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-03579050
Contributor : Centre De Documentation Eurecom Connect in order to contact the contributor
Submitted on : Thursday, February 17, 2022 - 5:31:57 PM
Last modification on : Monday, February 28, 2022 - 8:15:49 AM
Long-term archiving on: : Wednesday, May 18, 2022 - 7:36:40 PM

File

publi-6280.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Christo Kurisummoottil Thomas, Dirk Slock. Generalized Swept Approximate Message Passing based Kalman Filtering for Dynamic Sparse Bayesian Learning. 2020 28th European Signal Processing Conference (EUSIPCO), Jan 2021, Amsterdam, Netherlands. pp.2065-2069, ⟨10.23919/Eusipco47968.2020.9287708⟩. ⟨hal-03579050⟩

Share

Metrics

Record views

22

Files downloads

5