Faster and lower scaling orbital-space Variational Monte Carlo
Iliya Sabzevari, Sandeep Sharma

TL;DR
This paper presents three algorithmic improvements to orbital-space variational Monte Carlo, significantly reducing computational cost and scaling, enabling efficient large-scale electronic structure calculations.
Contribution
The authors introduce integral screening, rejection-free CTMC sampling, and adaptive optimization to enhance VMC efficiency and scalability.
Findings
Achieved $O(N^{1.2})$ scaling for Hubbard model
Calculated ground state energy of 160 H atoms in 25 CPU hours
Reduced computational cost by several orders of magnitude
Abstract
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 resulting algorithm scales as the second power of the system size , down from the fourth power . Using numerical results, we demonstrate that the practical scaling obtained is in fact for a chain of Hydrogen atoms, and for the Hubbard model. Second, we introduce the use of the rejection-free continuous time Monte Carlo (CTMC) to sample the determinants. CTMC is usually prohibitively expensive because of the need to calculate a large number of intermediates.…
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
TopicsMachine Learning in Materials Science · Advanced Chemical Physics Studies · X-ray Diffraction in Crystallography
