The reviewed record of science sign in
Pith

arxiv: 2404.06225 · v1 · pith:4LMLNAVY · submitted 2024-04-09 · cond-mat.stat-mech · cond-mat.dis-nn· cs.LG

Message Passing Variational Autoregressive Network for Solving Intractable Ising Models

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:4LMLNAVYrecord.jsonopen to challenge →

classification cond-mat.stat-mech cond-mat.dis-nncs.LG
keywords neuralnetworksisingproblemsautoregressivenetworksolvespin
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.