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:cond-mat/0502553 · Physical Review B

Wave function optimization in the variational Monte Carlo method

Sandro Sorella

Published Jun 22, 2005• 266 citations
arXivHTMLPDF

Abstract

An appropriate iterative scheme for the minimization of the energy, based on the variational Monte Carlo (VMC) technique, is introduced and compared with existing stochastic schemes. We test the various methods for the one-dimensional Heisenberg ring and the two-dimensional $t\text{\ensuremath{-}}J$ model and show that, with the present scheme, very accurate and efficient calculations are possible, even for several variational parameters. Indeed, by using a very efficient statistical evaluation of the first and the second energy derivatives, it is possible to define a very rapidly converging iterative scheme that, within VMC, is much more convenient than the standard Newton method. It is also shown how to optimize simultaneously both the Jastrow and the determinantal part of the wave function.

DOI
10.1103/physrevb.71.241103

Related papers

Optimization of quantum Monte Carlo wave functions by energy minimization

Julien Toulouse, Cyrus J. Umrigar

We study three wave function optimization methods based on energy minimization in a variational Monte Carlo framework: the Newton, linear, and perturbative methods. In the Newton method, the parameter variations are calculated from the energy gradient and Hessian, using a reduced variance statistical estimator for the latter. In the linear method, the parameter variations are found by diagonalizing a nonsymmetric estimator of the Hamiltonian matrix in the space spanned by the wave function and its derivatives with respect to the parameters, making use of a strong zero-variance principle. In the less computationally expensive perturbative method, the parameter variations are calculated by approximately solving the generalized eigenvalue equation of the linear method by a nonorthogonal perturbation theory. These general methods are illustrated here by the optimization of wave functions consisting of a Jastrow factor multiplied by an expansion in configuration state functions (CSFs) for the C2 molecule, including both valence and core electrons in the calculation. The Newton and linear methods are very efficient for the optimization of the Jastrow, CSF, and orbital parameters. The perturbative method is a good alternative for the optimization of just the CSF and orbital parameters. Although the optimization is performed at the variational Monte Carlo level, we observe for the C2 molecule studied here, and for other systems we have studied, that as more parameters in the trial wave functions are optimized, the diffusion Monte Carlo total energy improves monotonically, implying that the nodal hypersurface also improves monotonically.

arXiv:physics/0701039•The Journal of Chemical Physics•Feb 22, 2007•290 citations

Complementary first and second derivative methods for ansatz optimization in variational Monte Carlo

Leon Otis, Eric Neuscamman

We present a comparison between a number of recently introduced low-memory wave function optimization methods for variational Monte Carlo in which we find that first and second derivative methods possess strongly complementary relative advantages. While we find that low-memory variants of the linear method are vastly more efficient at bringing wave functions with disparate types of nonlinear parameters to the vicinity of the energy minimum, accelerated descent approaches are then able to locate the precise minimum with less bias and lower statistical uncertainty. By constructing a simple hybrid approach that combines these methodologies, we show that all of these advantages can be had at once when simultaneously optimizing large determinant expansions, molecular orbital shapes, traditional Jastrow correlation factors, and more nonlinear many-electron Jastrow factors.

arXiv:1904.10087•Physical Chemistry Chemical Physics•Jan 1, 2019•25 citations

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

Robert J. Webber, Michael Lindsey

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.

arXiv:2106.10558•Physical Review Research•Aug 3, 2022•9 citations

Variational Monte Carlo Method Combined with Quantum-Number Projection and Multi-Variable Optimization

Daisuke Tahara, Masatoshi Imada

Variational wave functions used in the variational Monte Carlo (VMC) method are extensively improved to overcome the biases coming from the assumed variational form of the wave functions. We construct a highly generalized variational form by introducing a large number of variational parameters to the Gutzwiller-Jastrow factor as well as to the one-body part. Moreover, the projection operator to restore the symmetry of the wave function is introduced. These improvements enable to treat fluctuations with long-ranged as well as short-ranged correlations. A highly generalized wave function is implemented by the Pfaffians introduced by Bouchaud et al., together with the stochastic reconfiguration method introduced by Sorella for the parameter optimization. Our framework offers much higher accuracy for strongly correlated electron systems than the conventional variational Monte Carlo methods.

arXiv:0805.4457•Journal of the Physical Society of Japan•Oct 27, 2008•147 citations

Generalized Lanczos algorithm for variational quantum Monte Carlo

Sandro Sorella

We show that the standard Lanczos algorithm can be efficiently implemented statistically and self-consistently improved, using the stochastic reconfiguration method, which has been recently introduced to stabilize the Monte Carlo sign problem instability. With this scheme a few Lanczos steps over a given variational wave function are possible even for large size as a particular case of a more general and more accurate technique that allows to obtain lower variational energies. This method has been tested extensively for a strongly correlated model like the $t\ensuremath{-}J$ model. With the standard Lanczos technique it is possible to compute any kind of correlation functions, with no particular computational effort. By using the fact that the variance $〈{H}^{2}〉\ensuremath{-}〈H{〉}^{2}$ is zero for an exact eigenstate, we show that the approach to the exact solution with few Lanczos iterations is indeed possible even for $\ensuremath{\sim}100$ electrons for reasonably good initial wave functions. The variational stochastic reconfiguration technique presented here allows in general a many-parameter energy optimization of any computable many-body wave function, including for instance generic long-range Jastrow factors and arbitrary site-dependent orbital determinants. This scheme improves further the accuracy of the calculation, especially for long-distance correlation functions.

