Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

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.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00634921
Contributor : Simona Cocco <>
Submitted on : Monday, October 24, 2011 - 12:08:09 PM
Last modification on : Thursday, December 10, 2020 - 12:36:38 PM
Long-term archiving on: : Wednesday, January 25, 2012 - 2:30:32 AM

Files

long_cluster_3.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00634921, version 1
  • ARXIV : 1110.5416

Citation

Simona Cocco, Rémi Monasson. Adaptive cluster expansion for the inverse Ising problem: convergence, algorithm and tests. 2011. ⟨hal-00634921⟩

Share

Metrics

Record views

322

Files downloads

508