RESUMO
The Variational Monte Carlo (VMC) method has recently seen important advances through the use of neural network quantum states. While more and more sophisticated ansatze have been designed to tackle a wide variety of quantum many-body problems, modest progress has been made on the associated optimization algorithms. In this work, we revisit the Kronecker-Factored Approximate Curvature (KFAC), an optimizer that has been used extensively in a variety of simulations. We suggest improvements in the scaling and the direction of this optimizer and find that they substantially increase its performance at a negligible additional cost. We also reformulate the VMC approach in a game theory framework, to propose a novel optimizer based on decision geometry. We find that on a practical test case for continuous systems, this new optimizer consistently outperforms any of the KFAC improvements in terms of stability, accuracy and speed of convergence. Beyond VMC, the versatility of this approach suggests that decision geometry could provide a solid foundation for accelerating a broad class of machine learning algorithms. This article is part of the theme issue 'The liminal position of Nuclear Physics: from hadrons to neutron stars'.