arXiv:cond-mat/0009149•Physical review. B, Condensed matter•Jun 19, 2001•368 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.

Journal of Chemical Theory and Computation•Nov 12, 2018•42 citations
An appropriate iterative scheme for the minimization of the energy, based on the variational Monte Carlo (VMC) technique, is introduced and compared with existing stochastic schemes. We test the various methods for the one-dimensional Heisenberg ring and the two-dimensional t\ensuremath-Jt\text{\ensuremath{-}}Jt\ensuremath-J model and show that, with the present scheme, very accurate and efficient calculations are possible, even for several variational parameters. Indeed, by using a very efficient statistical evaluation of the first and the second energy derivatives, it is possible to define a very rapidly converging iterative scheme that, within VMC, is much more convenient than the standard Newton method. It is also shown how to optimize simultaneously both the Jastrow and the determinantal part of the wave function.
We study three wave function optimization methods based on energy minimization in a variational Monte Carlo framework: the Newton, linear, and perturbative methods. In the Newton method, the parameter variations are calculated from the energy gradient and Hessian, using a reduced variance statistical estimator for the latter. In the linear method, the parameter variations are found by diagonalizing a nonsymmetric estimator of the Hamiltonian matrix in the space spanned by the wave function and its derivatives with respect to the parameters, making use of a strong zero-variance principle. In the less computationally expensive perturbative method, the parameter variations are calculated by approximately solving the generalized eigenvalue equation of the linear method by a nonorthogonal perturbation theory. These general methods are illustrated here by the optimization of wave functions consisting of a Jastrow factor multiplied by an expansion in configuration state functions (CSFs) for the C2 molecule, including both valence and core electrons in the calculation. The Newton and linear methods are very efficient for the optimization of the Jastrow, CSF, and orbital parameters. The perturbative method is a good alternative for the optimization of just the CSF and orbital parameters. Although the optimization is performed at the variational Monte Carlo level, we observe for the C2 molecule studied here, and for other systems we have studied, that as more parameters in the trial wave functions are optimized, the diffusion Monte Carlo total energy improves monotonically, implying that the nodal hypersurface also improves monotonically.
We present a comparison between a number of recently introduced low-memory wave function optimization methods for variational Monte Carlo in which we find that first and second derivative methods possess strongly complementary relative advantages. While we find that low-memory variants of the linear method are vastly more efficient at bringing wave functions with disparate types of nonlinear parameters to the vicinity of the energy minimum, accelerated descent approaches are then able to locate the precise minimum with less bias and lower statistical uncertainty. By constructing a simple hybrid approach that combines these methodologies, we show that all of these advantages can be had at once when simultaneously optimizing large determinant expansions, molecular orbital shapes, traditional Jastrow correlation factors, and more nonlinear many-electron Jastrow factors.
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.
Variational wave functions used in the variational Monte Carlo (VMC) method are extensively improved to overcome the biases coming from the assumed variational form of the wave functions. We construct a highly generalized variational form by introducing a large number of variational parameters to the Gutzwiller-Jastrow factor as well as to the one-body part. Moreover, the projection operator to restore the symmetry of the wave function is introduced. These improvements enable to treat fluctuations with long-ranged as well as short-ranged correlations. A highly generalized wave function is implemented by the Pfaffians introduced by Bouchaud et al., together with the stochastic reconfiguration method introduced by Sorella for the parameter optimization. Our framework offers much higher accuracy for strongly correlated electron systems than the conventional variational Monte Carlo methods.
We show that the standard Lanczos algorithm can be efficiently implemented statistically and self-consistently improved, using the stochastic reconfiguration method, which has been recently introduced to stabilize the Monte Carlo sign problem instability. With this scheme a few Lanczos steps over a given variational wave function are possible even for large size as a particular case of a more general and more accurate technique that allows to obtain lower variational energies. This method has been tested extensively for a strongly correlated model like the $t\ensuremath{-}J$ model. With the standard Lanczos technique it is possible to compute any kind of correlation functions, with no particular computational effort. By using the fact that the variance $〈{H}^{2}〉\ensuremath{-}〈H{〉}^{2}$ is zero for an exact eigenstate, we show that the approach to the exact solution with few Lanczos iterations is indeed possible even for $\ensuremath{\sim}100$ electrons for reasonably good initial wave functions. The variational stochastic reconfiguration technique presented here allows in general a many-parameter energy optimization of any computable many-body wave function, including for instance generic long-range Jastrow factors and arbitrary site-dependent orbital determinants. This scheme improves further the accuracy of the calculation, especially for long-distance correlation functions.
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.