Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2106.10558 · Physical Review Research

Rayleigh-Gauss-Newton optimization with enhanced sampling for variational Monte Carlo

Robert J. Webber, Michael Lindsey

Published Aug 3, 2022• 12 citations
arXivHTMLPDF

Abstract

Variational Monte Carlo (VMC) is an approach for computing ground-state wave functions that has recently become more powerful due to the introduction of neural network-based wave-function parametrizations. However, efficiently training neural wave functions to converge to an energy minimum remains a difficult problem. In this work, we analyze optimization and sampling methods used in VMC and introduce alterations to improve their performance. First, based on theoretical convergence analysis in a noiseless setting, we motivate a new optimizer that we call the Rayleigh-Gauss-Newton method, which can improve upon gradient descent and natural gradient descent to achieve superlinear convergence at no more than twice the computational cost. Second, to realize this favorable comparison in the presence of stochastic noise, we analyze the effect of sampling error on VMC parameter updates and experimentally demonstrate that it can be reduced by the parallel tempering method. In particular, we demonstrate that RGN can be made robust to energy spikes that occur when the sampler moves between metastable regions of configuration space. Finally, putting theory into practice, we apply our enhanced optimization and sampling methods to the transverse-field Ising and $XXZ$ models on large lattices, yielding ground-state energy estimates with remarkably high accuracy after just 200 parameter updates.

DOI
10.1103/physrevresearch.4.033099

Related papers

Improved energies and local energies with weighted variational Monte Carlo

Huan Zhang, Robert J. Webber, Michael Lindsey +2 more

Neural network parametrizations have increasingly been used to represent the ground and excited states in variational Monte Carlo (VMC) with promising results. However, traditional VMC methods only optimize the wave function in regions of peak probability. The wave function is uncontrolled in the tails of the probability distribution, which can limit the accuracy of the trained wave function. To improve the approximation accuracy in the probability tails, this paper interprets VMC as a gradient flow in the space of wave functions, followed by a projection step. From this perspective, arbitrary probability distributions can be used in the projection step, allowing the user to prioritize accuracy in different regions of state space. Motivated by this theoretical perspective, the paper tests a weighted VMC method on the antiferromagnetic Heisenberg model for a periodic spin chain. Compared to traditional VMC, weighted VMC reduces the error in the ground state energy by a factor of 2, and it reduces the errors in the local energies away from the mode by large factors of 10 2 – 10 4 .

arXiv:2507.01905•Physical Review Research•Dec 17, 2025•1 citation

Neural network quantum state with proximal optimization: a ground-state searching scheme based on variational Monte Carlo

Feng Chen, Ming Xue

Neural network quantum states (NQS), incorporating with variational Monte Carlo (VMC) method, are shown to be a promising way to investigate quantum many-body physics. Whereas vanilla VMC methods perform one gradient update per sample, we introduce a novel objective function with proximal optimization (PO) that enables multiple updates via reusing the mismatched samples. Our VMC-PO method keeps the advantage of the previous importance sampling gradient optimization algorithm [L. Yang, {\it et al}, Phys. Rev. Research {\bf 2}, 012039(R)(2020)] that efficiently uses sampled states. PO mitigates the numerical instabilities during network updates, which is similar to stochastic reconfiguration (SR) methods, but achieves an alternative and simpler implement with lower computational complexity. We investigate the performance of our VMC-PO algorithm for ground-state searching with a 1-dimensional transverse-field Ising model and 2-dimensional Heisenberg antiferromagnet on a square lattice, and demonstrate that the reached ground-state energies are comparable to state-of-the-art results.

arXiv:2210.16493•Oct 29, 2022•2 citations

Removing nodal and support-mismatch pathologies in Variational Monte Carlo via blurred sampling

Zhou-Quan Wan, Roeland Wiersema, Shiwei Zhang

Variational Monte Carlo (VMC) is a powerful and fast-growing method for optimizing and evolving parameterized many-body wave functions, especially with modern neural-network quantum states. In practice, however, the stochastic estimators that form the backbone of the method can become unstable or biased due to the presence of nodes, a ubiquitous feature of quantum wave functions. In the continuum, this results in heavy-tailed estimators with potentially divergent variances, while in discrete Hilbert spaces the sampling distribution can miss parts of the support needed to form unbiased estimators. These statistical pathologies lead to unreliable optimization trajectories in stochastic reconfiguration or incorrect variational dynamics in time-dependent Variational Monte Carlo (t-VMC), and severely limit the power of the numerical simulations. We introduce blurred sampling to address these difficulties. The method has a number of rigorous properties that make it well-behaved, effective and computationally efficient. Additionally, it is a post-processing approach that can be used without modifying the underlying sampler and incurs only minimal overhead. We demonstrate its effectiveness in a broad range of problems -- including ground state optimization in both continuum and discrete settings, as well as in time-dependent variational Monte Carlo, where it resolves previously identified failure modes -- and further apply it to large-scale problems in spin dynamics. This work establishes a broadly applicable framework for robust VMC and t-VMC calculations.

