Revisiting CHAMPAGNE: Sparse Bayesian Learning as Reweighted Sparse Coding
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.
Code (0)
등록된 구현이 없습니다.
Tasks
Computational EfficiencySimilar Papers 제목 키워드 기반
Adaptive support driven Bayesian reweighted algorithm for sparse signal recovery
Sparse learning has been widely studied to capture critical information from enormous data sources in the filed of system identification. Often, it is essential to understand internal working mechanisms of unknown system…
feature selectionSparse LearningType I and Type II Bayesian Methods for Sparse Signal Recovery using Scale Mixtures
In this paper, we propose a generalized scale mixture family of distributions, namely the Power Exponential Scale Mixture (PESM) family, to model the sparsity inducing priors currently in use for sparse signal recovery (…
Vocal Bursts Type PredictionBayesian Linear Regression with Cauchy Prior and Its Application in Sparse MIMO Radar
In this paper, a sparse signal recovery algorithm using Bayesian linear regression with Cauchy prior (BLRC) is proposed. Utilizing an approximate expectation maximization(AEM) scheme, a systematic hyper-parameter updatin…
regressionSingle Particle AnalysisSparse Estimation Using General Likelihoods and Non-Factorial Priors
Finding maximally sparse representations from overcomplete feature dictionaries frequently involves minimizing a cost function composed of a likelihood (or data fit) term and a prior (or penalty function) that favors spa…
feature selectionGeneral ClassificationNonconvex and Nonsmooth Sparse Optimization via Adaptively Iterative Reweighted Methods
We propose a general formulation of nonconvex and nonsmooth sparse optimization problems with convex set constraint, which can take into account most existing types of nonconvex sparsity-inducing terms, bringing strong a…