EUVIMEDEUVIMED entdecken
Crossref

Sparse Bayesian Learning Algorithms Revisited: From Learning Majorizers to Structured Algorithmic Learning Using Neural Networks

Rushabha Balaji, Kuan-Lin Chen, Danijela Cabric, Bhaskar D. Rao

IEEE Transactions on Signal Processing · 2026 · 74 · 2476-2490

DOI: 10.1109/tsp.2026.3699618 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Transactions on Signal Processing, 2026. Verfasst von Rushabha Balaji und 3 weiteren Autor:innen. Die Arbeit nennt 48 Literaturangaben. Gefördert von: NSF, National Science Foundation.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Sparse Bayesian Learning (SBL) is one of the most popular sparse signal recovery methods, and various algorithms exist under the SBL paradigm. However, given a performance metric and a sparse recovery problem, it is difficult to know a-priori the best algorithm to choose. This difficulty is in part due to a lack of a unified framework to derive SBL algorithms. In this work, we address this issue by first showing that the most popular SBL algorithms can be derived using the majorization-minimization (MM) principle. Hence, providing convergence guarantees to this class of SBL methods hitherto unknown. Moreover, we show that the two most popular SBL update rules not only fall under the MM framework but are both valid descent steps for a common majorizer, revealing a deeper analytical compatibility between these algorithms. Using this insight and properties from MM theory we expand the class of SBL algorithms, and address the question of finding the best SBL algorithm via data within the MM framework. Second, we go beyond the MM framework by introducing the powerful modeling capabilities of deep learning to further expand the class of SBL algorithms, and aim to learn a superior SBL update rule from data. We propose a novel deep learning architecture that can outperform the classical MM based ones across different sparse recovery problems. Our architecture is designed such that its complexity does not scale with the dimension of the measurement matrix, and hence provides us with a unique opportunity to test the generalization capability across different measurement matrices. In the case of parameterized dictionaries, the invariance to the size of the matrix allows us to train and test the model across different ranges of the parameter. We also showcase our models ability to learn a functional mapping by its zero-shot performance on unseen measurement matrices. Finally, we test our model performance across different number of snapshots, signal-to-noise ratios and sparsity levels.

Förderung

  • NSF
  • National Science Foundation

Zitieren

APA

Balaji, R., Chen, K., Cabric, D., & Rao, B. D. (2026). Sparse Bayesian Learning Algorithms Revisited: From Learning Majorizers to Structured Algorithmic Learning Using Neural Networks. IEEE Transactions on Signal Processing, 74, 2476-2490. https://doi.org/10.1109/tsp.2026.3699618

Vancouver

Balaji R, Chen K, Cabric D, Rao BD. Sparse Bayesian Learning Algorithms Revisited: From Learning Majorizers to Structured Algorithmic Learning Using Neural Networks. IEEE Transactions on Signal Processing. 2026;74:2476-2490. doi:10.1109/tsp.2026.3699618

BibTeX
@article{Balaji2026,
  author = {Balaji, Rushabha and Chen, Kuan-Lin and Cabric, Danijela and Rao, Bhaskar D.},
  title = {Sparse Bayesian Learning Algorithms Revisited: From Learning Majorizers to Structured Algorithmic Learning Using Neural Networks},
  journal = {IEEE Transactions on Signal Processing},
  year = {2026},
  volume = {74},
  pages = {2476--2490},
  doi = {10.1109/tsp.2026.3699618}
}
Kostenlos starten →