Reconstruct Ising Model With Global Optimality via SLIDE

doi:10.1080/01621459.2025.2571245

Reconstruct Ising Model With Global Optimality via SLIDE

2026-01-01

0

PRE

AI

DOI：10.1080/01621459.2025.2571245

Original

Original request for help

Save

Abstract

En 中文

The reconstruction of interaction networks between random events is a critical problem arising from statistical physics and politics, sociology, biology, psychology, and beyond. The Ising model lays the foundation for this reconstruction process, but finding the underlying Ising model from the least amount of observed samples in a computationally efficient manner has been historically challenging for half a century. Using sparsity learning, we present an approach named SLIDE whose sample complexity is globally optimal. Furthermore, an algorithm is developed to give a statistically consistent solution of SLIDE in polynomial time with high probability. On extensive benchmarked cases, the SLIDE approach demonstrates dominant performance in reconstructing underlying Ising models, confirming its superior statistical properties. The application on the U.S. senators voting in the six congresses reveals that both the Republicans and Democrats noticeably assemble in each congress; interestingly, the assembling of Democrats is particularly pronounced in the latest congress. Supplementary materials for this article are available online, including a standardized description of the materials available for reproducing the work.

Keywords:

Consistent algorithm

Ising model

Polynomial time complexity

Sample complexity

Sparse learning

Reconstruct Ising Model With Global Optimality via SLIDE

Abstract

Journal

Organization