paper-with-me

홈 › Papers

Convergence to the fixed-node limit in deep variational Monte Carlo

2020-10-11 · Zeno Schätzle, Jan Hermann, Frank Noé

Variational quantum Monte Carlo (QMC) is an ab-initio method for solving the electronic Schr\"odinger equation that is exact in principle, but limited by the flexibility of the available ansatzes in practice. The recently introduced deep QMC approach, specifically two deep-neural-network ansatzes PauliNet and FermiNet, allows variational QMC to reach the accuracy of diffusion QMC, but little is understood about the convergence behavior of such ansatzes. Here, we analyze how deep variational QMC approaches the fixed-node limit with increasing network size. First, we demonstrate that a deep neural network can overcome the limitations of a small basis set and reach the mean-field complete-basis-set limit. Moving to electron correlation, we then perform an extensive hyperparameter scan of a deep Jastrow factor for LiH and H$_4$ and find that variational energies at the fixed-node limit can be obtained with a sufficiently large network. Finally, we benchmark mean-field and many-body ansatzes on H$_2$O, increasing the fraction of recovered fixed-node correlation energy of single-determinant Slater--Jastrow-type ansatzes by half an order of magnitude compared to previous variational QMC results and demonstrate that a single-determinant Slater--Jastrow--backflow version of the ansatz overcomes the fixed-node limitations. This analysis helps understanding the superb accuracy of deep variational ansatzes in comparison to the traditional trial wavefunctions at the respective level of theory, and will guide future improvements of the neural network architectures in deep QMC.

📄 PDF Abstract BibTeX arXiv:2010.05316

Code (1)

deepqmc/deepqmc 공식 구현 pytorch

Tasks

Variational Monte Carlo

Methods 이 논문이 사용한 방법론

Diffusion Diffusion models generate samples by gradually removing noise from a signal, and their training objective can be expressed as a reweighted variational lower-bound…

Similar Papers 제목 키워드 기반

Distributed Bayesian Learning with Stochastic Natural-gradient Expectation Propagation and the Posterior Server

2015-12-31 · Leonard Hasenclever, Stefan Webb, Thibaut Lienart, Sebastian Vollmer 외

This paper makes two contributions to Bayesian machine learning algorithms. Firstly, we propose stochastic natural gradient expectation propagation (SNEP), a novel alternative to expectation propagation (EP), a popular v…

Variational Inference

Neural Wave Functions for Superfluids

2023-05-11 · Wan Tong Lou, Halvard Sutterud, Gino Cassella, W. M. C. Foulkes 외

Understanding superfluidity remains a major goal of condensed matter physics. Here we tackle this challenge utilizing the recently developed Fermionic neural network (FermiNet) wave function Ansatz [D. Pfau et al., Phys.…

Variational Monte Carlo

Higher-order methods for convex-concave min-max optimization and monotone variational inequalities

2020-07-09 · Brian Bullins, Kevin A. Lai

We provide improved convergence rates for constrained convex-concave min-max problems and monotone variational inequalities with higher-order smoothness. In min-max settings where the $p^{th}$-order derivatives are Lipsc…

On the Convergence of Black-Box Variational Inference

2023-05-24 · NeurIPS 2023 11 · Kyurae Kim, Jisu Oh, Kaiwen Wu, Yi-An Ma 외

We provide the first convergence guarantee for full black-box variational inference (BBVI), also known as Monte Carlo variational inference. While preliminary investigations worked on simplified versions of BBVI (e.g., b…

Bayesian InferenceVariational Inference

Power Mean Estimation in Stochastic Monte-Carlo Tree_Search

2024-06-04 · Tuan Dam, Odalric-Ambrym Maillard, Emilie Kaufmann

Monte-Carlo Tree Search (MCTS) is a widely-used strategy for online planning that combines Monte-Carlo sampling with forward tree search. Its success relies on the Upper Confidence bound for Trees (UCT) algorithm, an ext…