Dynamics and Performance of Susceptibility Propagation on Synthetic Data
arXiv:1005.3694 · doi:10.1140/epjb/e2010-00277-0
Abstract
We study the performance and convergence properties of the Susceptibility Propagation (SusP) algorithm for solving the Inverse Ising problem. We first study how the temperature parameter (T) in a Sherrington-Kirkpatrick model generating the data influences the performance and convergence of the algorithm. We find that at the high temperature regime (T>4), the algorithm performs well and its quality is only limited by the quality of the supplied data. In the low temperature regime (T<4), we find that the algorithm typically does not converge, yielding diverging values for the couplings. However, we show that by stopping the algorithm at the right time before divergence becomes serious, good reconstruction can be achieved down to T~2. We then show that dense connectivity, loopiness of the connectivity, and high absolute magnetization all have deteriorating effects on the performance of the algorithm. When absolute magnetization is high, we show that other methods can be work better than SusP. Finally, we show that for neural data with high absolute magnetization, SusP performs less well than TAP inversion.
9 pages, 7 figures
References in corpus (8)
- Weak pairwise correlations imply strongly correlated network states in a neural population
- Identification of direct residue contacts in protein-protein interaction by message passing
- High-dimensional Ising model selection using -regularized logistic regression
- The Ising Model for Neural Data: Model Quality and Approximate Methods for Extracting Functional Connectivity
- Pairwise maximum entropy models for studying large biological systems: when they can and when they can't work
- Statistical physics of pairwise probability models
- Small-correlation expansions for the inverse Ising problem
- Intrinsic limitations of inverse inference in the pairwise Ising spin glass
Cited by in corpus (10)
- Inverse statistical problems: from the inverse Ising problem to data science
- Inverse Ising inference using all the data
- The Bethe approximation for solving the inverse Ising problem: a comparison with other inference methods
- Network inference using asynchronously updated kinetic Ising Model
- Region graph partition function expansion and approximate free energy landscapes: Theory and some numerical results
- Belief-Propagation and replicas for inference and learning in a kinetic Ising model with hidden spins
- Inference and learning in sparse systems with multiple states
- Effect of coupling asymmetry on mean-field solutions of direct and inverse Sherrington-Kirkpatrick model
- Beyond inverse Ising model: structure of the analytical solution for a class of inverse problems
- State sampling dependence of the Hopfield network inference