Sparse model selection in the highly under-sampled regime

Abstract

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.

arXiv comment54 pages, 26 figures

References in corpus (15)

• Improved contact prediction in proteins: Using pseudolikelihoods to infer Potts models
• High-dimensional Ising model selection using ${\ell }_1$-regularized logistic regression
• The Ising Model for Neural Data: Model Quality and Approximate Methods for Extracting Functional Connectivity
• Inverse Ising inference using all the data
• Adaptive Cluster Expansion for Inferring Boltzmann Machines with Noisy Data
• Mean Field Theory For Non-Equilibrium Network Reconstruction
• High-dimensional structure estimation in Ising models: Local separation criterion
• The Bethe approximation for solving the inverse Ising problem: a comparison with other inference methods
• Correlations and functional connections in a population of grid cells
• Pseudolikelihood Decimation Algorithm Improving the Inference of the Interaction Network in a General Class of Ising Models
• Efficient Markov Network Structure Discovery Using Independence Tests
• Learning and inference in a nonequilibrium Ising model with hidden nodes
• A Geometric Formulation of Occam's Razor for Inference of Parametric Distributions
• Inferring Synaptic Structure in presence of Neural Interaction Time Scales
• Belief-Propagation and replicas for inference and learning in a kinetic Ising model with hidden spins

Cited by in corpus (4)

• Inverse statistical problems: from the inverse Ising problem to data science
• The Stochastic complexity of spin models: Are pairwise models really simple?
• Inferring Local Structure from Pairwise Correlations
• On the complexity of logistic regression models