Gradient estimators for normalising flows
Piotr Bialas, Piotr Korcyl, Tomasz Stebel

TL;DR
This paper introduces a new gradient estimator for training normalizing flows in neural MCMC, achieving faster convergence and more accurate free energy estimates for the $\
Contribution
It presents a novel gradient estimator that reduces variance and speeds up training of normalizing flows in neural MCMC methods, especially for complex models.
Findings
Achieves same precision in half the time compared to standard methods.
Provides better free energy estimates for the $\
Demonstrates lower variance of the new estimator improves training efficiency.
Abstract
Recently a machine learning approach to Monte-Carlo simulations called Neural Markov Chain Monte-Carlo (NMCMC) is gaining traction. In its most popular form it uses neural networks to construct normalizing flows which are then trained to approximate the desired target distribution. In this contribution we present new gradient estimator for Stochastic Gradient Descent algorithm (and the corresponding \texttt{PyTorch} implementation) and show that it leads to better training results for model. For this model our estimator achieves the same precision in approximately half of the time needed in standard approach and ultimately provides better estimates of the free energy. We attribute this effect to the lower variance of the new estimator. In contrary to the standard learning algorithm our approach does not require estimation of the action gradient with respect to the fields, thus…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGenerative Adversarial Networks and Image Synthesis · Adversarial Robustness in Machine Learning · Explainable Artificial Intelligence (XAI)
MethodsNormalizing Flows
