All Topics
All Topics
Technology
Technology
AI
AI
Business
Business
Entertainment
Entertainment
News
News
Programming
Programming
Science
Science
Design
Design
Environment
Environment
Finance
Finance
Crypto
Crypto
Politics
Politics
Sports
Sports
Education
Education
Gaming
Gaming
Art
Art
Music
Music
Health
Health
Security
Security
Books
Books
Food
Food
Travel
Travel
Personal
Personal
Bluesky
Twitter

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

1mo ago

Source

IEEESparse Bayesian Learning Algorithms Revisited: From Learning Majorizers to Structured Algorithmic Learning Using Neural Networksieee.org
Snippet from the RSS feed
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.

You might also wanna read

Geometric and Stochastic Analysis of Discontinuities in Sparse Mixture-of-Experts Architectures

This paper provides a rigorous geometric and stochastic analysis of discontinuities in Sparse Mixture-of-Experts (SMoE) architectures, which

arxiv.org·18d ago

uGMM-NN: Neural Network Architecture with Gaussian Mixture Model Neurons for Probabilistic Reasoning

This research paper introduces uGMM-NN (Univariate Gaussian Mixture Model Neural Network), a novel neural architecture that embeds probabili

arxiv.org·10mo ago

SparseLoCo: Communication-Efficient LLM Training with Extreme Compression via Sparsification and Quantization

SparseLoCo is a new communication-efficient training algorithm for Large Language Models (LLMs) that combines Top-k sparsification and quant

arxiv.org·10mo ago

Emergent Hebbian Dynamics in Regularized Learning: A Theoretical Analysis

This research paper investigates whether observed Hebbian/anti-Hebbian plasticity in synaptic updates necessarily implies an underlying Hebb

arxiv.org·1mo ago

Variational Autoencoder Framework Enables Task-Specific Quantum Embeddings of Classical Data

This paper introduces a variational autoencoder framework for quantum machine learning that learns task-specific quantum embeddings of class

arxiv.org·12d ago

Study Reveals How RL and SFT Differently Teach Transformers Chain-of-Thought Reasoning on Sparse Boolean Functions

This research paper analyzes how transformers learn Chain-of-Thought (CoT) reasoning capabilities through Reinforcement Learning (RL) with p

arxiv.org·1mo ago

Comments

Sign in to join the conversation.

No comments yet. Be the first.