Pushing the limits of unconstrained machine-learned interatomic potentials
Filippo Bigi, Paolo Pegolo, Arslan Mazitov, Michele Ceriotti
TL;DR
The paper investigates unconstrained machine-learned interatomic potentials (MLIPs) that relax exact physical symmetries, showing that with large, diverse training data they can match or surpass constrained models in accuracy and speed. It introduces the PET architecture, a transformer-based GNN that scales to hundreds of millions of parameters and supports direct-force heads and adaptive cutoffs, while enabling inference-time symmetry restoration. The authors demonstrate state-of-the-art performance on large materials benchmarks (matbench-discovery) and strong results on molecular benchmarks (SPICE) after pretraining on non-conservative data and fine-tuning. They provide practical guidance for using unconstrained models in geometry optimization and lattice dynamics, including strategies like rotational averaging and careful handling of symmetry-related observables. Overall, unconstrained PET models offer a viable, efficient path to general-purpose, high-accuracy MLIPs with scalable training and flexible downstream use cases.
Abstract
Machine-learned interatomic potentials (MLIPs) are increasingly used to replace computationally demanding electronic-structure calculations to model matter at the atomic scale. The most commonly used model architectures are constrained to fulfill a number of physical laws exactly, from geometric symmetries to energy conservation. Evidence is mounting that relaxing some of these constraints can be beneficial to the efficiency and (somewhat surprisingly) accuracy of MLIPs, even though care should be taken to avoid qualitative failures associated with the breaking of physical symmetries. Given the recent trend of \emph{scaling up} models to larger numbers of parameters and training samples, a very important question is how unconstrained MLIPs behave in this limit. Here we investigate this issue, showing that -- when trained on large datasets -- unconstrained models can be superior in accuracy and speed when compared to physically constrained models. We assess these models both in terms of benchmark accuracy and in terms of usability in practical scenarios, focusing on static simulation workflows such as geometry optimization and lattice dynamics. We conclude that accurate unconstrained models can be applied with confidence, especially since simple inference-time modifications can be used to recover observables that are consistent with the relevant physical symmetries.