cond-mat.str-elCross-listedarXiv:2603.18148•Physical Review X•Mar 20, 2026•9 citations

Is Variational Monte Carlo Robust? Sharp Moment Thresholds and Heavy-tailed Stochastic Optimization

Philipp Grohs, Davide Nobile

Variational Monte Carlo (VMC) is a central algorithm in electronic structure theory and has gained renewed importance through modern neural-network ansätze such as FermiNet. At its core, VMC seeks ground states by minimizing the Rayleigh quotient by stochastic optimization. In this work, we show that the resulting stochastic optimization problem is intrinsically governed by the nodal geometry of the underlying wave function. More precisely, we establish that properties of the nodal set determine the integrability of the local energy and gradient estimators that drive VMC. For broad and practically relevant ansatz classes, including Slater-Jastrow wave functions with variable-exponent Slater-type orbitals, we prove that these estimators are generically heavy-tailed and fail to admit higher moments. At the same time, for general analytic ansätze, we prove weak moment bounds for the relevant estimators and identify precise low-moment regimes, showing how generic and degenerate nodal structures lead to different integrability thresholds. Building on this analysis, we introduce a new robust variant of VMC $\unicode{x2013}$ coined PS-Clip-VMC $\unicode{x2013}$ which is based on clipping both the local energies and the per-sample gradients. We prove that PS-Clip-VMC converges both in expectation and with high probability in the weak moment regime of VMC. The robustness of our method is confirmed experimentally by training FermiNet on atoms with up to 18 electrons.

arXiv:2606.26009•Jun 24, 2026•1 citation

Looking elsewhere: improving variational Monte Carlo gradients by importance sampling

Antoine Misery, Luca Gravina, Alessandro Santini +1 more

Abstract Neural-network quantum states (NQSs) offer a powerful and expressive ansatz for representing quantum many-body wave functions. However, their training via Variational Monte Carlo (VMC) methods remains challenging. It is well known that some scenarios—such as sharply peaked wave functions emerging in quantum chemistry—lead to high-variance gradient estimators hindering the effectiveness of variational optimizations. In this work we investigate a systematic strategy to tackle those sampling issues by means of adaptively tuned importance sampling. Our approach is explicitly designed to target the gradient estimator instead of the loss function, and be computationally inexpensive. We benchmarked our approach across the ground-state search of a wide variety of hamiltonians, including frustrated spin systems and ab-initio quantum chemistry. Overall, our approach can reduce the computational cost of vanilla VMC considerably, up to a factor of 100× when targeting highly peaked quantum chemistry wavefunctions.

arXiv:2507.05352•Machine Learning Science and Technology•Jan 14, 2026•15 citations

Improved Speed and Scaling in Orbital Space Variational Monte Carlo

Iliya Sabzevari, Sandeep Sharma

In this work, we introduce three algorithmic improvements to reduce the cost and improve the scaling of orbital space variational Monte Carlo (VMC). First, we show that, by appropriately screening the one- and two-electron integrals of the Hamiltonian, one can improve the efficiency of the algorithm by several orders of magnitude. This improved efficiency comes with the added benefit that the cost of obtaining a constant error per electron scales as the second power of the system size O ( N 2 ), down from the fourth power O ( N 4 ). Using numerical results, we demonstrate that the practical scaling obtained is, in fact, O ( N 1.5 ) for a chain of hydrogen atoms. Second, we show that, by using the adaptive stochastic gradient descent algorithm called AMSGrad, one can optimize the wave function energies robustly and efficiently. Remarkably, AMSGrad is almost as inexpensive as the simple stochastic gradient descent but delivers a convergence rate that is comparable to that of the Stochastic Reconfiguration algorithm, which is significantly more expensive and has a worse scaling with the system size. Third, we introduce the use of the rejection-free continuous time Monte Carlo (CTMC) to sample the determinants. Unlike the first two improvements, CTMC does come at an overhead that the local energy must be calculated at every Monte Carlo step. However, this overhead is mitigated to a large extent because of the reduced scaling algorithm, which ensures that the asymptotic cost of calculating the local energy is equal to that of updating the walker. The resulting algorithm allows us to calculate the ground state energy of a chain of 160 hydrogen atoms using a wave function containing ∼2 × 10 5 variational parameters with an accuracy of 1 mE h /particle at a cost of just 25 CPU h, which when split over 2 nodes of 24 processors each amounts to only about half hour of wall time. This low cost coupled with embarrassing parallelizability of the VMC algorithm and great freedom in the forms of usable wave functions, represents a highly effective method for calculating the electronic structure of model and ab initio systems.

