Adaptive cluster expansion for the inverse Ising problem: convergence, algorithm and tests

Abstract

We present a procedure to solve the inverse Ising problem, that is to find the interactions between a set of binary variables from the measure of their equilibrium correlations. The method consists in constructing and selecting specific clusters of variables, based on their contributions to the cross-entropy of the Ising model. Small contributions are discarded to avoid overfitting and to make the computation tractable. The properties of the cluster expansion and its performances on synthetic data are studied. To make the implementation easier we give the pseudo-code of the algorithm.

Paper submitted to Journal of Statistical Physics

References in corpus (6)

• Identification of direct residue contacts in protein-protein interaction by message passing
• High-dimensional Ising model selection using ${\ell }_1$-regularized logistic regression
• Prediction of spatio-temporal patterns of neural activity from pairwise correlations
• Small-correlation expansions for the inverse Ising problem
• Realizability of point processes
• Inverse Ising problem for one-dimensional chains with arbitrary finite-range couplings

Cited by in corpus (27)

• Inverse statistical problems: from the inverse Ising problem to data science
• Inverse Statistical Physics of Protein Sequences: A Key Issues Review
• Fast pseudolikelihood maximization for direct-coupling analysis of protein structure from many homologous amino-acid sequences
• Pseudolikelihood Decimation Algorithm Improving the Inference of the Interaction Network in a General Class of Ising Models
• Benchmarking inverse statistical approaches for protein structure and design with exactly solvable models
• Maximum entropy models reveal the excitatory and inhibitory correlation structures in cortical neuronal activity
• Approximate Inference for Time-varying Interactions and Macroscopic Dynamics of Neural Populations
• On the entropy of protein families
• Inference of compressed Potts graphical models
• Statistical Physics and Representations in Real and Artificial Neural Networks
• Direct Coupling Analysis of Epistasis in Allosteric Materials
• Solving the inverse Ising problem by mean-field methods in a clustered phase space with many states
• Adaptive Thouless-Anderson-Palmer approach to inverse Ising problems with quenched random fields
• Regularization and decimation pseudolikelihood approaches to statistical inference in $XY$-spin models
• Clustering of neural codewords revealed by a first-order phase transition
• Resummed mean-field inference for strongly coupled data
• Stochastic gradient method with accelerated stochastic dynamics
• Translation invariant realizability problem on the $d-$dimensional lattice: an explicit construction
• Beyond inverse Ising model: structure of the analytical solution for a class of inverse problems
• Theory of population coupling and applications to describe high order correlations in large populations of interacting neurons
• Sparse Hopfield network reconstruction with ${\ell }_1$ regularization
• A Density Consistency approach to the inverse Ising problem
• Cycle-based Cluster Variational Method for Direct and Inverse Inference
• Using Latent Binary Variables for Online Reconstruction of Large Scale Systems
• On the typical properties of inverse problems in statistical mechanics
• Prediction of Structures and Interactions from Genome Information
• Adaptive Cluster Expansion for Ising spin models