Sparse model selection in the highly under-sampled regime

03/03/2016
by   Nicola Bulso, et al.
0

We propose a method for recovering the structure of a sparse undirected graphical model when very few samples are available. The method decides about the presence or absence of bonds between pairs of variable by considering one pair at a time and using a closed form formula, analytically derived by calculating the posterior probability for every possible model explaining a two body system using Jeffreys prior. The approach does not rely on the optimisation of any cost functions and consequently is much faster than existing algorithms. Despite this time and computational advantage, numerical results show that for several sparse topologies the algorithm is comparable to the best existing algorithms, and is more accurate in the presence of hidden variables. We apply this approach to the analysis of US stock market data and to neural data, in order to show its efficiency in recovering robust statistical dependencies in real data with non stationary correlations in time and space.

READ FULL TEXT

page 14

page 15

page 16

page 28

page 36

research
01/17/2017

On the Sample Complexity of Graphical Model Selection for Non-Stationary Processes

We formulate and analyze a graphical model selection method for inferrin...
research
04/17/2013

A Junction Tree Framework for Undirected Graphical Model Selection

An undirected graphical model is a joint probability distribution define...
research
02/19/2011

Sparse Signal Recovery with Temporally Correlated Source Vectors Using Sparse Bayesian Learning

We address the sparse signal recovery problem in the context of multiple...
research
09/12/2018

Bayesian sparse reconstruction: a brute-force approach to astronomical imaging and machine learning

We present a principled Bayesian framework for signal reconstruction, in...
research
11/07/2022

Sparse Horseshoe Estimation via Expectation-Maximisation

The horseshoe prior is known to possess many desirable properties for Ba...
research
07/16/2021

Efficient proximal gradient algorithms for joint graphical lasso

We consider learning an undirected graphical model from sparse data. Whi...
research
06/04/2023

The Functional Graphical Lasso

We consider the problem of recovering conditional independence relations...

Please sign up or login with your details

Forgot password? Click here to reset