arXiv:1807.10633•Journal of Chemical Theory and Computation•Nov 12, 2018•47 citations
Variational Monte Carlo (VMC) is an approach for computing ground-state wave functions that has recently become more powerful due to the introduction of neural network-based wave-function parametrizations. However, efficiently training neural wave functions to converge to an energy minimum remains a difficult problem. In this work, we analyze optimization and sampling methods used in VMC and introduce alterations to improve their performance. First, based on theoretical convergence analysis in a noiseless setting, we motivate a new optimizer that we call the Rayleigh-Gauss-Newton method, which can improve upon gradient descent and natural gradient descent to achieve superlinear convergence at no more than twice the computational cost. Second, to realize this favorable comparison in the presence of stochastic noise, we analyze the effect of sampling error on VMC parameter updates and experimentally demonstrate that it can be reduced by the parallel tempering method. In particular, we demonstrate that RGN can be made robust to energy spikes that occur when the sampler moves between metastable regions of configuration space. Finally, putting theory into practice, we apply our enhanced optimization and sampling methods to the transverse-field Ising and XXZXXZXXZ models on large lattices, yielding ground-state energy estimates with remarkably high accuracy after just 200 parameter updates.
Neural network parametrizations have increasingly been used to represent the ground and excited states in variational Monte Carlo (VMC) with promising results. However, traditional VMC methods only optimize the wave function in regions of peak probability. The wave function is uncontrolled in the tails of the probability distribution, which can limit the accuracy of the trained wave function. To improve the approximation accuracy in the probability tails, this paper interprets VMC as a gradient flow in the space of wave functions, followed by a projection step. From this perspective, arbitrary probability distributions can be used in the projection step, allowing the user to prioritize accuracy in different regions of state space. Motivated by this theoretical perspective, the paper tests a weighted VMC method on the antiferromagnetic Heisenberg model for a periodic spin chain. Compared to traditional VMC, weighted VMC reduces the error in the ground state energy by a factor of 2, and it reduces the errors in the local energies away from the mode by large factors of 10 2 – 10 4 .
Neural network quantum states (NQS), incorporating with variational Monte Carlo (VMC) method, are shown to be a promising way to investigate quantum many-body physics. Whereas vanilla VMC methods perform one gradient update per sample, we introduce a novel objective function with proximal optimization (PO) that enables multiple updates via reusing the mismatched samples. Our VMC-PO method keeps the advantage of the previous importance sampling gradient optimization algorithm [L. Yang, {\it et al}, Phys. Rev. Research {\bf 2}, 012039(R)(2020)] that efficiently uses sampled states. PO mitigates the numerical instabilities during network updates, which is similar to stochastic reconfiguration (SR) methods, but achieves an alternative and simpler implement with lower computational complexity. We investigate the performance of our VMC-PO algorithm for ground-state searching with a 1-dimensional transverse-field Ising model and 2-dimensional Heisenberg antiferromagnet on a square lattice, and demonstrate that the reached ground-state energies are comparable to state-of-the-art results.
Variational Monte Carlo (VMC) is a powerful and fast-growing method for optimizing and evolving parameterized many-body wave functions, especially with modern neural-network quantum states. In practice, however, the stochastic estimators that form the backbone of the method can become unstable or biased due to the presence of nodes, a ubiquitous feature of quantum wave functions. In the continuum, this results in heavy-tailed estimators with potentially divergent variances, while in discrete Hilbert spaces the sampling distribution can miss parts of the support needed to form unbiased estimators. These statistical pathologies lead to unreliable optimization trajectories in stochastic reconfiguration or incorrect variational dynamics in time-dependent Variational Monte Carlo (t-VMC), and severely limit the power of the numerical simulations. We introduce blurred sampling to address these difficulties. The method has a number of rigorous properties that make it well-behaved, effective and computationally efficient. Additionally, it is a post-processing approach that can be used without modifying the underlying sampler and incurs only minimal overhead. We demonstrate its effectiveness in a broad range of problems -- including ground state optimization in both continuum and discrete settings, as well as in time-dependent variational Monte Carlo, where it resolves previously identified failure modes -- and further apply it to large-scale problems in spin dynamics. This work establishes a broadly applicable framework for robust VMC and t-VMC calculations.
Variational Monte Carlo (VMC) is a central algorithm in electronic structure theory and has gained renewed importance through modern neural-network ansätze such as FermiNet. At its core, VMC seeks ground states by minimizing the Rayleigh quotient by stochastic optimization. In this work, we show that the resulting stochastic optimization problem is intrinsically governed by the nodal geometry of the underlying wave function. More precisely, we establish that properties of the nodal set determine the integrability of the local energy and gradient estimators that drive VMC. For broad and practically relevant ansatz classes, including Slater-Jastrow wave functions with variable-exponent Slater-type orbitals, we prove that these estimators are generically heavy-tailed and fail to admit higher moments. At the same time, for general analytic ansätze, we prove weak moment bounds for the relevant estimators and identify precise low-moment regimes, showing how generic and degenerate nodal structures lead to different integrability thresholds. Building on this analysis, we introduce a new robust variant of VMC $\unicode{x2013}$ coined PS-Clip-VMC $\unicode{x2013}$ which is based on clipping both the local energies and the per-sample gradients. We prove that PS-Clip-VMC converges both in expectation and with high probability in the weak moment regime of VMC. The robustness of our method is confirmed experimentally by training FermiNet on atoms with up to 18 electrons.
Abstract Neural-network quantum states (NQSs) offer a powerful and expressive ansatz for representing quantum many-body wave functions. However, their training via Variational Monte Carlo (VMC) methods remains challenging. It is well known that some scenarios—such as sharply peaked wave functions emerging in quantum chemistry—lead to high-variance gradient estimators hindering the effectiveness of variational optimizations. In this work we investigate a systematic strategy to tackle those sampling issues by means of adaptively tuned importance sampling. Our approach is explicitly designed to target the gradient estimator instead of the loss function, and be computationally inexpensive. We benchmarked our approach across the ground-state search of a wide variety of hamiltonians, including frustrated spin systems and ab-initio quantum chemistry. Overall, our approach can reduce the computational cost of vanilla VMC considerably, up to a factor of 100× when targeting highly peaked quantum chemistry wavefunctions.
In this work, we introduce three algorithmic improvements to reduce the cost and improve the scaling of orbital space variational Monte Carlo (VMC). First, we show that, by appropriately screening the one- and two-electron integrals of the Hamiltonian, one can improve the efficiency of the algorithm by several orders of magnitude. This improved efficiency comes with the added benefit that the cost of obtaining a constant error per electron scales as the second power of the system size O ( N 2 ), down from the fourth power O ( N 4 ). Using numerical results, we demonstrate that the practical scaling obtained is, in fact, O ( N 1.5 ) for a chain of hydrogen atoms. Second, we show that, by using the adaptive stochastic gradient descent algorithm called AMSGrad, one can optimize the wave function energies robustly and efficiently. Remarkably, AMSGrad is almost as inexpensive as the simple stochastic gradient descent but delivers a convergence rate that is comparable to that of the Stochastic Reconfiguration algorithm, which is significantly more expensive and has a worse scaling with the system size. Third, we introduce the use of the rejection-free continuous time Monte Carlo (CTMC) to sample the determinants. Unlike the first two improvements, CTMC does come at an overhead that the local energy must be calculated at every Monte Carlo step. However, this overhead is mitigated to a large extent because of the reduced scaling algorithm, which ensures that the asymptotic cost of calculating the local energy is equal to that of updating the walker. The resulting algorithm allows us to calculate the ground state energy of a chain of 160 hydrogen atoms using a wave function containing ∼2 × 10 5 variational parameters with an accuracy of 1 mE h /particle at a cost of just 25 CPU h, which when split over 2 nodes of 24 processors each amounts to only about half hour of wall time. This low cost coupled with embarrassing parallelizability of the VMC algorithm and great freedom in the forms of usable wave functions, represents a highly effective method for calculating the electronic structure of model and ab initio systems.