arXiv:1110.5416 [cond-mat.dis-nn]AbstractReferencesReviewsResources
Adaptive cluster expansion for the inverse Ising problem: convergence, algorithm and tests
Published 2011-10-25Version 1
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.
Comments: Paper submitted to Journal of Statistical Physics
Categories: cond-mat.dis-nn
Keywords: inverse ising problem, adaptive cluster expansion, convergence, binary variables, equilibrium correlations
Tags: journal article
Related articles: Most relevant | Search more
arXiv:1705.05403 [cond-mat.dis-nn] (Published 2017-05-15)
A statistical physics approach to learning curves for the Inverse Ising problem
arXiv:0811.3574 [cond-mat.dis-nn] (Published 2008-11-21)
Small-correlation expansions for the inverse Ising problem
Mean-field theory for the inverse Ising problem at low temperatures