mlsanityData to 7 Oct 2026

Message Passing Variational Autoregressive Network for Solving Intractable Ising Models

arXiv 2404.06225 ↗First posted 9 Apr 2024cond-mat.stat-mech cond-mat.dis-nn cs.LGcited by 5

Not on the map. Why?

Abstract (arXiv)

Many deep neural networks have been used to solve Ising models, including autoregressive neural networks, convolutional neural networks, recurrent neural networks, and graph neural networks. Learning a probability distribution of energy configuration or finding the ground states of a disordered, fully connected Ising model is essential for statistical mechanics and NP-hard problems. Despite tremendous efforts, a neural network architecture with the ability to high-accurately solve these fully connected and extremely intractable problems on larger systems is still lacking. Here we propose a variational autoregressive architecture with a message passing mechanism, which can effectively utilize the interactions between spin variables. The new network trained under an annealing framework outperforms existing methods in solving several prototypical Ising spin Hamiltonians, especially for larger spin systems at low temperatures. The advantages also come from the great mitigation of mode collapse during the training process of deep neural networks. Considering these extremely difficult problems to be solved, our method extends the current computational limits of unsupervised neural networks to solve combinatorial optimization problems.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 27 of its 64 references that are in the map. First posted on arXiv 9 Apr 2024.

Builds on

27 of 64 references.

References · 27

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  2. 2017Graph Attention Networkscited by 8,854
  3. 2017Inductive Representation Learning on Large Graphscited by 6,284
  4. 2017Neural Message Passing for Quantum Chemistrycited by 3,460
  5. 2016Convolutional Neural Networks on Graphs with Fast Localized Spectral Filteringcited by 2,085
  6. 2016Pixel Recurrent Neural Networkscited by 814
  7. 2018Machine Learning for Combinatorial Optimization: a Methodological Tour d'Horizoncited by 612
  8. 2017Learning Combinatorial Optimization Algorithms over Graphscited by 557
  9. 2019Exact Combinatorial Optimization with Graph Convolutional Neural Networkscited by 313
  10. 2015MADE: Masked Autoencoder for Distribution Estimationcited by 306
  11. 2019An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problemcited by 265
  12. 2013Ising formulations of many NP problemscited by 204
15 more
  1. 2018Combinatorial Optimization with Graph Convolutional Networks and Guided Tree Searchcited by 182
  2. 2021Combinatorial Optimization with Physics-Inspired Graph Neural Networkscited by 107
  3. 2018Solving Statistical Mechanics Using Variational Autoregressive Networkscited by 99
  4. 2016Neural Autoregressive Distribution Estimationcited by 94
  5. 2017Dilated Recurrent Neural Networkscited by 83
  6. 2013Deep AutoRegressive Networkscited by 60
  7. 2021Variational Neural Annealingcited by 45
  8. 2022Modern graph neural networks do worse than classical greedy algorithms in solving combinatorial optimization problems like maximum independent setcited by 33
  9. 2022Graph Coloring with Physics-Inspired Graph Neural Networkscited by 29
  10. 2020Learning Heuristic Selection with Dynamic Algorithm Configurationcited by 21
  11. 2022Inability of a graph neural network heuristic to outperform greedy algorithms in solving combinatorial optimization problems like Max-Cutcited by 19
  12. 2021Unbiased Monte Carlo Cluster Updates with Autoregressive Neural Networkscited by 17
  13. 2020Controlled Online Optimization Learning (COOL): Finding the ground state of spin Hamiltonians with reinforcement learningcited by 14
  14. 2021Benchmark of quantum-inspired heuristic solvers for quadratic unconstrained binary optimizationcited by 5
  15. 2021Nonequilibrium Monte Carlo for unfreezing variables in hard combinatorial optimizationcited by 5

Built on by

Cited by year

Citing papers per year: 2024: 1; 2025: 4.

5 papers.