Solving Statistical Mechanics on Sparse Graphs with Feedback Set Variational Autoregressive Networks
We propose a method for solving statistical mechanics problems defined on sparse graphs. It extracts a small Feedback Vertex Set (FVS) from the sparse graph, converting the sparse system to a much smaller system with many-body and dense interactions with an effective energy on every configuration of the FVS, then learns a variational distribution parameterized using neural networks to approximate the original Boltzmann distribution. The method is able to estimate free energy, compute observables, and generate unbiased samples via direct sampling without auto-correlation. Extensive experiments show that our approach is more accurate than existing approaches for sparse spin glasses. On random graphs and real-world networks, our approach significantly outperforms the standard methods for sparse systems such as the belief-propagation algorithm; on structured sparse systems such as two-dimensional lattices our approach is significantly faster and more accurate than recently proposed variational autoregressive networks using convolution neural networks.
Code (0)
등록된 구현이 없습니다.
Tasks
Feedback Vertex Set (FVS)Methods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Comment on "Solving Statistical Mechanics Using VANs": Introducing saVANt - VANs Enhanced by Importance and MCMC Sampling
In this comment on "Solving Statistical Mechanics Using Variational Autoregressive Networks" by Wu et al., we propose a subtle yet powerful modification of their approach. We show that the inherent sampling error of thei…
Solving Statistical Mechanics Using Variational Autoregressive Networks
We propose a general framework for solving statistical mechanics of systems with finite size. The approach extends the celebrated variational mean-field approaches using autoregressive neural networks, which support dire…
reinforcement-learningReinforcement LearningReinforcement Learning (RL)Variational Monte CarloStatistical Mechanics of Dynamical System Identification
Recovering dynamical equations from observed noisy data is the central challenge of system identification. We develop a statistical mechanics approach to analyze sparse equation discovery algorithms, which typically bala…
Bayesian InferenceEquation DiscoveryHyperparameter OptimizationUncertainty Quantification+1Graph-Based Exploration for ARC-AGI-3 Interactive Reasoning Tasks
We present a training-free graph-based approach for solving interactive reasoning tasks in the ARC-AGI-3 benchmark. ARC-AGI-3 comprises game-like tasks where agents must infer task mechanics through limited interactions,…
Gaussian process regression with Sliced Wasserstein Weisfeiler-Lehman graph kernels
Supervised learning has recently garnered significant attention in the field of computational physics due to its ability to effectively extract complex patterns for tasks like solving partial differential equations, or p…
Graph ClassificationGraph Regressionregression