Revisiting CHAMPAGNE: Sparse Bayesian Learning as Reweighted Sparse Coding

TL;DR

This paper reinterprets the CHAMPAGNE algorithm within Sparse Bayesian Learning as a reweighted sparse coding problem, leading to a more efficient algorithm that performs well in low SNR scenarios and improves sparse solution recovery.

Contribution

It establishes a connection between SBL and reweighted sparse coding, providing a new interpretation and an efficient iterative algorithm for sparse recovery.

Findings

Reformulation as reweighted $oldsymbol{ ext{l}}_{21}$-minimization.

Simplification to weighted $oldsymbol{ ext{l}}_{21}$-regularized least squares in low SNR.

Improved computational efficiency and exact sparse solutions in MEG source localization.

Abstract

This paper revisits the CHAMPAGNE algorithm within the Sparse Bayesian Learning (SBL) framework and establishes its connection to reweighted sparse coding. We demonstrate that the SBL objective can be reformulated as a reweighted $\ell_{21}$-minimization problem, providing a more straightforward interpretation of the sparsity mechanism and enabling the design of an efficient iterative algorithm. Additionally, we analyze the behavior of this reformulation in the low signal-to-noise ratio (SNR) regime, showing that it simplifies to a weighted $\ell_{21}$-regularized least squares problem. Numerical experiments validate the proposed approach, highlighting its improved computational efficiency and ability to produce exact sparse solutions, particularly in simulated MEG source localization tasks.