mlsanityData to 7 Oct 2026

A method for quantifying the generalization capabilities of generative models for solving Ising models

arXiv 2405.03435 ↗First posted 6 May 2024cond-mat.dis-nn cs.AI cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

For Ising models with complex energy landscapes, whether the ground state can be found by neural networks depends heavily on the Hamming distance between the training datasets and the ground state. Despite the fact that various recently proposed generative models have shown good performance in solving Ising models, there is no adequate discussion on how to quantify their generalization capabilities. Here we design a Hamming distance regularizer in the framework of a class of generative models, variational autoregressive networks (VAN), to quantify the generalization capabilities of various network architectures combined with VAN. The regularizer can control the size of the overlaps between the ground state and the training datasets generated by networks, which, together with the success rates of finding the ground state, form a quantitative metric to quantify their generalization capabilities. We conduct numerical experiments on several prototypical network architectures combined with VAN, including feed-forward neural networks, recurrent neural networks, and graph neural networks, to quantify their generalization capabilities when solving Ising models. Moreover, considering the fact that the quantification of the generalization capabilities of networks on small-scale problems can be used to predict their relative performance on large-scale problems, our method is of great significance for assisting in the Neural Architecture Search field of searching for the optimal network architectures when solving large-scale Ising models.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 15 of its 37 references that are in the map. First posted on arXiv 6 May 2024.

Builds on

15 of 37 references.

References · 15

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  2. 2016Pixel Recurrent Neural Networkscited by 814
  3. 2020Neural Architecture Search without Trainingcited by 241
  4. 2018Solving Statistical Mechanics Using Variational Autoregressive Networkscited by 99
  5. 2019A Survey on Neural Architecture Searchcited by 71
  6. 2021Variational Neural Annealingcited by 45
  7. 2022On Evaluation Metrics for Graph Generative Modelscited by 44
  8. 2017On the ability of neural nets to express distributionscited by 26
  9. 2022Do Quantum Circuit Born Machines Generalize?cited by 19
  10. 2021Unbiased Monte Carlo Cluster Updates with Autoregressive Neural Networkscited by 17
  11. 2019How Well Do WGANs Estimate the Wasserstein Metric?cited by 15
  12. 2020Towards a theory of machine learningcited by 14
3 more
  1. 2021Towards Deepening Graph Neural Networks: A GNTK-based Optimization Perspectivecited by 14
  2. 2024Message Passing Variational Autoregressive Network for Solving Intractable Ising Modelscited by 5
  3. 2022Quasi-orthogonality and intrinsic dimensions as measures of learning and generalisationcited by 1

Built on by

Not cited yet.