Inference of the sparse kinetic Ising model using the decimation method
arXiv:1502.01660 · doi:10.1103/PhysRevE.91.052136
Abstract
In this paper we study the inference of the kinetic Ising model on sparse graphs by the decimation method. The decimation method, which was first proposed in [Phys. Rev. Lett. 112, 070603] for the static inverse Ising problem, tries to recover the topology of the inferred system by setting the weakest couplings to zero iteratively. During the decimation process the likelihood function is maximized over the remaining couplings. Unlike the -optimization based methods, the decimation method does not use the Laplace distribution as a heuristic choice of prior to select a sparse solution. In our case, the whole process can be done automatically without fixing any parameters by hand. We show that in the dynamical inference problem, where the task is to reconstruct the couplings of an Ising model given the data, the decimation process can be applied naturally into a maximum-likelihood optimization algorithm, as opposed to the static case where pseudo-likelihood method needs to be adopted. We also use extensive numerical studies to validate the accuracy of our methods in dynamical inference problems. Our results illustrate that on various topologies and with different distribution of couplings, the decimation method outperforms the widely-used -optimization based methods.
arXiv comment11 pages, 5 figures
References in corpus (20)
- Community detection in graphs
- Weak pairwise correlations imply strongly correlated network states in a neural population
- Identification of direct residue contacts in protein-protein interaction by message passing
- Statistical mechanics for natural flocks of birds
- Improved contact prediction in proteins: Using pseudolikelihoods to infer Potts models
- High-dimensional Ising model selection using -regularized logistic regression
- Searching for collective behavior in a network of real neurons
- Statistical physics-based reconstruction in compressed sensing
- 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
- The Bethe approximation for solving the inverse Ising problem: a comparison with other inference methods
- On the cavity method for decimated random constraint satisfaction problems and the analysis of belief propagation guided decimation algorithms
- Pseudolikelihood Decimation Algorithm Improving the Inference of the Interaction Network in a General Class of Ising Models
- Mean-field theory for the inverse Ising problem at low temperatures
- Bethe-Peierls approximation and the inverse Ising model
- Inference of kinetic Ising model on sparse graphs
- Detection of cheating by decimation algorithm
- Effect of coupling asymmetry on mean-field solutions of direct and inverse Sherrington-Kirkpatrick model
- Non-adaptive pooling strategies for detection of rare faulty items
Cited by in corpus (6)
- Inference of the Kinetic Ising Model with Heterogeneous Missing Data
- On the equivalence between the Kinetic Ising Model and discrete autoregressive processes
- Inference of stochastic time series with missing data
- Unveiling the relation between herding and liquidity with trader lead-lag networks
- Exponential Reduction in Sample Complexity with Learning of Ising Model Dynamics
- Data quality for the inverse Ising problem