A hierarchical Bayesian perspective on majorization-minimization for non-convex sparse regression: application to M/EEG source imaging

10/24/2017
by   Yousra Bekhti, et al.
0

Majorization-minimization (MM) is a standard iterative optimization technique which consists in minimizing a sequence of convex surrogate functionals. MM approaches have been particularly successful to tackle inverse problems and statistical machine learning problems where the regularization term is a sparsity-promoting concave function. However, due to non-convexity, the solution found by MM depends on its initialization. Uniform initialization is the most natural and often employed strategy as it boils down to penalizing all coefficients equally in the first MM iteration. Yet, this arbitrary choice can lead to unsatisfactory results in severely under-determined inverse problems such as source imaging with magneto- and electro-encephalography (M/EEG). The framework of hierarchical Bayesian modeling (HBM) is a seemingly unrelated approach to encode sparsity. This work shows that for certain hierarchical models, a simple alternating scheme to compute fully Bayesian MAP estimates leads to the exact same sequence of updates as a standard MM strategy (cf. the Adaptive Lasso). With this parallel outlined, we show how to improve upon these MM techniques by probing the multimodal posterior density using Markov Chain Monte-Carlo (MCMC) techniques. Firstly, we show that these samples can provide well-informed initializations that help MM schemes to reach better local minima. Secondly, we demonstrate how it can reveal the different modes of the posterior distribution in order to explore and quantify the inherent uncertainty and ambiguity of such ill-posed inference procedure. In the context of M/EEG, each mode corresponds to a plausible configuration of neural sources, which is crucial for data interpretation, especially in clinical contexts. Results on both simulation and real dataset show how the approach allows assessing the impact on uncertainties of the number or the type of sensors.

READ FULL TEXT

page 12

page 13

page 14

page 15

research
06/25/2015

Generalized Majorization-Minimization

Non-convex optimization is ubiquitous in machine learning. The Majorizat...
research
10/22/2021

Variational Bayesian Approximation of Inverse Problems using Sparse Precision Matrices

Inverse problems involving partial differential equations (PDEs) are wid...
research
06/30/2023

Proximal Langevin Sampling With Inexact Proximal Mapping

In order to solve tasks like uncertainty quantification or hypothesis te...
research
06/27/2023

Sparse wavelet-based solutions for the M/EEG inverse problem

This paper is concerned with variational and Bayesian approaches to neur...
research
11/05/2019

Penalized least squares and sign constraints with modified Newton-Raphson algorithms: application to EEG source imaging

We propose a modified Newton-Raphson (MNR) algorithm to estimate multipl...
research
08/25/2020

Unification of Sparse Bayesian Learning Algorithms for Electromagnetic Brain Imaging with the Majorization Minimization Framework

Methods for electro- or magnetoencephalography (EEG/MEG) based brain sou...

Please sign up or login with your details

Forgot password? Click here to reset