REVIEW 1 cited by
Unbiased Monte Carlo Cluster Updates with Autoregressive Neural Networks
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Efficient sampling of complex high-dimensional probability distributions is a central task in computational science. Machine learning methods like autoregressive neural networks, used with Markov chain Monte Carlo sampling, provide good approximations to such distributions, but suffer from either intrinsic bias or high variance. In this Letter, we propose a way to make this approximation unbiased and with low variance. Our method uses physical symmetries and variable-size cluster updates which utilize the structure of autoregressive factorization. We test our method for first- and second-order phase transitions of classical spin systems, showing its viability for critical systems and in the presence of metastable states.
Forward citations
Cited by 1 Pith paper
-
Leveraging generative models to assist Monte Carlo sampling
This paper is a tutorial review, not a research contribution: it organizes existing methods for using generative models as proposal distributions, transport maps, and annealing bridges in Monte Carlo sampling.
Discussion (0). Continue with ORCID to comment.