mlsanityData to 7 Oct 2026

Optimal structure and parameter learning of Ising models

arXiv 1612.05024 ↗First posted 15 Dec 2016cond-mat.stat-mech cs.LG physics.data-ancited by 26

Not on the map. Why?

Abstract (arXiv)

Reconstruction of structure and parameters of an Ising model from binary samples is a problem of practical importance in a variety of disciplines, ranging from statistical physics and computational biology to image processing and machine learning. The focus of the research community shifted towards developing universal reconstruction algorithms which are both computationally efficient and require the minimal amount of expensive data. We introduce a new method, Interaction Screening, which accurately estimates the model parameters using local optimization problems. The algorithm provably achieves perfect graph structure recovery with an information-theoretically optimal number of samples, notably in the low-temperature regime which is known to be the hardest for learning. The efficacy of Interaction Screening is assessed through extensive numerical tests on synthetic Ising models of various topologies with different types of interactions, as well as on a real data produced by a D-Wave quantum computer. This study shows that the Interaction Screening method is an exact, tractable and optimal technique universally solving the inverse Ising problem.

Key facts. Cited by 26 papers in the map (data through 7 Oct 2026). First posted on arXiv 15 Dec 2016.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 10; 2022: 1; 2023: 3; 2024: 4; 2025: 4; 2026: 4.

26 papers.

Sort:

By area:

  1. 2022Statistical Efficiency of Score Matching: The View from Isoperimetrycited by 63
  2. 2021Structure learning in polynomial time: Greedy algorithms, Bregman information, and exponential familiescited by 10
  3. 2021High-quality Thermal Gibbs Sampling with Quantum Annealing Hardwarecited by 9
  4. 2021Learning Continuous Exponential Families Beyond Gaussiancited by 6
  5. 2021Exponential Reduction in Sample Complexity with Learning of Ising Model Dynamicscited by 5
  6. 2024Network reconstruction via the minimum description length principlecited by 5
  7. 2021Ising Model Selection Using ℓ1-Regularized Linear Regression: A Statistical Mechanics Analysiscited by 4
  8. 2021Quantum Model Learning Agent: characterisation of quantum systems through machine learningcited by 3
  9. 2023Learning Energy-Based Representations of Quantum Many-Body Statescited by 2
  10. 2024Discrete distributions are learnable from metastable samplescited by 2
  11. 2025Estimating Ising Models in Total Variation Distancecited by 2
  12. 2021Single-Qubit Fidelity Assessment of Quantum Annealing Hardwarecited by 1
14 more
  1. 2021On Model Selection Consistency of Lasso for High-Dimensional Ising Modelscited by 1
  2. 2023Biases in Inverse Ising Estimates of Near-Critical Behaviourcited by 1
  3. 2025Learning Gaussian DAG Models without Condition Number Boundscited by 1
  4. 2026A Blueprint for Equilibrium-Based Differentiable Continuous-Variable Thermodynamic Computingcited by 1
  5. 2021Inference of stochastic time series with missing datacited by 0
  6. 2021Data-Driven Interaction Analysis of Line Failure Cascading in Power Grid Networkscited by 0
  7. 2023Interaction Screening and Pseudolikelihood Approaches for Tensor Learning in Ising Modelscited by 0
  8. 2024Mixing Artificial and Natural Intelligence: From Statistical Mechanics to AI and Back to Turbulencecited by 0
  9. 2024Sparsity-Constraint Optimization via Splicing Iterationcited by 0
  10. 2025Data augmentation using diffusion models to enhance inverse Ising inferencecited by 0
  11. 2025Efficient Learning of Lattice Gauge Theories with Fermionscited by 0
  12. 2026Computationally sufficient statistics for Ising modelscited by 0
  13. 2026Selecting Optimal Variable Order in Autoregressive Ising Modelscited by 0
  14. 2026Transfer Learning in High-dimensional Ising Modelscited by 0