Approximate sampling and estimation of partition functions using neural networks
Not on the map. Why?
Abstract (arXiv)
We consider the closely related problems of sampling from a distribution known up to a normalizing constant, and estimating said normalizing constant. We show how variational autoencoders (VAEs) can be applied to this task. In their standard applications, VAEs are trained to fit data drawn from an intractable distribution. We invert the logic and train the VAE to fit a simple and tractable distribution, on the assumption of a complex and intractable latent distribution, specified up to normalization. This procedure constructs approximations without the use of training data or Markov chain Monte Carlo sampling. We illustrate our method on three examples: the Ising model, graph clustering, and ranking.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 11 of its 32 references that are in the map. First posted on arXiv 21 Sep 2022.
Builds on
11 of 32 references.
References · 11
- 2013Auto-Encoding Variational Bayescited by 4,053
- 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,739
- 2016The Concrete Distribution: A Continuous Relaxation of Discrete Random Variablescited by 1,148
- 2019An Introduction to Variational Autoencoderscited by 1,000
- 2017Cooperative Game Theory Approaches for Network Partitioningcited by 135
- 2016Community detection in networks: A user guidecited by 105
- 2018Solving Statistical Mechanics Using Variational Autoregressive Networkscited by 100
- 2013Spectral redemption: clustering sparse networkscited by 56
- 2017The Computer Science and Physics of Community Detection: Landscapes, Phase Transitions, and Hardnesscited by 20
- 2020Learning the Ising Model with Generative Neural Networkscited by 9
- 2021Variational Autoencoder Analysis of Ising Model Statistical Distributions and Phase Transitionscited by 5
Built on by
Citing papers per year: 2024: 1; 2025: 0; 2026: 1.
2 papers.