Adaptive Thouless-Anderson-Palmer approach to inverse Ising problems with quenched random fields
arXiv:1303.2810 · doi:10.1103/PhysRevE.87.062129
Abstract
The adaptive Thouless-Anderson-Palmer equation is derived for inverse Ising problems in the presence of quenched random fields. We test the proposed scheme on Sherrington-Kirkpatrick, Hopfield, and random orthogonal models and find that the adaptive Thouless-Anderson-Palmer approach allows surprisingly accurate inference of quenched random fields whose distribution can be either Gaussian or bimodal, compared with other existing mean-field methods.
arXiv comment9 pages, 4 figures, extensively revised
References in corpus (18)
- Weak pairwise correlations imply strongly correlated network states in a neural population
- Identification of direct residue contacts in protein-protein interaction by message passing
- The Bethe lattice spin glass revisited
- Are biological systems poised at criticality?
- The Ising Model for Neural Data: Model Quality and Approximate Methods for Extracting Functional Connectivity
- Adaptive Cluster Expansion for Inferring Boltzmann Machines with Noisy Data
- Small-correlation expansions for the inverse Ising problem
- Mean-Field Equations for Spin Models with Orthogonal Interaction Matrices
- Tractable approximations for probabilistic models: The adaptive TAP mean field approach
- Adaptive cluster expansion for the inverse Ising problem: convergence, algorithm and tests
- The Bethe approximation for solving the inverse Ising problem: a comparison with other inference methods
- On the criticality of inferred models
- Bethe-Peierls approximation and the inverse Ising model
- The role of the interaction matrix in mean-field spin glasses
- Perceptron capacity revisited: classification ability for correlated patterns
- Susceptibility Propagation by Using Diagonal Consistency
- A mean field method with correlations determined by linear response
- Counting solutions from finite samplings
Cited by in corpus (9)
- High-temperature Expansions and Message Passing Algorithms
- Large Pseudo-Counts and -Norm Penalties Are Necessary for the Mean-Field Inference of Ising and Potts Models
- Mechanisms of dimensionality reduction and decorrelation in deep neural networks
- Solving the inverse Ising problem by mean-field methods in a clustered phase space with many states
- A mean field method with correlations determined by linear response
- Effects of hidden nodes on network structure inference
- Resummed mean-field inference for strongly coupled data
- Interpolating between boolean and extremely high noisy patterns through Minimal Dense Associative Memories
- Improving variational methods via pairwise linear response identities