Allegro-Legato: Scalable, Fast, and Robust Neural-Network Quantum Molecular Dynamics via Sharpness-Aware Minimization
Not on the map. Why?
Abstract (arXiv)
Neural-network quantum molecular dynamics (NNQMD) simulations based on machine learning are revolutionizing atomistic simulations of materials by providing quantum-mechanical accuracy but orders-of-magnitude faster, illustrated by ACM Gordon Bell prize (2020) and finalist (2021). State-of-the-art (SOTA) NNQMD model founded on group theory featuring rotational equivariance and local descriptors has provided much higher accuracy and speed than those models, thus named Allegro (meaning fast). On massively parallel supercomputers, however, it suffers a fidelity-scaling problem, where growing number of unphysical predictions of interatomic forces prohibits simulations involving larger numbers of atoms for longer times. Here, we solve this problem by combining the Allegro model with sharpness aware minimization (SAM) for enhancing the robustness of model through improved smoothness of the loss landscape. The resulting Allegro-Legato (meaning fast and "smooth") model was shown to elongate the time-to-failure t_textrmfailure, without sacrificing computational speed or accuracy. Specifically, Allegro-Legato exhibits much weaker dependence of timei-to-failure on the problem size, t_textrmfailure propto N-0.14 (N is the number of atoms) compared to the SOTA Allegro model left(t_textrmfailure propto N-0.29right), i.e., systematically delayed time-to-failure, thus allowing much larger and longer NNQMD simulations without failure. The model also exhibits excellent computational scalability and GPU acceleration on the Polaris supercomputer at Argonne Leadership Computing Facility. Such scalable, accurate, fast and robust NNQMD models will likely find broad applications in NNQMD simulations on emerging exaflop/s computers, with a specific example of accounting for nuclear quantum effects in the dynamics of ammonia.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 9 of its 26 references that are in the map. First posted on arXiv 14 Mar 2023.
Builds on
9 of 26 references.
References · 9
- 2014Explaining and Harnessing Adversarial Examplescited by 7,287
- 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,404
- 2018Tensor field networks: Rotation- and translation-equivariant neural networks for 3D point cloudscited by 735
- 2021E(3)-Equivariant Graph Neural Networks for Data-Efficient and Accurate Interatomic Potentialscited by 701
- 2019Adversarial Training for Free!cited by 638
- 2022Learning Local Equivariant Representations for Large-Scale Atomistic Dynamicscited by 254
- 2020Descending through a Crowded Valley - Benchmarking Deep Learning Optimizerscited by 118
- 2022Forces are not Enough: Benchmark and Critical Evaluation for Machine Learning Force Fields with Molecular Simulationscited by 92
- 2021Differentiable sampling of molecular geometries with uncertainty-based adversarial attackscited by 25
Built on by
Citing papers per year: 2023: 2; 2024: 1.
3 papers.
- 2023Uncertainty-biased molecular dynamics for learning uniformly accurate interatomic potentialscited by 16
- 2023Learning Interatomic Potentials at Multiple Scalescited by 5
- 2024nabla2DFT: A Universal Quantum Chemistry Dataset of Drug-Like Molecules and a Benchmark for Neural Network Potentialscited by 2
- 2024nabla2DFT: A Universal Quantum Chemistry Dataset of Drug-Like Molecules and a Benchmark for Neural Network Potentials20 Jun 2024
- 2023Uncertainty-biased molecular dynamics for learning uniformly accurate interatomic potentials3 Dec 2023
- 2023Learning Interatomic Potentials at Multiple Scales20 Oct 2023