betaFeedback

WorksPhysics and Astronomy

On the design space between molecular mechanics and machine learning force fields

Abstract

A force field as accurate as quantum mechanics (QM) and as fast as molecular mechanics (MM), with which one can simulate a biomolecular system efficiently enough and meaningfully enough to get quantitative insights, is among the most ardent dreams of biophysicists – a dream, nevertheless, not to be fulfilled any time soon. Machine learning force fields (MLFFs) represent a meaningful endeavor towards this direction, where differentiable neural functions are parametrized to fit ab initio energies, and furthermore forces through automatic differentiation. We argue that, as of now, the utility of the MLFF models is no longer bottlenecked by accuracy but primarily by their speed (as well as stability and generalizability), as many recent variants, on limited chemical spaces, have long surpassed the chemical accuracy of 11 kcal/mol – the empirical threshold beyond which realistic chemical predictions are possible – though still magnitudes slower than MM. Hoping to kindle explorations and designs of faster, albeit perhaps slightly less accurate MLFFs, in this review, we focus our attention on the design space (the speed-accuracy tradeoff) between MM and ML force fields. After a brief review of the building blocks of force fields of either kind, we discuss the desired properties and challenges now faced by the force field development community, survey the efforts to make MM force fields more accurate and ML force fields faster, envision what the next generation of MLFF might look like.

Introduction: The past, present, and future of force fields.

Computational chemists and biophysicists are interested in characterizing the energy landscape of many-body systems—the distribution of coordinates x∈RN×3\mathbf{x} \in\mathbb{R}^{N \times3} at a certain state with energy U(x)U(\mathbf{x}), which adopts a Boltzmann form1:

p(x)∝exp⁡(−U(x)kT)(1)p(\mathbf{x}) \propto\exp\left(-\frac{U(\mathbf{x})}{kT}\right) \tag*{(1)}

where NN is the number of particles in a many-body system, kk the Boltzmann constant, and TT the temperature. In a simulation, since the true (reference) energy UU is almost always inaccessible, and ab initio methods are usually prohibitively expensive, one resorts to a surrogate model which models the energy landscape as a function based upon the coordinates x\mathbf{x}, the identity of the particles in the system h∈RN\mathbf{h} \in\mathbb{R}^{N}, and a set of parameters Φ\Phi:

p^∝exp⁡(−U^(x;h,Φ)kT).(2)\hat{p} \propto\exp\left(-\frac{\hat{U}(\mathbf{x};\mathbf{h},\Phi)}{kT}\right). \tag*{(2)}

Evidently, the closer UU and U^\hat{U} are, the smaller the divergence between the true and simulated probability distribution pp and p^\hat{p} will be. We call this parametrized scalar field U^:RN×3→R1\hat{U} : \mathbb{R}^{N \times3} \to\mathbb{R}^{1} a force field (FF). Molecular dynamics (MD) is usually employed to generate samples from this distribution.

Dating back to McCammon, Gelin, and Karplus [2] in 1977, molecular mechanics (MM) force fields have been curated, using structural and QM data, to capture the qualitative behavior of biomolecular systems[3, 4, 5, 6, 7, 8, 9, 10] to power the in silico modeling of all aspects of chemistry, from drug discovery to material sciences. The blessing and the curse of MM force fields both lie in their simple functional forms (Equation 9). On the one hand, these terms afford linear O(N)\mathcal{O}(N) runtime complexity and can be further aggressively optimized in modern compute hardware namely graphics processing units (GPU), simulating more than hundreds of nanoseconds per day for many biomolecular drug targets[11, 12, 13, 14] while still achieving useful accuracy for tasks such as predicting protein-ligand binding free energies[15, 16, 17]. At the same time, the limited expressiveness of this functional form dictates that it is impossible to fit the QM energies and forces well, especially in the high-energy region—see Figure 2 for a comparison of QM and MM energies of a very simple ethanol molecule in the MD17[18] dataset, although they recover the position of QM minima relatively well[19]. Worse still, even within the limits of this functional form, there is no guarantee that maximal expressiveness has been achieved, as the assignment of parameters to the chemical motifs (atoms, bonds, angles, and torsions) in a MM force field has been relying on a human-derived, labor-intensive, and inextendable scheme termed atom typing, where atoms of distinct nature are forced to share parameters. Takaba et al. [20] shows that, on very limited chemical space and low energy region, the energy disagreement between legacy force fields and QM is far beyond the chemical accuracy of 1 kcal/mol—the empirical threshold under which we believe that the qualitative characterization of a many-body system is possible. And even when coupled with a trainable, flexible parametrization engine, the training accuracy still cannot exceed the chemical accuracy. Limitations exist in both the functional form and parametrization steps of MM force fields.

Image not extracted

Figure 2. Between MM and QM energies and forces, there is little correlation. Scatter plots and kernel density estimate (KDE) of: (a): MM energy (UMMU_{\mathrm{MM}}, mean-subtracted) plotted against QM energy (UQMU_{\mathrm{QM}}, mean-subtracted); (b): MM force magnitude (∣FMM∣\lvert F_{\mathrm{MM}}\rvert) plotted against QM force magnitude (∣FQM∣\lvert F_{\mathrm{QM}}\rvert); (c): Distribution of deviation of angles between QM and MM forces. QM energies refer to the CCSD(T) computation of the ethanol molecule in MD17[21] dataset. MM energies and forces are re-calculated using the state-of-the-art openff-2.0.0[19] force field.

Image not extracted

Figure 1. Overview of the design space between molecular mechanics (MM) and machine learning (ML) force fields.

Another line of fruitful research[22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33] focuses on developing machine learning force fields (MLFFs) with flexible functional forms to fit the energy (and force) landscape of ab initio calculations. Typically, the energy is predicted by a (typically equivariant or invariant) neural network, whereas the forces are given by using automatic differentiation w.r.t. the positions of particles. We argue that the energy and force accuracy of machine learning force fields is no longer a limiting factor for the wide applications thereof, as most such models achieve an energy error well below the chemical accuracy of 1 kcal/mol. Besides stability and generalizability, the speed of MLFFs, is what prevents them from wide applications—although they are usually by magnitudes faster than QM calculations (and scale linearly w.r.t. the size of the system), they are still hundreds of times slower than MM force fields. For small molecule systems up to 10210^{2} atoms, some of the fastest MLFFs[30] still take around 1 millisecond per energy and force evaluation on an A100 GPU, compared to less than

0.005 milliseconds for MM force fields. As such, to simulate any biomolecular system of considerable size for a reasonably long time frame would usually have a prohibitive computational cost, significantly limiting its deployment to further our understanding of biologically relevant systems.

In this review, we direct our attention to the design space (in terms of the speed-accuracy tradeoff) between ML and MM force fields. Hoping that this would inspire the design of a class of MLFF incorporating MM philosophy that is significantly faster, more stable, more interpretable, and more generalizable, than current state-of-the-art MLFFs albeit slightly less accurate/expressive, we organize this review as follows: First, in Section II, we outline the desiderata of force fields. Secondly, in Section III and Section IV we briefly review the building blocks of both MM and ML force fields and recent advances in the functional forms and parametrizations thereof. Finally, after a discussion surrounding the datasets and best practices for fitting MM and ML force fields in Section V A, we envision the shape of the next generation of ultrafast MLFF with high utility in biomolecular modeling in Section VIII. We summarize (albeit with considerable overgeneralization) the key theoretical and practical properties discussed in this paper in Table I.

Desiderata: The balance between speed and accuracy, and beyond.

The speed and accuracy are two natural axes the community is interested in (Figure 1)—a faster and more accurate force field is almost always desired. With this in mind, we review the desired properties of a force field, regardless of its type, for the applications in physical modeling.

a. Invariance. Symmetries are inherent in all physical systems. To exploit these symmetries in model construction and parametrization enhances data efficiency as it avoids unnecessary replicated manifestations of the same piece of data and avoids unphysical model interpretations. Formally, we use equivariance and invariance to describe the symmetry in functional space:

Definition 1 (Equivariance and invariance). A function f:X→Yf:\mathcal{X}\to\mathcal{Y} is said to be equivariant to a symmetry group GG if

f(Tg(x))=Sg(f(x))(3)f(T_g(\mathbf{x}))=S_g(f(\mathbf{x})) \tag*{(3)}

and invariant if

f(Tg(x))=f(x)(4)f(T_g(\mathbf{x}))=f(\mathbf{x}) \tag*{(4)}

∀g∈G\forall g\in G and some equivalent transformations on the two spaces respectively Tg:X→XT_g:\mathcal{X}\to\mathcal{X} and Sg:Y→YS_g:\mathcal{Y}\to\mathcal{Y}.

In the three-dimensional space we happen to dwell in, the true underlying energy function adopts E(3)E(3)-invariance, where the Tg=SgT_g=S_g in Equation 3 and Equation 4 are the rotations (Tg(x)=xRT_g(\mathbf{x})=\mathbf{x}R, where R∈R3×3R\in\mathbb{R}^{3\times3} is a rotation matrix RRT=IRR^{T}=I), translations (Tg(x)=x+ΔxT_g(\mathbf{x})=\mathbf{x}+\Delta\mathbf{x}), and reflections (Tg(x)=Ref⁡θ(x)T_g(\mathbf{x})=\operatorname{Ref}_{\theta}(\mathbf{x})). These hold since the coordinate system on which the Euclidean coordinates are based is artificial and arbitrary. Similarly, since the indexing of the particles is arbitrary, permutation equivariance and invariance are also crucial: Tg(x)=Sg(x)=PxT_g(\mathbf{x})=S_g(\mathbf{x})=P\mathbf{x}, where PP is the associated permutation matrix. We also point out that there have been recent efforts showing that non-equivariant/non-invariant models can also be trained to perform on equivariant tasks[35, 36, 37].

b. Linear runtime complexity. One of the key applications of force fields in biomolecular simulations is modeling the energy landscapes of heterogeneous biomolecules, such as protein-ligand complexes. In such cases, the number of atoms of such systems can significantly exceed 10310^{3}, making the training and inference unattainably expensive if the runtime complexity is anywhere higher than quadratic O(N2)\mathcal{O}(N^{2}). At first glance, it might not be intuitive that the popular force fields, including MM (Equation 9), which have pairwise interactions, are linear. In practice, however, not all N2N^{2} pairwise interactions are present in the energy function, as a cutoff function is almost always employed to mask off any interaction with a distance longer than a threshold LL:

λ(x1,x2)={Λ(∥x1−x2∥),∥x1−x2∥<L,0,elsewhere,(5)\lambda(\mathbf{x}_{1},\mathbf{x}_{2})= \begin{cases} \Lambda(\lVert\mathbf{x}_{1}-\mathbf{x}_{2}\rVert), & \lVert\mathbf{x}_{1}-\mathbf{x}_{2}\rVert<L,\\ 0, & \text{elsewhere}, \end{cases} \tag*{(5)}

with smooth boundary condition lim⁡∥x1−x2∥→LΛ=0\lim_{\lVert\mathbf{x}_{1}-\mathbf{x}_{2}\rVert\to L}\Lambda=0. For both ML force fields, Λ\Lambda usually is typically implemented in the form of a cosine annealing; a reaction field method[38, 39] is typically used for Coulomb interactions whereas a polynomial switching function is used for van der Waals interactions. This goes hand-in-hand with the assumption of constant sparsity: on average, the number of interactions that fall within the cutoff boundary for each particle stays constant. (Note that this is a strong assumption that would not stand without prior knowledge, i.e. p(x)p(\mathbf{x}) adopts a uniform distribution.)

c. Energy conservation. Since the potential energy U(x)U(\mathbf{x}) is a state function, there is zero work associated with moving a particle through a trajectory starting and ending at the same place[18]:

W≡∮CF⋅dr=0.(6)W\equiv\oint_{C}\mathbf{F}\cdot\mathrm{d}\mathbf{r}=0. \tag*{(6)}

This is satisfied if the force is always implemented as the negative gradient of the energy:

F=−∇xU(x).(7)\mathbf{F}=-\nabla_{\mathbf{x}}U(\mathbf{x}). \tag*{(7)}

Numerically, Equation 6 always stand accurately for simple functional forms such as an MM force field, but less so for ML force fields with sophisticated functional forms.

d. Differentiability. In the previous paragraph, we have discussed the differentiation of the energy U^(x;h,Φ)\hat{U}(\mathbf{x};h,\Phi) w.r.t. x\mathbf{x}, which yields the force prediction. In MLFF, to ensure that at least the first- and second-order derivatives are smooth and further differentiable, neural activation function choices are limited to those with continuous first- and second-order derivatives, such as the ELU[40]-family. Meanwhile, if one wishes to optimize the ML force field parameters ΦFF\Phi_{\mathrm{FF}}, it is also crucial to evaluate the parameter derivative ∂U^(x;h,ΦFF)/∂ΦFF\partial\hat{U}(\mathbf{x};h,\Phi_{\mathrm{FF}})/\partial\Phi_{\mathrm{FF}}.

e. Universality. Typically, there is little prior knowledge to be encoded in the inductive bias about the ab initio energy landscape except for the fact that when particles are separated far enough, the energy approaches zero. As such, at least in a limited region, the force field should be expressive enough to represent a diverse set of functions, or ideally universal, modulo the group invariance.

Definition 2 (Universality of invariant functions). A parametrized invariant function f(⋅;Φ)f(\cdot;\Phi) is said to be universal w.r.t. a symmetry group GG on a space X\mathcal{X} if for all transformations in that symmetry group ∀T∈G\forall T\in G, and for all invariant functions gg satisfying g(T(x))=g(x)g(T(\mathbf{x}))=g(\mathbf{x}), there exists a set of parameters Φ\Phi such that ff can be approximated arbitrarily well:

∥g(x)−f(x,Φ)∥<ϵ,∀x∈X,(8)\lVert g(\mathbf{x})-f(\mathbf{x},\Phi)\rVert<\epsilon,\forall\mathbf{x}\in\mathcal{X}, \tag*{(8)}

for arbitrarily small ϵ>0\epsilon>0.

Molecular mechanics (MM)Machine learning force fields (MLFF)
GenesisMcCammon, Gelin, and Karplus [2] (1977)Behler and Parrinello [34] (2007)
Runtime ComplexityO(N)\mathcal{O}(N)O(N)\mathcal{O}(N)
Speed>1 μs / day> 1\ \mu\mathrm{s} \ /\ \mathrm{day}around 1 ns / day
InvarianceE(3)E(3)E(3)E(3)
Equivariant universalityImpossiblePossible
Accuracy>1> 1 kcal/mol≪1\ll1 kcal/mol for small molecules
StabilityUsually guaranteedNot guaranteed
TopologyUsually requiredUsually not required
Force differentiationAnalyticalAutograd
Long-range interactionsModeledUsually ignored
ParametrizationHuman-derivedAutomated
CustomizationDifficultTrivial
PlatformSpecializedTensor-accelerating frameworks

Table 1. Molecular mechanics (MM) vs. machine learning force fields (MLFF).

f. Stability. Fu et al. [41] have illustrated that for many MLFF models, the simulation would collapse into unphysical regions after a certain number of integration steps. From a data-centric perspective, this largely results from not having substantial high-energy samples in training. Tackling this problem with sampling[42] on the high-energy regions, possibly with active learning[24, 43, 44], is a data-driven way to counteract this instability, although this might lead to significantly more data as the high-energy regions (in a Tolstoyan way) are much more diverse. On the other hand, MM force fields are almost intrinsically stable since the functional forms are designed to be restrictive. The balance between expressiveness and stability resembles that between bias and variance, and given the same amount of data, can only be achieved with carefully designed inductive biases.

g. How fast is fast enough? To be able to simulate one millisecond per day[13] of macromolecular behavior is a target that modern GPU-accelerated MM frameworks strive to achieve. As such, mechanisms such as protein folding, whose time scale is milliseconds[45, 46, 47, 48, 49], can be simulated within a reasonable time frame. For small molecules, current ML force fields are about 10210^2 to 10310^3 slower than MM[30, 50]. Since they both scale linearly, it is not unreasonable to estimate that this ratio is similar for large systems.

When it comes to using these force fields to simulate biomolecular systems in a drug discovery setting, it is also worth paying attention to the economics of simulations[51]. Since the cost of one GPU hour is around $1, whereas the cheapest wet lab assay, in a high-throughput screening setting only might cost less than $100, it is highly likely that to reliably estimate an observable in silico using ML force fields might cost significantly more than measuring it in a wet lab, provided that the acquisition of the molecule and the biological system is not extraordinarily expensive.

Finally, it is worth noting that most compute resources is spent on force, rather than energy evaluations for both MM and ML force fields, and energy evaluations can even be skipped for intermediate steps. With MM, however, the forces are computed with analytical gradients rather than automatic differentiation[52]. See more discussion in Section VIII.D.

h. How accurate is accurate enough? The chemical accuracy of 1 kcal/mol has long been an empirical standard beyond which the estimation of key chemical properties consistent with experiments is qualitatively possible. In a Nobel lecture[53], Pople set this threshold as the target accuracy for the estimation of formation and ionization potentials. We also note that the discrepancies among various levels of theory are higher than this threshold, especially in high-energy regions. Moreover, the error of density functional theory (DFT) calculations also routinely exceed this number[54].

For biomolecular applications, if one were to apply a force field to calculate the binding free energies of a protein-ligand system, Mobley and Klimovich[55] have demonstrated that a 1 kcal/mol noise in the free energy would roughly translate to making a drug discovery campaign 5 times faster if the goal is to increase the association constant KaK_a by ten folds (admittedly, the noise in the free energy is not the same as the noise in the potential energy, but we provide this finding here as an empirical gauge).

In some limited chemical spaces, the state-of-the-art ML potentials have long surpassed this threshold. Take the benchmark study[56, 57] on (r)MD17[21, 58], for example, almost all competitive models have error well below 10−310^{-3} kcal/mol on all molecules, and the differences among the top 3 models usually come down to the scale of 10−210^{-2} kcal/mol. On a more diverse dataset containing organic small molecules[59, 60], to achieve accuracy significantly higher than the quantum chemical threshold of 1 kcal/mol has long been possible[61, 62].

Molecular mechanics force fields: Simple, crude, but practical for wide applications

Classical MM force fields

Molecular mechanics (MM) force fields[63, 64] are empirical models representing atomic point masses interacting through parametrized functions of atomic coordinates. These functions characterize the potential energy of a system via valence (bond, angle, and torsion) and nonbonded terms, typically expressed as the sum of polynomials and truncated Fourier series. The most popular and widely used MM force field in biomolecular modeling and simulation is the Class I MM force field, primarily due to its computational efficiency, arising from its simplified functional form which can be typically expressed as:

UMM(x;ΦFF)=∑bondKr2(rij−r0)2+∑angleKθ2(θijk−θ0)2+∑torsion∑n=1nmax⁡Kϕ,n[1+cos⁡(nϕijkl−ϕ0)]+∑Coulomb14πε0qiqjrij+∑van der Waals4εij[(σijrij)12−(σijrij)6],(9)\begin{aligned} U_{\mathrm{MM}}(\mathbf{x};\Phi_{\mathrm{FF}}) ={}& \sum_{\mathrm{bond}} \frac{K_r}{2}(r_{ij}-r_0)^2 \\ &+ \sum_{\mathrm{angle}} \frac{K_\theta}{2}(\theta_{ijk}-\theta_0)^2 \\ &+ \sum_{\mathrm{torsion}} \sum_{n=1}^{n_{\max}} K_{\phi,n}\left[1+\cos(n\phi_{ijkl}-\phi_0)\right] \\ &+ \sum_{\mathrm{Coulomb}} \frac{1}{4\pi\varepsilon_0}\frac{q_iq_j}{r_{ij}} \\ &+ \sum_{\mathrm{van\ der\ Waals}} 4\varepsilon_{ij}\left[\left(\frac{\sigma_{ij}}{r_{ij}}\right)^{12}-\left(\frac{\sigma_{ij}}{r_{ij}}\right)^6\right], \tag*{(9)} \end{aligned}

where the total potential energy UMMU_{\mathrm{MM}} as a function of the coordinates of the system x\mathbf{x} and the collection of force field parameters (Also see Section VI B) ΦFF={Kr,Kθ,r0,θ0,Kϕ,n,ϕ0,q,σ,ε}i\Phi_{\mathrm{FF}}=\{K_r,K_\theta,r_0,\theta_0,K_{\phi,n},\phi_0,q,\sigma,\varepsilon\}_i is modeled as the sum of bond, angle, torsion, and nonbonded energy. The bond, angle, and torsion force constants are represented as KrK_r, KθK_\theta and Kϕ,nK_{\phi,n}, with their equilibrium values and phases denoted as r0r_0, θ0\theta_0 and ϕ0\phi_0, respectively. The atomic point charges are represented by qq, while ε\varepsilon and radii σ\sigma parametrize the Lennard-Jones energy well. ri,jr_{i,j}, θi,j,k\theta_{i,j,k}, ϕi,j,k,l\phi_{i,j,k,l}—which represents the distance between covalently bonded atoms ii, jj, the angle among i−j−ki-j-k, and the dihedral angle between the planes formed by i,j,ki,j,k and j,k,lj,k,l, respectively—are simple functions extracted from the coordinates xi,j,k,l\mathbf{x}_{i,j,k,l}. In practice, such operations can be implemented as:

ri,j=∥x⃗ij∥=∥xi−xj∥;(10)r_{i,j}=\lVert\vec{x}_{ij}\rVert=\lVert x_i-x_j\rVert; \tag*{(10)}
θi,j,k=atan2⁡(∥x⃗ij×x⃗jk∥,x⃗ij⋅x⃗jk);\theta_{i,j,k}=\operatorname{atan2}\left(\lVert\vec{x}_{ij}\times\vec{x}_{jk}\rVert,\vec{x}_{ij}\cdot\vec{x}_{jk}\right);
ϕi,j,k,l=atan2⁡(((x⃗ij×x⃗jk)×(x⃗jk×x⃗kl))⋅x⃗jk∥x⃗jk∥,((x⃗ij×x⃗jk)⋅(x⃗jk×x⃗kl))).\phi_{i,j,k,l}=\operatorname{atan2}\left( \frac{\left((\vec{x}_{ij}\times\vec{x}_{jk})\times(\vec{x}_{jk}\times\vec{x}_{kl})\right)\cdot\vec{x}_{jk}}{\lVert\vec{x}_{jk}\rVert}, \left((\vec{x}_{ij}\times\vec{x}_{jk})\cdot(\vec{x}_{jk}\times\vec{x}_{kl})\right) \right).

An out-of-plane term, known as the improper torsion, can be also introduced with the torsion term to enhance the molecular planarity and prevent chiral inversions. In theory, multipole expansion—such as dipole and quadrupole moments—are necessary to accurately represent the quantum mechanical electrostatic potential. However, empirical force fields try to approximate this multipole expansion by assigning point charges localized at the nuclei of atoms, sometimes with virtual sites to model lone pairs and σ\sigma-holes[65, 66, 67], in order to reproduce the same electrostatic potential that would be given by the true electronic structure and electron density distribution. The van der Waals interaction combines repulsive and attractive forces, typically represented by a 12-6 Lennard-Jones potential. The Lorentz–Berthelot[68] combining rules can be employed to determine σ\sigma and ε\varepsilon between different atom types, though alternative combination rules are possible[69]. The r−12r^{-12} term accounts for short-range repulsion due to Pauli exclusion, preventing atom collapse, while the r−6r^{-6} term represents weak attraction from interactions between permanent and induced dipoles such as the London dispersions.

This subsection and Table III A have surveyed only the simplest and most traditional MM force fields, the efforts to enhance the expressiveness via additional terms are discussed in Section VI A.

The toolbox of composable operations for machine learning force fields.

While there has been a plethora of previous work focused on developing and applying system-specific MLFFs to homogeneous media and benchmarking various MLFF architectures on datasets of small biologically relevant organic molecules[18, 27, 31, 83, 84, 85], there have been relatively few applications to date employing MLFFs in lieu of traditional MM models for extended MD simulations of large biomolecular systems.

Part of the challenge in developing MLFFs for large biomolecular systems stems from the computational challenge of constructing datasets of ab initio energies and forces for these large heterogeneous systems. Unlike homogeneous systems such as liquid water where one can simply train a MLFF on smaller periodic boxes or clusters of water and readily apply the trained MLFF to simulations for larger periodic boxes[86], the chemical heterogeneity and the importance of long-range interactions in proteins[87] renders their decomposition into smaller, computationally more tractable training structures less straightforward. Alternatively, one could simply construct datasets encompassing the entirety of large biomolecular systems using energies and forces obtained from QM/MM evaluations. However, in addition to the QM/MM evaluations still potentially being expensive depending on the target QM method and size of the QM region, expending training resources on such large structures where most of the interactions are probably described purely at the MM-level seems wasteful.

Recently, several MLFFs trained to diverse datasets encompassing tens of thousands molecules (See Table III and § 2 A) have demonstrated the potential of bottom-up approaches to developing general-purpose MLFFs that can be readily applied to large biomolecules not wholly represented in the respective training sets[23, 60, 61, 88, 89, 90, 91, 92]. Some of the earlier general-purpose MLFFs were limited in applicability due to their training set and model architectures not explicitly accounting for charged species[23, 60], but were still usable for conducting stable MD simulations for smaller proteins[93] or in mixed-level ML/MM simulations[94, 95, 96, 97, 98, 99]. However recently, general-purpose MLFFs based on the MACE[56, 61] and GEM[91] models have been successfully used to generate MD trajectories of the solvated crambin protein (18,000–25,000 atoms) for which the simulated THz-region vibrational modes, characteristic of slow collective protein motions, seem to show better agreement with the experimental spectrum than what is obtained using AmberFF[61]. Perhaps the largest demonstration to date of applying a general-purpose MLFF is the use of an Allegro[31] model, trained to the SPICE dataset[59], for an all-atom MD simulation of the solvated HIV capsid consisting of 44-million atoms that achieves 8.7 timesteps/s when employing 5120 A100 GPUs[91].

PotentialExpressionDescription
Bond
Harmonic potentialU(r)=K(r−r0)2U(r)=K(r-r_0)^2KK: spring constant
Morse potential[70]U(r)=D(1−e−α(r−r0))2U(r)=D\left(1-e^{-\alpha(r-r_0)}\right)^2DD: well depth, α\alpha: width of the potential
Angle
Harmonic potentialU(θ)=K(θ−θ0)2U(\theta)=K(\theta-\theta_0)^2KK: bending constant
CHARMM potential[71]U(θ)=K(θ−θ0)2+KUB(r−rUB)2U(\theta)=K(\theta-\theta_0)^2+K_{UB}(r-r_{UB})^2KUBK_{UB}: constant for Urey-Bradley term<br>rUBr_{UB}: equilibrium bond length between 1st and 3rd atoms
Cosine squared potential[72]U(θ)=12K[cos⁡(θ)−cos⁡(θ0)]2U(\theta)=\frac{1}{2}K[\cos(\theta)-\cos(\theta_0)]^2KK: bending constant
Torsion
Cosine potentialU(ϕ)=K[1+cos⁡(nϕ−ϕ0)]U(\phi)=K[1+\cos(n\phi-\phi_0)]KK: bending constant<br>nn: multiplicity representing the periodicity
OPLS potential[73]U(ϕ)=K1[1+cos⁡(ϕ)]+12K2[1−cos⁡(2ϕ)]+12K3[1+cos⁡(3ϕ)]+12K4[1−cos⁡(4ϕ)]U(\phi)=K_1[1+\cos(\phi)]+\frac{1}{2}K_2[1-\cos(2\phi)]+\frac{1}{2}K_3[1+\cos(3\phi)]+\frac{1}{2}K_4[1-\cos(4\phi)]K1,K2,K3,K4K_1,K_2,K_3,K_4: bending constants
van der Waals
Lennard-Jones (12-6) potential[74]U(r)=4ε[(σr)12−(σr)6]U(r)=4\varepsilon\left[\left(\frac{\sigma}{r}\right)^{12}-\left(\frac{\sigma}{r}\right)^6\right]ε\varepsilon: well depth, σ\sigma: distance when U(r)=0U(r)=0
Buckingham potential[75, 76]U(r)=Ae−r/ρ−Cr6U(r)=Ae^{-r/\rho}-\frac{C}{r^6}AA and CC: well depth, ρ\rho: width of the potential
Morse potential[70, 77, 78]U(r)=D[e−2α(r−r0)−2e−α(r−r0)]U(r)=D\left[e^{-2\alpha(r-r_0)}-2e^{-\alpha(r-r_0)}\right]DD: well depth, α\alpha: reciprocal length
Double exponential potential[79, 80, 81]U(r)=ε[βeαr/r0α−βexp⁡(−αrr0)−αeβr/r0α−βexp⁡(−βrr0)]U(r)=\varepsilon\left[\frac{\beta e^{\alpha r/r_0}}{\alpha-\beta}\exp\left(-\alpha\frac{r}{r_0}\right)-\frac{\alpha e^{\beta r/r_0}}{\alpha-\beta}\exp\left(-\beta\frac{r}{r_0}\right)\right]ε\varepsilon: well depth<br>α\alpha and β\beta: steepness of the repulsive and attractive interactions, respectively

Table II. Representative intramolecular and intermolecular potentials[82]. r0r_0, θ0\theta_0 and ϕ0\phi_0 represents equilibrium bond distance, bond angle and dihedral angle, respectively.

On the other hand, system-specific bottom-up approaches leveraging molecular fragmentation schemes, specifically electrostatically embedded generalized molecular fractionation with conjugate caps (EE-GMFCC)[100, 101, 102], generalized energy-based fragmentation (GEBF)[103], and residue-based systematic molecular fragmentation (rSMF)[104], have also been used to develop datasets to train MLFFs for specific proteins[29, 93, 104, 105, 106]. As a proof of concept, Cheng et al. [93] demonstrate that the GEBF method can be applied to specific proteins (1XQ8, 1013 atoms) to create relatively small datasets of fragments (5020 configurations across 65 fragments) that can be used to train accurate MLFFs for MD simulations. Unsurprisingly, their MLFFs trained to this dataset give more accurate energy and force predictions, as compared to the reference method (DFT using the ω\omegaB97X-D functional), for the target protein system than the general-purpose ANI-1x[23].

Here, we briefly review the composable operations frequently used in the construction of MLFF in the lens of the desired properties discussed in Section II.

a. Atomistic decomposition of energy. Most, if not all MLFF models decompose the total energy into a sum of per-atom energies:

U=∑iUi,(11)U=\sum_i U_i, \tag*{(11)}

where each UiU_i is a function of the local atomic environments within a spatial cutoff radius. Although widely adopted in MLFFs, this approach lacks a rigorous physical foundation, as the concept of per-atom energy is not well-defined in many-body quantum systems. Nonetheless, this treatment is consistent with the graph-level readout that graph neural networks (GNNs) use for graph-level regression and is trivial to implement in machine learning programs.

b. Equivariant and invariant features. It has been outlined in Section II that an ideal force field U^(x)\hat{U}(\mathbf{x}) should be an E(3)E(3)-invariant function of x\mathbf{x}. It has been illustrated in Wang and Chodera[30], Unke and Meuwly[85], Thölke and Fabritius[107], Schütt, Unke, and Gastegger[108], however, that intermediate equivariant representations can boost the expressiveness and performance of invariant models. Concretely, w.r.t. a group GG, an invariant function y=f(x)y=f(\mathbf{x}) can be constructed as the product of an invariant function gIg_I and an equivariant function gEg_E as:

y=f(x)=gI(gE(x))(12)y=f(\mathbf{x})=g_I(g_E(\mathbf{x})) \tag*{(12)}

The equivariant-invariant mapping gIg_I is also called a scalarization. In practice, a modern MLFF usually keeps track of both invariant and equivariant features and updates them simultaneously. So the functional signature of a GG-equivariant MLFF layer operating on both invariant h∈Hh \in\mathcal{H} and equivariant x∈Xx \in\mathcal{X} (w.r.t. the same space) features f:H⊕X→H⊕Xf:\mathcal{H} \oplus\mathcal{X} \to\mathcal{H} \oplus\mathcal{X} can be written as:

x′,h′=f(x,h),(13)x',h' = f(x,h), \tag*{(13)}

where we have:

Tg(x′),h′=f(Tg(x),h),∀Tg∈G.(14)T_g(x'),h' = f(T_g(x),h),\forall T_g \in G. \tag*{(14)}

c. Message passing. Most spatial GNNs[109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119] on topological graphs (without geometry features) adopt a message passing framework. Following the framework from Xu et al. 112 and Battaglia et al. 113, the kk-th layer of a GNN could be written as two steps—neighborhood aggregation:

av(k)=ρ(k)(hu(k−1),u∈N(v)),(15)a_v^{(k)} = \rho^{(k)}\left(h_u^{(k-1)},u \in\mathcal{N}(v)\right), \tag*{(15)}

and node update:

hv(k)=ϕ(k)(hv(k−1),av(k)),(16)h_v^{(k)} = \phi^{(k)}\left(h_v^{(k-1)},a_v^{(k)}\right), \tag*{(16)}

where hvkh_v^k is the feature of node vv at kk-th layer, hv0=xvh_v^0 = x_v and N(⋅)\mathcal{N}(\cdot) denotes the operation to return the multiset of neighbors of a node. More concisely, omitting the nonlinear transformation step ϕ\phi ubiquitous in all neural models, and assuming a convolutional aggregate function, ρ=SUM\rho= \mathrm{SUM} or ρ=MEAN\rho= \mathrm{MEAN}, a graph neural network layer is characterized by the aggregation/convolution operation that pools representations from neighboring nodes, forming an intermediary representation X′X', which on a global level, with activation function σ\sigma and weights WW, can be written as:

X′=σ(A^XW)(17)X' = \sigma(\hat{A}XW) \tag*{(17)}

The difference among GNN architectures, apart from the subsequent treatment of the resulting intermediate representation X′X', typically amounts to the choices of transformations (A^)(\hat{A}) of the original adjacency matrix (A)(A)—the normalized Laplacian for graph convolutional networks (GCN)[110], a learned, sparse stochastic matrix for graph attention networks (GAT)[120], powers of the graph Laplacian for simplifying graph networks (SGN)[121], and the matrix exponential thereof for graph neural diffusion (GRAND)[122]. To expand these frameworks to incorporate geometry information, the layers to incorporate coordinates surveyed in this section can be plugged into Equation (15) and Equation (16). We also note that the convolution operator in Equation (17) is the root of a plethora of performance pathologies including over-smoothing[123, 124], over-squashing[125, 126] and limited expressiveness[112, 127, 128], and alternative forms of GNNs[129] might be needed to address them to make them more expressive and robust.

d. Gaussian smearing. Distances among particles are arguably the simplest and most crucial invariant feature—with a distance matrix, the coordinates of the particles can be reconstructed modulo the E(3)E(3)-equivariance, and all invariant functions can be approximated arbitrarily well. Nevertheless, to blindly throw the distances into a neural network yields only highly correlated representations[130], as the detailed change in the distances is unlikely to be reflected in the activation of a large neural network. Since Behler and Parrinello 34, the Gaussian-smeared distances have been used widely as a radial, invariant feature. The most generic form of Gaussian smearing resembles the radial basis function (RBF) kernel:

K(x,x′)=exp⁡(−∥x−x′∥22σ2).(18)K(x,x') = \exp\left(-\frac{\lVert x-x'\rVert^2}{2\sigma^2}\right). \tag*{(18)}

By carefully choosing a set of evenly spaced x0′,x1′,…,xi′,…,xk′x'_0,x'_1,\ldots,x'_i,\ldots,x'_k, Equation (18) yields a kk-dimensional vector with maximal convoluted signal at xi′x'_i, resolution defined by xi+1′−xi′x'_{i+1}-x'_i, and sensitivity controlled by σ\sigma.

e. Angular symmetry function. Also proposed in Behler and Parrinello 34, the angular symmetry function takes the angles among triplets of atoms (which can be calculated using Equation (10)) directly in a neural network. This term closely resembles how MM encodes angular environment, albeit with a more expressive function. Many popular MLFFs, most notably Smith, Isayev, and Roitberg[131], incorporate this feature locally to account for angular environments.

f. Dot product scalarization. If we center our view around each particle and do not consider the translation invariance, the group we consider would be O(3)O(3) rather than E(3)E(3), and all O(3)O(3)-invariant functions can be universally approximated using the dot products among the inputs.

Lemma 3 (First Fundamental Theorem[132] for O(n)O(n)). If ff is an O(n)O(n)-invariant scalar function of vector inputs v1,…,vn∈RDv_1,\ldots,v_n \in\mathbb{R}^D, then f(v1,v2,…,vn)f(v_1,v_2,\ldots,v_n) can be written as a function of only the scalar products of the viv_i. That is, there is a function g(⋅)g(\cdot) such that

f(v1,v2,…,vn)=g(VTV)=g((⟨vivj⟩)i,j=1n)(19)f(v_1,v_2,\ldots,v_n) = g(V^{\mathsf{T}}V) = g\left((\langle v_i v_j\rangle)_{i,j=1}^{n}\right) \tag*{(19)}

This lemma is the theoretical cornerstone of a number of locally universal MLFF models[30, 85, 107, 108]. It is worth mentioning, however, that function gg in Lemma 3 is not necessarily permutation invariant, and extra care is needed to design O(3)O(3)-invariant, permutationally invariant, and universal functions. Wang and Chodera 30, for example, neurally parametrizes a series of edge vectors prior to the dot product.

g. Linear combination of equivariant features. Ignoring the translational equivariance again and considering only the O(3)O(3) (or O(n)O(n)) group, the linear combination of equivariant features is naturally equivariant, and the linear combination of equivariant maps {fi}\{f_i\}

F(x)=∑iλifi(x)(20)F(x) = \sum_i \lambda_i f_i(x) \tag*{(20)}

where λi\lambda_i are constants, are also equivariant. In practice, this summation can be implemented as a linear transform, or a single-layer neural network without biases or activation, operated on the last dimension of a RN,3,D\mathbb{R}^{N,3,D} vector representation. Moreover, the coefficients {λi}\{\lambda_i\} can also be calculated from the invariant representations.

h. Spherical harmonics. Batzner et al. 28, Musaealian et al. 31, Batia et al. 56, Thomas et al. 133 construct SO(3)SO(3)-equivariant (removing both the translation and reflection transformations from E(3)E(3) convolution filters to be products of radial (invariant) functions and spherical harmonics,

F(r⃗)=R(r)Ym(l)(r⃗),(21)F(\vec{r}) = R(r)Y_{m}^{(l)}(\vec{r}), \tag*{(21)}

which can be contracted with the Clebsch-Gordan coefficients to form higher-order tensor products. Currently, the class of models using these representations make up the most accurate MLFFs, although it has been outlined in Lemma 3 that they are not required for universality.

Best practices and pitfalls.

We have been insofar discussing the functional form of force fields U^(x;h,Φ)\hat{U}(\boldsymbol{x};\boldsymbol{h},\boldsymbol{\Phi}), but in order to design a practical U^\hat{U}, one needs to find a set of optimal parameters by maximizing the likelihood of some particular force and energy data. In this section, we briefly review the popular datasets used in the curation of MM and ML force fields and the best practices for training and evaluation.

Datasets

a. A note on the QM target. There has been little consensus, when it comes to biomolecular applications, regarding which QM levels of theory might correspond best to experimental measurements[141]. As a result, popular datasets (see Table III) are curated with various levels of theory and sampling strategies, making the merging of the data difficult, demanding meta-learning solutions[142]. Before further evidence would emerge, if the field were to agree on a single level of theory for a community-wide effort to push for high-quality, high-volume data for MLFF training, cheaper targets might be more appealing.

When developing novel MLFFs, it is also worth reminding ourselves that all we are trying to fit is a known function that can be solved analytically. One can view the QM energy function not as a reservoir of data but a surrogate, from which repeated acquisition is possible. Active learning techniques, such as Smith et al. 24, Wang et al. 43, Schwalbe-Koda, Tan, and Gómez-Bombarelli 44, present a useful avenue to gather data in a rationally parsimonious fashion.

b. Chemical diversity and conformational diversity. Conceptually, to accurately fit energies and forces on all chemical spaces is no different than having the MLFF model able to solve the Schrödinger’s equation, which seems impossible, judging from the no free lunch theorem[143]. To this end, QM datasets are always curated with biases, in terms of the coverage on chemical spaces and conformational landscape.

Within the chemical space of (bio)organic molecules, MD17[21] is among the most popular datasets used for MLFF benchmark. Consisting of DFT calculations of 10 small organic molecules (benzene, uracil, naphthalene, aspirin, salicylic acid, malonaldehyde, ethanol, toluene, paracetamol, and azobenzene) with fewer than 1 million snapshots each, it is limited in chemical diversity. Christensen and von Lilienfeld[144] further revised this dataset to reduce the noise. There are also high-quality QM datasets focusing on single molecules such as 3BPA[145], and AcAc[146]. ISO17[30], on the other hand, is slightly more chemically diverse as it samples 129 isomers of C7O2H10\mathrm{C}_{7}\mathrm{O}_{2}\mathrm{H}_{10} with 5000 snapshots each. In contrast, QM9[136], like its predecessors, is rich in chemical diversity but not conformational diversity—it contains more than 134k small molecules, although all in low-energy state.

Moving on to larger datasets emphasizing utility beyond just proof-of-concept, ANI1[137] and ANI2[26] dataset, containing 20 million off-equilibrium snapshots, is among the most popular datasets that are simultaneously chemically and conformationally diverse, albeit no QM forces were annotated, which would be more information-rich than energies. SPICE[59, 147] also displays a vast chemical and conformational diversity on 2 million conformations of small molecules and peptides, with forces annotated. The SPICE[59] dataset, along with many diverse datasets for (bio)molecules, has been generated on the QCFractal platform[148], which is being used to actively run QM calculations to curate the next generation of datasets for MLFF fitting.

Another community-driven project, ColabFit[149] Exchange curates an open-source, diverse database containing a large collection of systematically organized datasets from multiple chemistry/materials domains that are especially designed for ML atomistic model development (providing physical units standardization, a unified data standard, integrated data loaders, etc.). To date, the database contains 372 datasets containing more than 180M atomic configurations and 500M properties, spanning over 100 thousand different chemistries, and it is constantly expanding.

In principle, topology-free MLFFs are more naturally suited for simulating chemical bond-breaking and forming events than standard FFs, and would enable the simulation of fundamental biochemical processes like enzymatic reactions for which ab initio accuracy and FF efficiencies would ideally be employed. However, in practice, the curation of datasets to train MLFFs to accurately model chemical reactions presents additional challenges[150], the same age-old challenges associated with sampling rare events, as compared to developing models for equilibrium sampling of unreactive systems. In order to efficiently sample higher-energy training configurations representative of reaction pathways, various techniques have been employed ranging from simply running unbiased MD simulations at elevated temperatures[151, 152] and identifying minimum energy paths[153, 154, 155] to other approaches incorporating biased MD simulations leveraging enhanced sampling algorithms in active learning protocols[156, 157, 158, 159].

Lastly, we note that training on condensed-phase properties has only been very recently[160] possible. MM force fields are, on the other hand, usually successful in faithfully reproducing these properties[161]. These largely depend upon the intermolecular interactions, whereas long-range interactions are traditionally neglected in MLFFs (prior to SPICE[59], the datasets used to curate MLFFs only include intramolecular interactions).

DatasetElementsChemical spaces# Molecules# ConformersLevel of theorySampling
MD17[18, 58]C,H,OSmall molecules up to 21 atoms102.7mDFTPath-integral MD
MD22[83]C, H, O, NSmall molecule w/ 42 ∼ 270 atoms722kPBE+MBD[134, 135]MD
QM9[136]C, H, O, N, FSmall molecule134k134kB3LYP/6-31G(2df,p)Minimized
ANI-1[137]C, N, O, FSmall molecules up to 11 heavy atoms57,46224,687,809DFTDFT-optimized + normal mode
ANI-2[60]H, C, N, O, S, F, Clsmall molecules13,4054,695,707wB97X/631Gddimer, normal mode, torsion sampling, and active learning
OrbNet Denali[138, 139]H, Li, B, C, N, O, F, Na, Mg, Si, P, S, Cl, K, Ca, Br, Iorganic moleculesDFT15,0002.3 millionnormal mode + MD
SPICE[59]Li, C, N, O, F, Na, Mg, P, S, Cl, K, Ca, Br, ISmall molecules peptides, ion pairs19k1.1mω\omegaB97M-D3(BJ)/def2-TZVPPDMD + Minimization

Table 3. Popular datasets used to curate force fields. For a more comprehensive list, see Ullah and Dral [140].

Training and evaluation

We observe that, in recent literature on MLFFs, the community is converging on a set of practices for efficient training and fair comparison of MLFF models. Certain practices, such as extremely small batch size, exponentially decaying learning rate, and parsimonious use of normalization, are common in the curation of highly performant MLFFs. Since the forces and energies, and thereby force errors LF\mathcal{L}_{F} and energy errors LU\mathcal{L}_{U}, for instance measured in mean-squared-error, are of different units, one has to apply a set of perhaps physically meaningless constants to combine them as the loss function L\mathcal{L}:

LU=∥U^−U∥2,(22)\mathcal{L}_{U} = \left\|\hat{U}-U\right\|^{2}, \tag*{(22)}
LF=13N∑i=1N∑α=13∥−∂U^∂ri,α−Fi,α∥2,(23)\mathcal{L}_{F} = \frac{1}{3N}\sum_{i=1}^{N}\sum_{\alpha=1}^{3}\left\|-\frac{\partial\hat{U}}{\partial r_{i,\alpha}}-F_{i,\alpha}\right\|^{2}, \tag*{(23)}
L=λULU+λFLF.(24)\mathcal{L} = \lambda_{U}\mathcal{L}_{U}+\lambda_{F}\mathcal{L}_{F}. \tag*{(24)}

Empirically, when using atomic units, LF/LU\mathcal{L}_{F}/\mathcal{L}_{U} within the range 100 ∼ 1000 usually yields the best results.

It is worth reminding that, while the MSE (Equation (23)) and RMSE error on forces are E(3)E(3)-invariant, the MAE loss on forces is not, and is dependent upon the choice of the coordinate systems.

LF,MAE=13N∑i=1N∑α=13∣−∂U^∂ri,α−Fi,α∣(25)\mathcal{L}_{F,\mathrm{MAE}}=\frac{1}{3N}\sum_{i=1}^{N}\sum_{\alpha=1}^{3}\left|-\frac{\partial\hat{U}}{\partial r_{i,\alpha}}-F_{i,\alpha}\right| \tag*{(25)}

In a sense, this error has a bias to favor the conformations more aligned with the axes. It is alarming to see that this biased and arguably erroneous metric has been used widely in both the training and evaluation stages of MLFF models incorporating force matching.

The aforementioned error is a typical example of how error-prone the implementation of MLFF modules is—some intuitively benign operations might break the symmetry without catching the eyes of a seasoned engineer-researcher. Thus, we recommend that an equivariance/invariance unit test be included in all modules of MLFF implementation. An example test suite for a function ff that works on both SE(3)SE(3) invariant (hh) and equivariant (xx) representations (See Equation (13)) can be implemented in 5 lines, using NumPy[162], for example:

def test_equivariant_and_invariance(f, h, x):
    # random translation
    import numpy as np
    T = np.random.randn(1, 3)

    # random rotation
    R = np.linalg.qr(
        np.random.randn(3, 3))[0]

    # random transformation
    F = lambda x: x @ R + T

    # assert h changed
    # and x transformed accordingly
    h, x = f(h, x); h1, x1 = f(h, F(x))
    assert(
        np.allclose(h, h1)
        & np.allclose(F(x), x1)
    )

Making MM more accurate

Functional forms: more, but only slightly more, than harmonics and Fourier series.

The choice and design of functional forms (see Table III A) themselves limit the flexibility and expressiveness of the force field. For instance, the Lennard-Jones 12-6 potential, described in Equation (9), was developed decades ago and has been widely adopted since, despite the existence of alternative approaches[69, 80]. Enriching the complexity of the MM functional form has long been an area of intensive research. Notably, Class II MM force fields[163, 164, 165] replace the harmonic terms in Equation 9 with more much more flexible terms such as:

  • Higher order polynomials: The harmonic terms for bonds and angles can be rewritten to incorporate higher kk-order polynomials in the form of (reusing the notation from Equation 9):

∑bond∑kKk(rij−rk)2;∑angle∑kKk(θij−θk)2.(26)\sum_{\text{bond}}\sum_k K_k(r_{ij}-r_k)^2;\qquad\sum_{\text{angle}}\sum_k K_k(\theta_{ij}-\theta_k)^2. \tag*{(26)}

Since the geometry of a system is uniquely defined by the inter-atomic distances, given sufficiently high-order polynomials and dense enough bond connections, this functional form can be made universal.

  • Coupling terms: Terms like bond displacement, angle displacement, and Fourier series for (proper and improper) torsions can be combined multiplicatively to form bond-bond coupling (showing here as an example),

∑bond∑bondKbond,bond(ri0j0−r0)(ri1j1−r1),(27)\sum_{\text{bond}}\sum_{\text{bond}} K_{\text{bond,bond}}(r_{i_0j_0}-r_0)(r_{i_1j_1}-r_1), \tag*{(27)}

angle-angle coupling, bond-angle coupling, bond-torsion coupling, angle-torsion coupling, or torsion-angle-angle coupling.

In a similar spirit, Xie, Rupp, and Hennig [166] constructs ultra-fast machine learning potentials using B-splines and parametrizes using machine learning approaches. On a simple test system, this force field has a favorable tradeoff between speed and accuracy and is guaranteed to be smooth.

On the other hand, polarizable force fields, such as Drude[167] and AMOEBA force fields[168], incorporate the ability to dynamically adjust the distribution of atomic charges in response to the local electrostatic environment and generally involve a self-consistent calculation of induced dipoles. These can be augmented with neural networks to account for missing contributions[169]. Reactive force fields, such as ReaxFF[170, 171], can handle bond breaking and forming during simulations by dynamically updating bond orders, based upon interatomic distances, for every simulated MD frame and making the relevant energy terms dependent on those bond orders. Empirical valence bond (EVB) models[172] also enable the use of standard MM force fields for reactive simulations[173, 174, 175, 176], but require the parametrization of a coupling term between the reactant and product states for a particular system. These have traditionally been system-specific, but recent work has focused on developing transferable parametrizations of EVB models across different reactive systems[177]. However, improving force field accuracy by introducing more expressive and additional functional terms comes with increased computational costs, which may not justify the trade-off between accuracy and speed, and significantly increases the complexity of force field parametrization.

Parametrization: from engineer-years to GPU-days

Another challenge in developing a reliable, robust and extensible MM force field is the parametrization scheme—the assignment of the parameter set ΦFF\Phi_{\mathrm{FF}}—which must ensure comprehensive chemical coverage across the broad and heterogeneous chemical space relevant to biomolecular systems.

The determination of ΦFF\Phi_{\mathrm{FF}} has traditionally been reliant on a human labor-intensive, inflexible, and inextensible rule-based scheme named atom typing—it classifies atoms into discrete categories representing distinct chemical environments. This classification enables MM parameters to be subsequently assigned from a tabulated table of relevant atomic, bond, angle, and torsion parameters. For example, in the case of small molecules, atom types are determined by the attributes of the atom, such as element identity, hybridization, and aromaticity, as well as the attributes of the neighboring atoms and their connected bonds, and the number of neighboring atoms. For amino acids, the atom types are traditionally assigned according to the residues. Most of these atom types have a receptive field of two or three bonds, and chemical motifs outside this receptive field are generally not realized. After the atom types are determined, the bond, angle, and torsion types are determined simply by composing (using the AND operation and dictionary look up) atom types, and as a result, KK atom types can nearly lead to K4K^4 torsion types without simplification. The van der Waals interactions, on the other hand, are usually described with Lennard-Jones 12–6 potentials using the Lorentz-Berthelot[68] combining rules to determine σ\sigma and ϵ\epsilon between different atom types.

The force field parameters can be further optimized in a systematic manner using ensemble reweighting method[178, 179, 180] and machine-learning methods[181, 182]. However co-optimizing the discrete chemical perception defined by the rule-based atom types and continuous force field parameters remains intractable. In general, the force field accuracy is constrained by the resolution of chemical perception. Efforts to improve the accuracy by increasing the number of atom types lead to a combinatorial explosion of required types.

Although there are efforts to automate the development and parametrization process[183, 184, 185, 186, 187], human expertise remains essential, introducing challenges in adjusting existing parameters to accommodate new ones, particularly when extending the force field to new chemical domains of interest. In addition, biomolecular systems are inherently heterogeneous, making MM force field optimization challenging. The popular AmberTools 23 package, for instance, combines independently developed force fields for chemical subspaces including proteins[188], DNA[189], RNA[191], water[192, 193, 194], monovalent[195, 196] and divalent[197, 198, 199] counterions, lipids[200], carbohydrates[201], glycoconjugates[202, 203], small molecules[204, 205], post-translational modifications[206], and nucleic acid modifications[207]—crystallized from more than 100 engineer-years of effort. Nevertheless, there is no guarantee that the optimized solution for each class will constitute the globally optimized solution.

a.a. Substructure pattern matching Substructure pattern matching approaches[208, 209, 210] represent another class of force field parametrization schemes that focus more directly on chemical perception than the traditional atom-typing methods. The Open Force Field Initiative[211], for instance, has developed an ecosystem of toolkits[212] and force field releases[19] that use standard SMARTS-based chemical substructure queries[208] to assign entire sets of valence parameters (atoms, bonds, angles, torsions) in a hierarchical manner. These approaches help mitigate the combinatorial explosion of parameters and significantly reduce atom type redundancy while maintaining the force field accuracy. For example, the latest Sage force field (openff-2.2.0[213]) from the Open Force Field Initiative contains 187 torsion parameters, approximately 800 times fewer than the OPLS3e force field[214] which relies on atom-typing. Furthermore, the reduced complexity of substructure-based approaches facilitates the automated fitting of parameters for specific force fields, such as through the use of ForceBalance[179]. However, determining and refining substructure patterns for more reliable force fields still requires a human-in-the-loop approach, combining human expertise with automated[215] procedures.

b. Graph-based chemical perception: molecular topology as a graph Applying graph neural networks (GNNs) for more robust and extensible MM force field parametrization is another emerging area[20, 182, 216, 217, 218, 219, 220, 221, 222, 223, 224]. For example, Takaba et al. [20], Wang et al. [216] have demonstrated the ability to replace traditional rule-based discrete atom-typing schemes with continuous atomic representations generated by neural networks operating directly on chemical graphs using an end-to-end differentiable framework. The neural network parameters are optimized directly through standard machine learning frameworks to fit quantum chemical and/or experimental data. These approaches enable the co-optimization of chemical perceptions, represented as continuous atom embeddings, alongside continuous force field parameters. For example, the latest Espaloma force field[20], trained in less than one GPU day on a vast chemical space (comprising 17k molecules and over 1 million QM snapshots) consisting of small molecules, peptides, proteins, and RNAs, has shown the capability to accurately predict not only energy and forces but also, when used in MD simulations, NMR observables, and protein-ligand binding free energies. This demonstrates a promising path forward for the flexible and efficient curation of molecular mechanics (MM) force fields. Nevertheless, Leonard-Jones parameters are not learned in this framework, which is required to complete a force field.

Making ML force fields faster

As of now, almost all the fastest ML force fields use dot-product scalarization (Lemma 3) to compute the energies and automatic differentiation to compute the forces.

a. Accelerating SO(3) convolutions. Although the spherical harmonics-based SO(3)-equivariant representations have been shown to be performant and data-efficient in constructing MLFFs[28, 31, 56, 133], an LL-degree tensor convolution would require O(L6)\mathcal{O}(L^6) complexity. Passaro and Zitnick[225] addresses this issue by reducing SO(3) convolutions to SO(2) without losing information. Luo, Chen, and Krishnapriyan[226] also achieves such cubic complexity by performing the convolution in the Fourier space and using Gaunt coefficient

rather than the Clebsch-Gordan coefficients. Cheng[227], on the other hand, performs the atomic cluster expansion[145] directly in the Cartesian coordinate system.

b. Machine learning for coarse-graining. Coarse-graining (CG)[228, 229, 230, 231] refers to the technique to group atoms into larger particles termed beads, whose interactions are used to approximate the interaction energy among atoms. This enables the simulation of slow, collective motions while averaging out fast, local movements. For NN atoms with coordinates x∈RN×3\mathbf{x} \in\mathbb{R}^{N \times3}, and nn beads x∈Rn×3\mathbf{x} \in\mathbb{R}^{n \times3}, the CG operator can be written as:

x=PX,(28)\mathbf{x} = \mathbf{P}\mathbf{X}, \tag*{(28)}

where P\mathbf{P} is right-stochastic (∑jPij=1\sum_j P_{ij}=1), hence the translation and rotation equivariance discussed in Section II are naturally satisfied. While P\mathbf{P} has traditionally been pre-defined and discrete, it can be made continuous and optimizable with machine learning[232, 233, 234]. Coincidentally, Equation 28 also closely resembles the linear projection step in Linformer[235], an approach to reduce the complexity of transformer[236] models from quadratic to linear.

The path forward: what would the next generation of force fields look like?

The dilemma of topology.

It is debatable to what degree chemical bonds (and angles and torsions) are real and not artificial constructs. Classical biomolecular MM force fields usually require a topology (exceptions include Gale et al. [237]) and to define bond and angle energy accordingly, which is equivalent to putting a (very strong) prior on the probability density p^\hat{p} in Equation 2 to restrict x\mathbf{x} in a limited region. Such intense biases in a simulation ensure its stability and interpretability—clashes and distortions in the geometry will have near-zero likelihood under such formulation. At the same time, it also prohibits the force field model reactive species and transition states.

Anecdotally, during the implementation of an MD simulation, most time and effort of a researcher is typically spent on defining the topology—protonations and tautomers—of the system. Domain knowledge is also crucial in setting up an MD simulation, as even a protonation state error can drastically change the entire energy landscape of a biomolecular system[238].

MLFF, on the other hand, usually does not have the notion of topology entirely (exceptions exist, such as Eastman et al. [239], which uses the molecular topology to define a set of pre-computed partial charges but does not explicitly restrain bonds and angles). Faithful to Equation 2, it typically takes only the geometry x\mathbf{x} and the element identity hh as input without restricting x\mathbf{x} on any subspace. Naturally, this mitigates the need for a carefully designed topological graph and can, in theory, simulate transition states and reactive species. There is no guarantee, however, that the simulation will stay stable and interpretable[41], especially on high-energy regions.

To be topology-free can mean that the topological information needs to be re-realized every time. One can think that each forward pass of an MLFF model entails both the topology realization stage and the inference stage in an MM force field. As such, even for small perturbations on a limited conformational space, the computation always starts from scratch. We are interested in studying whether the realization of crude topology can be cached for similar conformations.

In addition, being free of topology also means that there are no inductive biases for a model to avoid apparently unfavorable regions.

What functional terms are here to stay?

Dot-product scalarization. As examples of Lemma 3, all terms in Equation 9 can be written as functions of dot products of edge (chemical bond) vectors, as one can trivially verify. For example, self dot product recovers the distance, and angles can be calculated as the ratio between dot products and distances. Since it is already universal, all invariant functions approximated by spherical harmonics can also be approximated by dot product-based algorithms, and spherical harmonics-based methods only afford the model with extra (physically inspired) inductive biases so that they are more data-efficient. Moreover, since dot product is among the most ubiquitously used operations in machine learning (for instance in attention[240]), it has been most aggressively optimized even for extremely high dimensional vectors, whereas optimizing spherical harmonics operations in GPU is still a technical challenge. We anticipate that dot product-based MLFF models will show more utility in the coming years.

Long-range interactions. Most, if not all, MLFF models adopt a cutoff function (Equation 5) and interactions between particles more than 5 or 10 angstroms apart are all masked out. This means that crucial interactions highly meaningful in key biomolecular processes such as protein folding, which has long been modeled using MM force fields[241], cannot even be realized by MLFFs. One viable approach to address this limitation would be to incorporate the van der Waals term in an MLFF model[242]. A Δ\Delta-learning can be carried out to learn the force and energy difference between the QM reference and the van der Waals interaction from an existing force field. Optionally, one can adopt a similar scheme with Takaba et al. [20], Wang et al. [216] to jointly optimize the parameters of the van der Waals terms, although alternative[81] formulations other than the 12-6 term might be preferred, such as those with more physical meaning namely the charge equilibration models[243] or the Buckingham[75] potential.

Recall the atomistic decomposition of energy (Equation 11)—this approach inherently assumes that the local structure is the primary determinant of interaction energy, ignoring contributions from long-range interactions. This approximation limits the applicability of the developed models to local interactions[244]. To address this limitation, a hierarchical framework has been introduced by Ko et al. [244]. While machine learning force fields can use Equation 11 without further modifications, new[85, 244] generations of ML force fields perform a decomposition into short-range energy (equivalent to Equation 11) and a long-range electrostatic (and, sometimes, dispersion) contribution[245], written as:

U=∑iUi+Ulr(29)U = \sum_i U_i + U_{\mathrm{lr}} \tag*{(29)}

Long-range interactions UlrU_{\mathrm{lr}} typically contain two relevant contributions: electrostatic and dispersion interaction. Electrostatic interactions are typically calculated using environment-dependent partial charges qiq_i via a neural network coupled with a charge equilibration procedure in neural networks. London dispersion forces represent another significant and essential component of long-range interactions. These have often been neglected or included through a Grimme two-body (pairwise additive) or three-body interactions and environment-dependent correction, though there are notable exceptions[246, 247].

Mixing MM with ML potential

Apart from incorporating pairwise functional forms for the long-range interactions, we can also further mix components of MM and ML potential models.

a. Mixing energy functions ML/MM approaches, in direct analogy to QM/MM, can in principle help to close this timescale divide, and several recent works have demonstrated proof of principle on how such approaches could be employed to more efficiently model large biomolecular systems[94, 95, 96, 97, 98, 99, 248] (See Sec. VIII C). Recognizing the speed difference between MM and ML force fields and assuming that its ratio will remain near constant in the next generations of ML and MM force fields (which is a realistic assumption) leads to the question: is it necessary to simulate the entire molecular system with an ML force field when the region involved in the event of interest is often limited to a small subsystem (reaction center, interactions between specific amino acids and a small molecule). This is further motivated by the insight that generating an MM force field that generalizes well is challenging.

The ‘subtractive’ scheme or ‘mechanical’ embedding is the simplest and easiest to implement approach[94, 249, 250]. In such a formalism, the ML force field describes the intramolecular energetics VMLV_{\mathrm{ML}} of the ligand r⃗L\vec{r}_{\mathrm{L}} and the MM force field is responsible for the interaction between the ligand and the environment EE.

VMM/ML=VMM(r⃗E,r⃗L)+VML(r⃗L)−VMM(r⃗L)(30)V_{\mathrm{MM/ML}} = V_{\mathrm{MM}}(\vec{r}_{E},\vec{r}_{L}) + V_{\mathrm{ML}}(\vec{r}_{L}) - V_{\mathrm{MM}}(\vec{r}_{L}) \tag*{(30)}

The main advantage is simplicity — no explicit MM-ML coupling terms are needed. The disadvantage is that the interaction between the MM and ML regions is handled entirely at the MM level; the limitations of classical force fields apply to non-bonded interactions.

This approach has been applied successfully and improved binding affinities[95, 96], yet there is some evidence that for solvation free energies it yields less convincing results[251]. In one particularly promising demonstration, Galvelis et al. 96 show that through a combination of well-optimized software and a mechanical embedding ML/MM scheme they are able to perform MD simulations of large solvated protein-ligand complexes (∼\sim30–60 thousand atoms), where the ligand (48–75 atoms) is treated at the level of the MLFF (ANI-2x60^{60}), with computational efficiencies just 1 order of magnitude slower than when solely MM is employed. It remains to be seen if bespoke fitting of small molecule MM force fields to ML force fields can deliver the same results with increased speed[186].

An improvement of the coupling (i.e., mutual polarization) of the charge densities between the MM and ML region is called electrostatic embedding, in which the interaction of the polarizable ML potential with the rigid MM densities (note that the charges in the MM regions are still fixed) are learned[99, 252]. Nevertheless, improvements in computed free energies are yet to be demonstrated over the simpler mechanical embedding approach.

b. Mixing time scales. One general approach to speeding up MD simulations is to employ multiple time step (MTS) algorithms[253, 254, 255, 256, 257] whereby the slower motions in a system are integrated less frequently than the faster motions. For standard FFs, this timescale separation is typically made with regards to the non-bonded vs. bonded interactions, thereby allowing one to employ a larger time step between the more computationally expensive evaluations of the system’s non-bonded interactions. For ab initio MD (AIMD) simulations, the same timescale separation cannot be as cleanly made. Instead, AIMD simulations typically adopt an MTS scheme where two levels of treatment for interactions in the system are employed, the target ab initio electronic structure method and another more computationally affordable model for the system’s potential energy surface, such that the difference in forces between the two levels is slowly varying and can be integrated with a larger outer time step while the cheaper model is evaluated every inner time step[258, 259, 260]. In essence, the cheaper model needs to be accurate, with respect to the target ab initio method, for the faster short range interactions. Similar MTS schemes can be used to accelerate both MLFF and ML/MM simulations, and recently Jaffrelot Inizan et al. 98 demonstrated that for their benchmark modeling of benzene in water they were able to speed up their ML/MM (ANI-2x/AMOEBA) simulations approximately 8-fold by employing MTS, with ML/MM and AMOEBA evaluations performed every 2 and 0.5 fs, respectively.

Ecosystems of molecular dynamics simulations, unite?

Currently, the MM infrastructure and simulation platform are typically segregated from the tensor-accelerating frameworks that are ubiquitous in all schools of machine learning and scientific computing. The reason can be attributed to the particularity of the functional forms and, consequently, the highly specialized kernels designed for these functions. The intensive requirements for domain knowledge might also justify the need for domain-specific software. As such, optimizing MM force fields requires reimplementation thereof and to blend MM force fields in an MLFF is also highly non-trivial.

a. Differential simulation. To control the course of the simulation and use gradient-based methods to optimize the force field parameters (See Section II), apart from post-hoc reweighting-based techniques[161, 178] that introduces additional error, making the MD simulation differentiable[182, 261, 262] is the conceptually simplest avenue.

The technical cornerstone to enable this endeavor is the adjoint sensitivity method for taking derivatives across ordinary or stochastic differential equations (ODE/SDE)[263, 264, 265], which allows the differentiation of the loss function L(xT)\mathcal{L}(x_T), dependent upon a later state xTx_T in a trajectory x0…xTx_0\ldots x_T, to be evaluated in constant memory and linear time. Specifically, in an ODE setting where the dynamics is controlled by a parametrized function dx/dt=f(x;t,θ)\mathrm{d}x/\mathrm{d}t=f(x;t,\theta), for example, the adjoint, defined as a(t)=∂L/∂xta(t)=\partial\mathcal{L}/\partial x_t, can be calculated by another ODE:

da(t)/dt=a(t)T∂f/∂x.(31)\mathrm{d}a(t)/\mathrm{d}t=a(t)^{T}\partial f/\partial x. \tag*{(31)}

The gradient w.r.t. to the parameters can then be calculated as:

dL/dθ=−∫dtaT(t)∂f/∂θ,(32)\mathrm{d}\mathcal{L}/\mathrm{d}\theta=-\int\mathrm{d}t a^{T}(t)\partial f/\partial\theta, \tag*{(32)}

where ∂f/∂x\partial f/\partial x and aT∂f/∂θa^{T}\partial f/\partial\theta can be efficiently computed as vector-Jacobian products.

b. MM re-implementation in tensor-accelerating frameworks. Schoenholz and Cubuk[266], Doerr et al. 267 strive to overcome this barrier by implementing the MM energy functions and sampling strategies in JAX[268] and PyTorch[269] to enable the end-to-end differentiation of MM energy functions. To efficiently do so is met with a multitude of challenges: to start with, tensor-accelerating frameworks are designed to run a wide variety of hardware platforms, with different support characteristics and capabilities. For example, the support for different or mixed precisions differs for each piece of hardware, which is not detrimental to ML applications due to its over-parametrized nature[270], but is crucial for MM simulations to run efficiently. More fundamentally, tensor-accelerating frameworks focus on general applicability and being able to efficiently evaluate a wide range of energy functional forms, with emphasis especially on highly parallel linear algebra operations, whereas MM platforms have more aggressively optimized the few local and pairwise terms. Efforts[271] to push towards accelerating MM implementation in tensor-accelerating frameworks usually end up re-writing all lower-level kernels for energy evaluation.

c. ML plug-in in MM platforms. Conversely, Eastman et al. 14, Galvelis et al. 96 offers functionalities to plug MLFF into traditional MD simulations to streamline the inference and sampling of MLFF on biologically relevant systems. We envision that this will be the drive of the next generation of hardware-specific (such as Anton[272, 273]) revolution. The speed bottleneck in these implementations usually lies in the constant transfer of coordinates and forces between the MM platform and the tensor-accelerating framework. At the very least, zero-copy is required to avoid duplicating the data or carrying the data from GPUs to hosts.

Foundation models for force fields and more.

Foundation models are an approach to representation learning that involves training a large artificial neural network on extremely large amounts of heterogeneous, multi-modal, and easily available data[274]. The learned representation is then leveraged and fine-tuned for various downstream tasks. Training on large and diverse datasets allows the model to generalize well across tasks and domains. Foundation models have enabled truly spectacular achievements in natural language processing and computer vision, and have begun to penetrate the physical sciences as demonstrated by recent advances in protein structure prediction.

Recent work in the field of ML atomistic models has begun to recognize the need for more scalable approaches resulting in the generation of larger datasets, e.g. the Open Catalyst (OC20)[275] and Materials Project[276] datasets, attempts to establish neural scaling laws for chemical models (on single data sources and, typically, on rather small scales) as well as universal models capable of few-shot, or even zero-shot, learning. Although far from the successes of natural language processing and computer vision, these results suggest that by scaling these domain-specific models we should be able to achieve comparable successes to those of more traditional computer science domains.

The high dimensionality of the chemical space and the scarcity and computational cost of generating training data, as well as the inconsistencies among available data, represent major obstacles for developing foundation models that are predictive over a broad range of materials and properties as needed for molecular and materials discovery. To fulfill this vision, critical limitations need to be overcome, such as data scarcity and data redundancy, the design of novel training strategies that can deal with inconsistencies across datasets, the exploration of adaptive batching and curriculum learning strategies, the development of scalable physics-informed models, as well as the characterization of scaling laws for domain-specific neural architectures.

Conclusions

Currently, the MM force fields are arguably fast enough but not sufficiently accurate; the ML force fields are accurate enough but painfully slow. We anticipate that a force field faster than current state-of-the-art MLFF and significantly more accurate than MM, will show greatest utility in the in silico modeling of biomolecular systems. With that in mind, we have herein surveyed the recent advances in either school in search of opportunities to bridge the design spaces.

We envision that the next generation of MLFFs with the desired balance between speed and accuracy will be composed of simple operations such as dot products while able to universally approximate all E(3)E(3)-invariant functions. Physically inspired inductive biases will be encoded in this model stability and smoothness is guaranteed. This model will likely still rely on automatic differentiation and will be implemented in general tensor-accelerating frameworks. A community-wide effort to design and generate high-quality datasets will ensure its wide chemical space coverage.

A nihilist epilogue: but do we really need a force field?

Echoing the opening paragraph of this review, computational chemists and biophysicists, on most occasions, are interested in sampling from the Boltzmann distribution (Equation 1), rather than just knowing its exact value up to a normalizing constant. It has quickly emerged to become a focus of cutting-edge research to generate samples directly on the coordinate space for biomolecular systems of interest—from small molecule conformer generation[277, 278, 279, 280, 281], folded protein structure prediction[282, 283, 284], to trajectory forecasting[30, 285]. More fascinatingly, a class of machine learning models known as Boltzmann generators[286, 287, 288, 289, 290, 291] sample the Boltzmann distribution in an asymptotically unbiased fashion in one shot, without relying on simulation.

Sampling and force field have long been two orthogonal axes in computational chemistry research, with little cross-disciplinary communications. The theoretical and experimental advances in energy-based models[292, 293] (EBM) and diffusion models[294, 295, 296, 297] should remind ourselves that these can be the same thing. The loss function in probabilistic generative modeling is usually some rendering of the energy function—in the context of learning by examples, the loss function can be viewed as the local Gaussian or Laplacian extrapolation around the learning set. When training a generative model, one might get a force field for free[298].

Disclosures.

YW has limited financial interests in Flagship Pioneering, Inc. and its subsidiaries.

Acknowledgements.

This research was carried out on high-performance computing resources at Memorial Sloan Kettering Cancer Center and the Washington Square and Abu Dhabi campuses of New York University.

Funding.

YW acknowledges support from the Schmidt Science Fellowship, in partnership with the Rhodes Trust, and the Simons Center for Computational Physical Chemistry at New York University. S.M. acknowledges NSF Award 2311632 and the Simons Center for Computational Physical Chemistry for financial support.

References

  1. [2]²J. A. McCammon, B. R. Gelin, and M. Karplus, “Dynamics of folded proteins,” nature 267, 585–590 (1977).
  2. [3]³J. W. Ponder and D. A. Case, “Force fields for protein simulations,” in Advances in protein chemistry, Vol. 66 (Elsevier, 2003) pp. 27–85.
  3. [4]⁴D. Van Der Spoel, E. Lindahl, B. Hess, G. Groenhof, A. E. Mark, and H. J. Berendsen, “Gromacs: fast, flexible, and free,” Journal of computational chemistry 26, 1701–1718 (2005).
  4. [5]⁵D. A. Case, T. E. Cheatham III, T. Darden, H. Gohlke, R. Luo, K. M. Merz Jr, A. Onufriev, C. Simmerling, B. Wang, and R. J. Woods, “The amber biomolecular simulation programs,” Journal of computational chemistry 26, 1668–1688 (2005).
  5. [6]⁶J. C. Phillips, R. Braun, W. Wang, J. Gumbart, E. Tajkhorshid, E. Villa, C. Chipot, R. D. Skeel, L. Kale, and K. Schulten, “Scalable molecular dynamics with namd,” Journal of computational chemistry 26, 1781–1802 (2005).
  6. [7]⁷F. E. Calculations, “Theory and applications in chemistry and biology,” Springer Series in Chemical Physics 86 (2007).
  7. [8]⁸C. Wang, G. Pilania, S. Boggs, S. Kumar, C. Breneman, and R. Ramprasad, “Computational strategies for polymer dielectrics design,” Polymer 55, 979–988 (2014).
  8. [9]⁹C. Li and A. Strachan, “Molecular scale simulations on thermoset polymers: A review,” Journal of Polymer Science Part B: Polymer Physics 53, 103–122 (2015).DOI
  9. [10]¹⁰H. Sun, Z. Jin, C. Yang, R. L. Akkermans, S. H. Robertson, N. A. Spenley, S. Miller, and S. M. Todd, “Compass ii: extended coverage for polymer and drug-like molecule databases,” Journal of molecular modeling 22, 47 (2016).DOI
  10. [11]¹¹M. J. Harvey, G. Giupponi, and G. D. Fabritiis, “Acemd: accelerating biomolecular dynamics in the microsecond time scale,” Journal of chemical theory and computation 5, 1632–1639 (2009).DOI
  11. [12]¹²R. Salomon-Ferrer, A. W. Gotz, D. Poole, S. Le Grand, and R. C. Walker, “Routine microsecond molecular dynamics simulations with amber on gpus. 2. explicit solvent particle mesh ewald,” Journal of chemical theory and computation 9, 3878–3888 (2013).DOI
  12. [13]¹³P. Eastman, J. Swails, J. D. Chodera, R. T. McGibbon, Y. Zhao, K. A. Beauchamp, L.-P. Wang, A. C. Simmonett, M. P. Harrigan, C. D. Stern, et al., “Openmm 7: Rapid development of high performance algorithms for molecular dynamics,” PLoS computational biology 13, e1005659 (2017).
  13. [14]¹⁴P. Eastman, R. Galvelis, R. P. Peláez, C. R. A. Abreu, S. E. Farr, E. Gallicchio, A. Gorenko, M. M. Henry, F. Hu, J. Huang, A. Krämer, J. Michel, J. A. Mitchell, V. S. Pande, J. P. Rodrigues, J. Rodriguez-Guerra, A. C. Simmonett, S. Singh, J. Swails, P. Turner, Y. Wang, I. Zhang, J. D. Chodera, G. D. Fabritiis, and T. E. Markland, “Openmm 8: Molecular dynamics simulation with machine learning potentials,” (2023), arXiv:2310.03121 [physics.chem-ph].arxiv.org/abs/2310.03121
  14. [15]¹⁵L. Wang, Y. Wu, Y. Deng, B. Kim, L. Pierce, G. Krilov, D. Lupyan, S. Robinson, M. K. Dahlgren, J. Greenwood, et al., “Accurate and reliable prediction of relative ligand binding potency in prospective drug discovery by way of a modern free-energy calculation protocol and force field,” Journal of the American Chemical Society 137, 2695–2703 (2015).DOI
  15. [16]¹⁶C. E. Schindler, H. Baumann, A. Blum, D. Bose, H.-P. Buchstaller, L. Burgdorf, D. Cappel, E. Chekler, P. Czodrowski, D. Dorsch, et al., “Large-scale assessment of binding free energy calculations in active drug discovery projects,” Journal of Chemical Information and Modeling 60, 5457–5474 (2020).DOI
  16. [17]¹⁷V. Pruitt, D. F. Hahn, G. Tresadern, D. L. Mobley, M. Rampp, and B. L. de Groot, “Pre-exascale computing of protein–ligand binding free energies with open source software for drug design,” Journal of chemical information and modeling 62, 1172–1177 (2022).DOI
  17. [18]¹⁸S. Chmiela, A. Tkatchenko, H. E. Sauceda, I. Poltavsky, K. T. Schütt, and K.-R. Müller, “Machine learning of accurate energy-conserving molecular force fields,” Science advances 3, e1603015 (2017).DOI
  18. [19]¹⁹S. Boothroyd, P. K. Behara, O. C. Madin, D. F. Hahn, J. Yang, V. Gapsys, J. R. Wagner, J. T. Horton, D. L. Dotson, M. W. Thompson, et al., “Development and benchmarking of open force field 2.0.0: The sage small molecule force field,” Journal of Chemical Theory and Computation, 3251–3275 (2023).
  19. [20]²⁰K. Takaba, A. J. Friedman, C. E. Cavender, P. K. Behara, I. Pulido, M. M. Henry, H. MacDermott-Opeskin, C. R. Iacovella, A. M. Nagle, A. M. Payne, M. R. Shirts, D. L. Mobley, J. D. Chodera, and Y. Wang, “Machine-learned molecular mechanics force fields from large-scale quantum chemical data,” Chem. Sci. 15, 12861–12878 (2024).DOI
  20. [21]²¹S. Chmiela, A. Tkatchenko, H. E. Sauceda, I. Poltavsky, K. T. Schütt, and K.-R. Müller, “Machine learning of accurate energy-conserving molecular force fields,” Science Advances 3, e1603015 (2017).DOI
  21. [22]²²O. T. Unke, S. Chmiela, H. E. Sauceda, M. Gastegger, I. Poltavsky, K. T. Schütt, A. Tkatchenko, and K.-R. Müller, “Machine learning force fields,” Chemical Reviews 121, 10142–10186 (2021).
  22. [23]²³J. S. Smith, O. Isayev, and A. E. Roitberg, “Ani-1: an extensible neural network potential with dft accuracy at force field computational cost,” Chemical science 8, 3192–3203 (2017).DOI
  23. [24]²⁴J. S. Smith, B. Nebgen, N. Lubbers, O. Isayev, and A. E. Roitberg, “Less is more: Sampling chemical space with active learning,” The Journal of chemical physics 148, 241733 (2018).DOI
  24. [25]²⁵J. S. Smith, B. T. Nebgen, R. Zubatyuk, N. Lubbers, C. Devereux, K. Barros, S. Tretiak, O. Isayev, and A. E. Roitberg, “Approaching coupled cluster accuracy with a general-purpose neural network potential through transfer learning,” Nature communications 10, 1–8 (2019).DOI
  25. [26]²⁶C. Devereux, J. S. Smith, K. K. Davis, K. Barros, R. Zubatyuk, O. Isayev, and A. E. Roitberg, “Extending the applicability of the ani deep learning molecular potential to sulfur and halogens,” Journal of Chemical Theory and Computation 16, 4192–4202 (2020).DOI
  26. [27]²⁷K. T. Schütt, H. E. Sauceda, P.-J. Kindermans, A. Tkatchenko, and K.-R. Müller, “Schnet–a deep learning architecture for molecules and materials,” The Journal of Chemical Physics 148, 241722 (2018).DOI
  27. [28]²⁸S. Batzner, T. E. Smidt, L. Sun, J. P. Mailoa, M. Kornbluth, N. Molinari, and B. Kozinsky, “Se (3)-equivariant graph neural networks for data-efficient and accurate interatomic potentials,” arXiv preprint arXiv:2101.03164 (2021).
  28. [29]²⁹Y. Han, Z. Wang, Z. Wei, J. Liu, and J. Li, “Machine learning builds full-QM precision protein force fields in seconds,” Briefings in Bioinformatics 22 (2021), 10.1093/bib/bbab158, bbab158, https://academic.oup.com/bib/article-pdf/22/6/bbab158/41089104/bbab158.pdf.DOI
  29. [30]³⁰Y. Wang and J. D. Chodera, “Spatial attention kinetic networks with e(n)-equivariance,” (2023), arXiv:2301.08893 [cs.LG].arxiv.org/abs/2301.08893
  30. [31]³¹A. Musaelian, S. Batzner, A. Johansson, L. Sun, C. J. Owen, M. Kornbluth, and B. Kozinsky, “Learning local equivariant representations for large-scale atomistic dynamics,” (2022), arXiv:2204.05249 [physics.comp-ph].arxiv.org/abs/2204.05249
  31. [32]³²G. D. Fabritiis, “Machine learning potentials: A roadmap toward next-generation biomolecular simulations,” (2024), arXiv:2408.12625 [physics.chem-ph].arxiv.org/abs/2408.12625
  32. [33]³³S. Barnett and J. D. Chodera, “Neural network potentials for enabling advanced small-molecule drug discovery and generative design,” GEN Biotechnology 3, 119–129 (2024).DOI
  33. [34]³⁴J. Behler and M. Parrinello, “Generalized neural-network representation of high-dimensional potential-energy surfaces,” Phys. Rev. Lett. 98, 146401 (2007).
  34. [35]³⁵S. Thais and D. Murnane, “Equivariance is not all you need: Characterizing the utility of equivariant graph neural networks for particle physics tasks,” (2023), arXiv:2311.03094 [cs.LG].arxiv.org/abs/2311.03094
  35. [36]³⁶O. Puny, M. Atzmon, H. Ben-Hamu, I. Misra, A. Grover, E. J. Smith, and Y. Lipman, “Frame averaging for invariant and equivariant network design,” (2022), arXiv:2110.03336 [cs.LG].arxiv.org/abs/2110.03336
  36. [37]³⁷A. Duval, V. Schmidt, A. H. Garcia, S. Miret, F. D. Malliaros, Y. Bengio, and D. Rolnick, “Faenet: Frame averaging equivariant gnn for materials modeling,” (2023), arXiv:2305.05577 [cs.LG].arxiv.org/abs/2305.05577
  37. [38]³⁸J. A. Barker and R. O. Watts, “Monte carlo studies of the dielectric properties of water-like models,” Molecular Physics 26, 789–792 (1973).
  38. [39]³⁹R. Watts, “Monte carlo studies of liquid water,” Molecular Physics 28, 1069–1083 (1974).
  39. [40]⁴⁰D.-A. Clevert, T. Unterthiner, and S. Hochreiter, “Fast and accurate deep network learning by exponential linear units (elus),” (2016), arXiv:1511.07289 [cs.LG].arxiv.org/abs/1511.07289
  40. [41]X. Fu, Z. Wu, W. Wang, T. Xie, S. Keten, R. Gomez-Bombarelli, and T. Jaakkola, “Forces are not enough: Benchmark and critical evaluation for machine learning force fields with molecular simulations,” (2023), arXiv:2210.07237 [physics.comp-ph].arxiv.org/abs/2210.07237
  41. [42]S. Stocker, J. Gasteiger, F. Becker, S. Günnemann, and J. T. Margraf, “How robust are modern graph neural network potentials in long and hot molecular dynamics simulations?” Machine Learning: Science and Technology 3, 045010 (2022).DOI
  42. [43]W. Wang, T. Yang, W. H. Harris, and R. Gómez-Bombarelli, “Active learning and neural network potentials accelerate molecular screening of ether-based solvate ionic liquids,” Chemical Communications 56, 8920–8923 (2020).DOI
  43. [44]D. Schwalbe-Koda, A. R. Tan, and R. Gómez-Bombarelli, “Differentiable sampling of molecular geometries with uncertainty-based adversarial attacks,” Nature communications 12, 5104 (2021).
  44. [45]K. Lindorff-Larsen, S. Piana, R. O. Dror, and D. E. Shaw, “How fast-folding proteins fold,” Science 334, 517–520 (2011).
  45. [46]J. Kubelka, J. Hofrichter, and W. A. Eaton, “The protein folding ‘speed limit’,” Current opinion in structural biology 14, 76–88 (2004).
  46. [47]W. A. Eaton, “Modern kinetics and mechanism of protein folding: A retrospective,” The Journal of Physical Chemistry B 125, 3452–3467 (2021).DOI
  47. [48]B. Manavalan, K. Kuwajima, and J. Lee, “Ffdb: A standardized protein folding database with temperature correction,” Scientific reports 9, 1588 (2019).DOI
  48. [49]J.-C. Horng, V. Moroz, and D. P. Raleigh, “Rapid cooperative two-state folding of a miniature α–β protein and design of a thermostable variant,” Journal of molecular biology 326, 1261–1270 (2003).DOI
  49. [50]Z. Qiao, M. Welborn, A. Anandkumar, F. R. Manby, and T. F. Miller, “Orbnet: Deep learning for quantum chemistry using symmetry-adapted atomic-orbital features,” The Journal of chemical physics 153 (2020).DOI
  50. [51]M. Retchin, Y. Wang, K. Takaba, and J. D. Chodera, “Druggym: A testbed for the economics of autonomous drug discovery,” bioRxiv , 2024–05 (2024).DOI
  51. [52]A. G. Baydin, B. A. Pearlmutter, A. A. Radul, and J. M. Siskind, “Automatic differentiation in machine learning: a survey,” (2018), arXiv:1502.05767 [cs.SC].arxiv.org/abs/1502.05767
  52. [53]J. A. Pople, “Nobel lecture: Quantum chemical models,” Reviews of Modern Physics 71, 1267 (1999).
  53. [54]M. Bogojeski, L. Vogt-Maranto, M. E. Tuckerman, K.-R. Müller, and K. Burke, “Quantum chemical accuracy from density functional approximations via machine learning,” Nature communications 11, 5223 (2020).DOI
  54. [55]D. L. Mobley and P. V. Klimovich, “Perspective: Alchemical free energy calculations for drug discovery,” The Journal of chemical physics 137 (2012).DOI
  55. [56]I. Batatia, D. P. Kovács, G. N. C. Simm, C. Ortner, and G. Csányi, “Mace: Higher order equivariant message passing neural networks for fast and accurate force fields,” (2023), arXiv:2206.07697 [stat.ML].arxiv.org/abs/2206.07697
  56. [57]J. Batzner, A. Musaeilan, L. Sun, M. Geiger, J. P. Mailoa, M. Kornbluth, N. Molinari, T. E. Smidt, and B. Kozinsky, “E(3)-equivariant graph neural networks for data-efficient and accurate interatomic potentials,” Nature Communications 13 (2022), 10.1038/s41467-022-29939-5.DOI
  57. [58]A. S. Christensen and O. A. von Lilienfeld, “On the role of gradients for machine learning of molecular energies and forces,” (2020), arXiv:2007.09593 [physics.chem-ph].arxiv.org/abs/2007.09593
  58. [59]P. Eastman, P. K. Behara, D. L. Dotson, R. Galvelis, J. E. Herr, J. T. Horton, Y. Mao, J. D. Chodera, B. P. Pritchard, Y. Wang, et al., “Spice, a dataset of drug-like molecules and peptides for training machine learning potentials,” Scientific Data 10, 11 (2023).
  59. [60]J. S. Smith, R. Zubatyuk, B. Nebgen, N. Lubbers, K. Barros, A. E. Roitberg, O. Isayev, and S. Treták, “The ani-1ccx and ani-1x data sets, coupled-cluster and density functional theory properties for molecules,” Scientific data 7, 134 (2020).
  60. [61]D. P. Kovács, J. H. Moore, N. J. Browning, I. Batatia, J. T. Horton, V. Kapil, W. C. Witt, I.-B. Magdău, D. J. Cole, and G. Csányi, “Mace-off23: Transferable machine learning force fields for organic molecules,” (2023), arXiv:2312.15211 [physics.chem-ph].
  61. [62]G. Simeon and G. De Fabritiis, “Tensornet: Cartesian tensor representations for efficient learning of molecular potentials,” Advances in Neural Information Processing Systems 36 (2024).arxiv.org/abs/2306.06482
  62. [63]P. Dauber-Osguthorpe and A. T. Hagler, “Biomolecular force fields: where have we been, where are we now, where do we need to go and how do we get there?” Journal of computer-aided molecular design 33, 133–203 (2019).DOI
  63. [64]A. T. Hagler, “Force field development phase ii: Relaxation of physics-based criteria. . . or inclusion of more rigorous physics into the representation of molecular energetics,” Journal of computer-aided molecular design 33, 205–264 (2019).DOI
  64. [65]C. Ringrose, J. T. Horton, L.-P. Wang, and D. J. Cole, “Exploration and validation of force field design protocols through qm-to-mm mapping,” Physical Chemistry Chemical Physics 24, 17014–17027 (2022).DOI
  65. [66]X. C. Yan, M. J. Robertson, J. Tirado-Rives, and W. L. Jorgensen, “Improved description of sulfur charge anisotropy in opls force fields: model development and parameterization,” The Journal of Physical Chemistry B 121, 6626–6636 (2017).DOI
  66. [67]M. H. Kolar and P. Hobza, “Computer modeling of halogen bonds and other σ-hole interactions,” Chemical reviews 116, 5155–5187 (2016).
  67. [68]J. Delhommelme and P. Millie, “Inadequacy of the lorentz-berthelot combining rules for accurate predictions of equilibrium properties by molecular simulation,” Molecular Physics 99, 619–625 (2001).DOI
  68. [69]T. A. Halgren, “The representation of van der waals (vdw) interactions in molecular mechanics force fields: potential form, combination rules, and vdw parameters,” Journal of the American Chemical Society 114, 7827–7843 (1992).DOI
  69. [70]P. M. Morse, “Diatomic molecules according to the wave mechanics. ii. vibrational levels,” Phys. Rev. 34, 57–64 (1929).DOI
  70. [71]K. Vanommeslaeghe, E. Hatcher, C. Acharya, S. Kundu, S. Zhong, J. Shim, E. Demir, O. Guvench, P. Lopes, I. Vorobyov, and A. D. MackereII Jr., “Charmm general force field: A force field for drug-like molecules compatible with the charmm all-atom additive biological force fields,” Journal of Computational Chemistry 31, 671–690 (2010).DOI
  71. [72]S. L. Mayo, B. D. Olafson, and W. A. Goddard, “Dreiding: A generic force field for molecular simulations,” Journal of Physical Chemistry 94, 8897–8909 (1990).
  72. [73]M. J. Robertson, J. Tirado-Rives, and W. L. Jorgensen, “Improved peptide and protein torsional energetics with the opls-aa force field,” Journal of Chemical Theory and Computation 11, 3499–3509 (2015).DOI
  73. [74]J. E. Jones, “On the determination of molecular fields. —ii. from the equation of state of a gas,” Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences 106, 463–477 (1924).DOI
  74. [75]R. A. Buckingham, “The classical equation of state of gaseous helium, neon and argon,” Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences 168, 264–283 (1938).DOI
  75. [76]J. J. K. Chung, M. L. Brown, and P. L. A. Popelier, “Transferability of buckingham parameters for short-range repulsion between topological atoms,” Journal of Chemical Theory and Computation 128, 4561–4572 (2024).DOI
  76. [77]J. R. Hart and A. K. Rappé, “van der waals functional forms for molecular simulations,” The Journal of chemical physics 97, 1109–1115 (1992).
  77. [78]L. Yang, L. Sun, and W.-Q. Deng, “Combination rules for morse-based van der waals force fields,” The Journal of Physical Chemistry A 122, 1672–1677 (2018).DOI
  78. [79]X. Wu and B. R. Brooks, “A double exponential potential for van der waals interaction,” AIP Advances 9, 065304 (2019).DOI
  79. [80]V. H. Man, X. Wu, X. HeXiang-Qun, X. R. Brooks, and J. Wang, “Determination of van der waals parameters using a double exponential potential for nonbonded divalent metal cations in tip3p solvent,” Journal of chemical theory and computation 17, 1086–1097 (2021).DOI
  80. [81]J. T. Horton, S. Boothroyd, P. K. Behara, D. L. Mobley, and D. J. Cole, “A transferable double exponential potential for condensed phase simulations of small molecules,” Digital Discovery 2, 1178–1187 (2023).DOI
  81. [82]M. Abraham, A. Alekseenko, V. Basov, C. Bergh, E. Briand, A. Brown, M. Doijade, G. Fiorin, S. Fleischmann, S. Gorelov, G. Gouaillardet, A. Grey, E. I. M., F. Jalaypour, J. Jordan, C. Kutzner, J. A. Lemkul, M. Lundborg, P. Merz, V. Miletic, D. Morozov, J. Nabet, S. Pall, A. Pasquadibisceglie, M. Pellegrino, H. Santuz, R. Schulz, T. Shugaeva, A. Shvetsov, A. Villa, S. Wingbermuehle, B. Hess, and E. Lindahl, “Gromacs 2024.2 manual,” (2024).
  82. [83]S. Chmiela, V. Vassilev-Galindo, O. T. Tunke, A. Kabยlda, H. E. Sauceda, A. Tkatchenko, and K.-R. Müller, “Accurate global machine learning force fields for molecules with hundreds of atoms,” (2022), arXiv:2209.14865 [physics.chem-ph].
  83. [84]D. P. Kovács, I. Batatia, E. S. Arany, and G. Csányi, “Evaluation of the MACE force field architecture: From medicinal chemistry to materials science,” The Journal of Chemical Physics 159, 044118 (2023).DOI
  84. [85]O. T. Unke and M. Meuwly, “PhysNet: A neural network for predicting energies, forces, dipole moments, and partial charges,” Journal of Chemical Theory and Computation 15, 3678–3693 (2019).DOI
  85. [86]M. S. Chen, J. Lee, H.-Z. Ye, T. C. Berkelbach, D. R. Reichman, and T. E. Markland, “Data-efficient machine learning potentials from transfer learning of periodic correlated electronic structure methods: Liquid water at afqmc, cc sd, and ccsd(t) accuracy,” Journal of Chemical Theory and Computation 19, 4510–4519 (2023).
  86. [87]M. Rossi, W. Fang, and A. Michaelides, “Stability of complex biomolecular structures: van der waals, hydrogen bond cooperativity, and nuclear quantum effects,” The Journal of Physical Chemistry Letters 6, 4233–4238 (2015).
  87. [88]K. Yao, J. E. Herr, D. Toth, R. Mckintyre, and J. Parkhill, “The tensormol-0.1 model chemistry: a neural network augmented with long-range physics,” Chem. Sci. 9, 2261–2269 (2018).
  88. [89]T. Plé, L. Lagardère, and J.-P. Piquemal, “Force-field-enhanced neural network interactions: from local equivariant embedding to atom-in-molecule properties and long-range effects,” Chem. Sci. 14, 12554–12569 (2023).DOI
  89. [90]O. I. Dylan Anstine, Roman Zubatyuk, “Aimnet: A neural network potential to meet your neutral, charged, organic, and elemental-organic needs,” (2024).
  90. [91]B. Kozinsky, A. Muselalian, A. Johansson, and S. Batzner, “Scaling the leading accuracy of deep equivariant models to biomolecular simulations of realistic size,” in Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis (2023) pp. 1–12.arxiv.org/abs/2304.10061
  91. [92]O. T. Unke, M. Stöhr, S. Ganscha, T. Unterthiner, H. Maennel, S. Kashubin, D. Ahlin, M. Gastegger, L. M. Sandonas, J. T. Berryman, A. Tkatchenko, and K.-R. Müller, “Biomolecular dynamics with machine-learned quantum-mechanical force fields trained on diverse chemical fragments,” Science Advances 10, eadn4397 (2024).DOI
  92. [93]Z. Cheng, J. Du, L. Zhang, J. Ma, W. Li, and S. Li, “Building quantum mechanics quality force fields of proteins with the generalized energy-based fragmentation approach and machine learning,” Phys. Chem. Chem. Phys. 24, 1326–1337 (2022).DOI
  93. [94]S. L. J. Lahey and C. N. Rowley, “Simulating protein-ligand binding with neural network potentials,” Chem. Sci. 11, 2362–2368 (2020).
  94. [95]D. A. Rufa, H. E. Bruce Macdonald, J. Fass, M. Wieder, P. B. Grinaway, A. E. Roitberg, O. Isayev, and J. D. Chodera, “Towards chemical accuracy for alchemical free energy calculations with hybrid physics-based machine learning/molecular mechanics potentials,” BioRxiv, 2020–07 (2020).DOI
  95. [96]K. Galvelis, A. Varela-Rial, S. Doerr, R. Fino, P. Eastman, T. E. Markland, J. D. Chodera, and G. De Fabritiis, “Nnp/mm: accelerating molecular dynamics simulations with machine learning potentials and molecular mechanics,” Journal of chemical information and modeling 63, 5701–5708 (2023).DOI
  96. [97]F. Sabanés Zariquiey, R. Galvelis, E. Gallicchio, J. D. Chodera, T. E. Markland, and G. De Fabritiis, “Enhancing protein–ligand binding affinity predictions using neural network potentials,” Journal of Chemical Information and Modeling 64, 1481–1485 (2024).
  97. [98]T. Jaffrelot Inizan, T. Plé, O. Adj oua, P. Ren, H. Gökcan, O. Isayev, L. Lagardère, and J.-P. Piquemal, “Scalable hybrid deep neural networks/polarizable potentials biomolecular simulations including long-range effects,” Chem. Sci. 14, 5438–5452 (2023).
  98. [99]K. Zinovjev, L. Hedges, R. Montagud Andreu, C. Woods, I. Tuñón, and M. W. van der Kamp, “emle-amine: A flexible electrostatic machine learning embedding package for multiscale molecular dynamics simulations,” Journal of Chemical Theory and Computation 20, 4514–4522 (2024), pMID: 38804055.
  99. [100]D. W. Zhang and J. Z. H. Zhang, “Molecular fractionation with conjugate caps for full quantum mechanical calculation of protein–molecule interaction energy,” The Journal of Chemical Physics 119, 3599–3605 (2003).
  100. [101]X. He and J. Z. H. Zhang, “The generalized molecular fractionation with conjugate caps/molecular mechanics method for direct calculation of protein energy,” The Journal of Chemical Physics 124, 184703 (2006).
  101. [102]X. Wang, J. Liu, J. Z. H. Zhang, and X. He, “Electrostatically embedded generalized molecular fractionation with conjugate caps method for full quantum mechanical calculation of protein energy,” The Journal of Physical Chemistry A 117, 7149–7161 (2013).DOI
  102. [103]W. Li, S. Li, and Y. Jiang, “Generalized energy-based fragmentation approach for computing the ground-state energies and properties of large molecules,” The Journal of Physical Chemistry A 111, 2193–2199 (2007).
  103. [104]H. Wang and W. Yang, “Toward building protein force fields by residue-based systematic molecular fragmentation and neural network,” Journal of Chemical Theory and Computation 15, 1409–1417 (2019).DOI
  104. [105]Z. Wang, Y. Han, J. Li, and X. He, “Combining the fragmentation approach and neural network potential energy surfaces of fragments for accurate calculation of protein energy,” The Journal of Physical Chemistry B 124, 3027–3035 (2020).DOI
  105. [106]Y. Han, Z. Wang, A. Chen, I. Ali, J. Cai, S. Ye, and J. Li, “An inductive transfer learning force field (ITLFF) protocol builds protein force fields in seconds,” Briefings in Bioinformatics 23, bbab590 (2022).DOI
  106. [107]P. Thölke and G. D. Fabritiis, “Torchmd-net: Equivariant transformers for neural network based molecular potentials,” (2022), arXiv:2202.02541 [cs.LG].arxiv.org/abs/2202.02541
  107. [108]K. T. Schütt, O. T. Unke, and M. Gastegger, “Equivariant message passing for the prediction of tensorial properties and molecular spectra,” (2021), arXiv:2102.03150 [cs.LG].arxiv.org/abs/2102.03150
  108. [109]D. K. Duvenaud, D. Maclaurin, J. Iparraguirre, R. Bombarell, T. Hirzel, A. Aspuru-Guzik, and R. P. Adams, “Convolutional networks on graphs for learning molecular fingerprints,” in Advances in neural information processing systems (2015) pp. 2224–2232.
  109. [110]T. N. Kipf and M. Welling, “Semi-supervised classification with graph convolutional networks,” CoRR abs/1609.02907 (2016), arXiv:1609.02907.arxiv.org/abs/1609.02907
  110. [111]J. Gilmer, S. S. Schoenholz, P. F. Riley, O. Vinyals, and G. E. Dahl, “Neural message passing for quantum chemistry,” in International conference on machine learning (PMLR, 2017) pp. 1263–1272.arxiv.org/abs/1704.01212
  111. [112]K. Xu, W. Hu, J. Leskovec, and S. Jegelka, “How powerful are graph neural networks?” arXiv preprint arXiv:1810.00826 (2018).arxiv.org/abs/1810.00826
  112. [113]P. W. Battaglia, J. B. Hamrick, V. Bapst, A. Sanchez-Gonzalez, V. Zambaldi, M. Malinowski, A. Tacchetti, D. Raposo, A. Santoro, R. Faulkner, et al., “Relational inductive biases, deep learning, and graph networks,” arXiv preprint arXiv:1806.01261 (2018).arxiv.org/abs/1806.01261
  113. [114]J. Du, S. Zhang, G. Wu, J. M. F. Moura, and S. Kar, “Topology Adaptive Graph Convolutional Networks,” arXiv:1710.10370 [cs, stat] (2018), arXiv:1710.10370 [cs, stat].arxiv.org/abs/1710.10370
  114. [115]F. Wu, T. Zhang, A. H. d. Souza Jr, C. Fifty, T. Yu, and K. Q. Weinberger, “Simplifying graph convolutional networks,” arXiv preprint arXiv:1902.07153 (2019).arxiv.org/abs/1902.07153
  115. [116]M. Wang, L. Yu, D. Zheng, Q. Gan, M. Li, X. Song, J. Zhou, C. Ma, L. Yu, Y. Gai, et al., “Deep graph library: A graph-centric, highly-performant package for graph neural networks,” arXiv preprint arXiv:1909.01315 (2019).arxiv.org/abs/1909.01315
  116. [117]Y. Wang, Y. Sun, Z. Liu, S. E. Sarma, M. M. Bronstein, and J. M. Solomon, “Dynamic graph cnn for learning on point clouds,” Actm Transactions On Graphis (tog) 38, 1–12 (2019).
  117. [118]C. K. Joshi, C. Bodnar, S. V. Mathis, T. Cohen, and P. Liò, “On the expressive power of geometric graph neural networks,” arXiv preprint arXiv:2301.09308 (2023).arxiv.org/abs/2301.09308
  118. [119]Y. Wang and T. Karaletsos, “Stochastic aggregation in graph neural networks,” (2021), arXiv:2102.12648 [stat.ML].arxiv.org/abs/2102.12648
  119. [120]P. Veličković, G. Cucurull, A. Casanova, A. Romero, P. Liò, and Y. Bengio, “Graph attention networks,” (2018), arXiv:1710.10903 [stat.ML].arxiv.org/abs/1710.10903
  120. [121]F. Wu, T. Zhang, A. H. S. Jr., C. Fifty, T. Yu, and K. Q. Weinberger, “Simplifying graph convolutional networks,” CoRR abs/1902.07153 (2019), arXiv:1902.07153.arxiv.org/abs/1902.07153
  121. [122]B. P. Chamberlain, J. Rowbottom, M. I. Gorinova, S. Webb, E. Rossi, and M. M. Bronstein, “GRAND: graph neural diffusion,” CoRR abs/2106.10934 (2021), 2106.10934.arxiv.org/abs/2106.10934
  122. [123]C. Cai and Y. Wang, “A note on over-smoothing for graph neural networks,” (2020), arXiv:2006.13318 [cs.LG].arxiv.org/abs/2006.13318
  123. [124]T. K. Rusch, M. M. Bronstein, and S. Mishra, “A survey on oversmoothing in graph neural networks,” (2023), arXiv:2303.10993 [cs.LG].arxiv.org/abs/2303.10993
  124. [125]U. Alon and E. Yahav, “On the bottleneck of graph neural networks and its practical implications,” CoRR abs/2006.05205 (2020), 2006.05205.arxiv.org/abs/2006.05205
  125. [126]F. D. Giovanni, B. P. Chamberlain, X. Dong, and M. M. Bronstein, “Understanding over-squashing and bottlenecks on graphs via curvature,” (2022), arXiv:2111.14522 [stat.ML].arxiv.org/abs/2111.14522
  126. [127]G. Corso, L. Cavallari, D. Beaini, P. Liò, and P. Veličković, “Principal neighbourhood aggregation for graph nets,” (2020), arXiv:2004.05718 [cs.LG].arxiv.org/abs/2004.05718
  127. [128]V. K. Garg, S. Jegelka, and T. S. Jaakkola, “Generalization and representational limits of graph neural networks,” CoRR abs/2002.06157 (2020), 2002.06157.arxiv.org/abs/2002.06157
  128. [129]Y. Wang and K. Cho, “Non-convolutional graph neural networks,” (2024), arXiv:2408.00165 [cs.LG].arxiv.org/abs/2408.00165
  129. [130]K. T. Schütt, P.-J. Kindermans, H. E. Sauceda, S. Chmiela, A. Tkatchenko, and K.-R. Müller, “Schnet: A continuous-filter convolutional neural network for modeling quantum interactions,” (2017), arXiv:1706.08566 [stat.ML].
  130. [131]J. S. Smith, O. Isayev, and A. E. Roitberg, “Ani-1: an extensible neural network potential with dft accuracy at force field computational cost,” Chemical Science 8, 3192–3203 (2017).DOI
  131. [132]S. Villar, D. W. Hogg, K. Storey-Fisher, W. Yao, and B. Blum-Smith, “Scalars are universal: Equivariant machine learning, structured like classical physics,” (2023), arXiv:2106.06610 [cs.LG].arxiv.org/abs/2106.06610
  132. [133]P. Thomas, T. E. Smidt, S. Kearnes, L. Yang, L. Li, K. Kohlhoff, and P. Riley, “Tensor field networks: Rotation- and translation-equivariant neural networks for 3d point clouds,” CoRR abs/1802.08219 (2018), 1802.08219.arxiv.org/abs/1802.08219
  133. [134]J. P. Perdew, K. Burke, and M. Ernzerhof, “Generalized gradient approximation made simple,” Physical review letters 77, 3865 (1996).
  134. [135]A. Tkatchenko, R. A. DiStasio Jr, R. Car, and M. Scheffler, “Accurate and efficient method for many-body van der waals interactions,” Physical review letters 108, 236402 (2012).
  135. [136]R. Ramakrishnan, P. O. Dral, M. Rupp, and O. A. Von Lilienfeld, “Quantum chemistry structures and properties of 134 kilo molecules,” Scientific data 1, 1–7 (2014).DOI
  136. [137]J. S. Smith, O. Isayev, and A. E. Roitberg, “Ani-1, a data set of 20 million calculated off-equilibrium conformations for organic molecules,” Scientific data 4, 1–8 (2017).DOI
  137. [138]A. S. Christensen, S. K. Sirumalla, Z. Qiao, M. B. O’Connor, D. G. A. Smith, F. Ding, P. J. Bygrave, A. Anandkumar, M. Welborn, F. R. Manby, and T. F. MI III, “OrbNet Denali Training Data,” (2021), 10.6084/m9.figshare.14883867.v2.DOI
  138. [139]A. S. Christensen, S. K. Sirumalla, Z. Qiao, M. B. O’Connor, D. G. A. Smith, F. Ding, P. J. Bygrave, A. Anandkumar, M. Welborn, F. R. Manby, and T. F. Miller, “Orbnet denali: A machine learning potential for biological and organic chemistry with semi-empirical cost and dft accuracy,” The Journal of Chemical Physics 155 (2021), 10.1063/5.0061990.DOI
  139. [140]A. Ullah and P. O. Dral, “Molecular quantum chemical data sets and databases for machine learning potentials,” arXiv preprint arXiv:2408.12058 (2024).DOI
  140. [141]C. N. Cavasotto, “Binding free energy calculation using quantum mechanics aimed for drug lead optimization,” Quantum mechanics in drug discovery, 257–268 (2020).DOI
  141. [142]E. A. Allen, N. Lubbers, S. Matin, J. Smith, R. Messerly, S. Tretiak, and K. Barros, “Learning together: Towards foundational models for machine learning interatomic potentials with meta-learning,” (2023), arXiv:2307.04012 [physics.chem-ph].arxiv.org/abs/2307.04012
  142. [143]D. H. Wolpert, “The lack of a priori distinctions between learning algorithms,” Neural computation 8, 1341–1390 (1996).DOI
  143. [144]A. S. Christensen and O. A. von Lilienfeld, “On the role of gradients for machine learning of molecular energies and forces,” (2020), arXiv:2007.09593 [physics.chem-ph].arxiv.org/abs/2007.09593
  144. [145]D. P. Kovács, C. v. d. Oord, J. Kucera, A. E. Allen, D. J. Cole, C. Ortner, and G. Csányi, “Linear atomic cluster expansion force fields for organic molecules: beyond rmse,” Journal of chemical theory and computation 17, 7696–7711 (2021).DOI
  145. [146]I. Batatia, S. Batzner, D. P. Kovács, A. Musaelian, G. N. C. Simm, R. Drautz, C. Ortner, B. Kozinsky, and G. Csányi, “The design space of e(3)-equivariant atom-centered interatomic potentials,” (2022), arXiv:2205.06643 [stat.ML].arxiv.org/abs/2205.06643
  146. [147]P. Eastman, P. K. Behara, D. Dotson, R. Galvelis, J. Herr, J. Horton, Y. Mao, J. Chodera, B. Pritchard, Y. Wang, G. De Fabritiis, and T. Markland, “Spice 2.0.1,” (2024).
  147. [148]D. G. Smith, D. Altaway, L. A. Burns, M. Welborn, L. N. Naden, L. Ward, S. Ellis, B. P. Pritchard, and T. D. Crawford, “The molssi qcarchive project: An open-source platform to compute, organize, and share quantum chemistry data,” Wiley Interdisciplinary Reviews: Computational Molecular Science 11, e1491 (2021).DOI
  148. [149]J. A. Vita, E. G. Fuemmeler, A. Gupta, G. P. Wolfe, A. Q. Tao, R. S. Elliott, S. Martiniani, and E. B. Tadmor, “Colabfit exchange: open-access datasets for data-driven interatomic potentials,” (2023), arXiv:2306.11071 [cond-mat.mtrl-sci].
  149. [150]Y. Yang, S. Zhang, K. D. Ranasinghe, O. Isayev, and A. E. Roitberg, “Machine learning of reactive potentials,” Annual Review of Physical Chemistry 75, 371–395 (2024).
  150. [151]U. Rivero, O. T. Unke, M. Mewly, and S. Willitsch, “Reactive atomistic simulations of Diels-Alder reactions: The importance of molecular rotations,” The Journal of Chemical Physics 151, 104301 (2019).DOI
  151. [152]S. Zhang, M. Z. Makós, R. B. Jadrich, E. Kraka, K. Barros, B. T. Nebgen, S. Tretiak, O. Isayev, N. Lubbers, R. A. Messerly, et al., “Exploring the frontiers of condensed-phase chemistry with a general reactive machine learning potential,” Nature Chemistry 16, 727–734 (2024).DOI
  152. [153]M. Gastegger and P. Marquetand, “High-dimensional neural network potentials for organic reactions and an improved training algorithm,” Journal of Chemical Theory and Computation 11, 2187–2198 (2015).
  153. [154]M. Schreiner, A. Bhowmik, T. Vegge, J. Busk, and O. Winther, “Transition1x - a dataset for building generalizable reactive machine learning potentials,” Scientific Data 9, 779 (2022).
  154. [155]T. A. Young, T. Johnston-Wood, H. Zhang, and F. Duarte, “Reaction dynamics of diels-alder reactions from machine learned potentials,” Phys. Chem. Chem. Phys. 24, 20820–20827 (2022).DOI
  155. [156]X. Pan, J. Yang, R. Van, E. Epifanovsky, J. Ho, J. Huang, J. Pu, Y. Mei, K. Fan, and Y. Shao, “Machine-learning-assisted free energy simulation of solution-phase and enzyme reactions,” Journal of Chemical Theory and Computation 17, 5745–5758 (2021).
  156. [157]T. Devergne, T. Magrino, F. Pietrucci, and A. M. Saitta, “Combining machine learning approaches and accurate ab initio enhanced sampling methods for prebiotic chemical reactions in solution,” Journal of Chemical Theory and Computation 18, 5410–5421 (2022).
  157. [158]M. Yang, L. Bonati, D. Polino, and M. Parrinello, “Using metadynamics to build neural network potentials for reactive events: the case of urea decomposition in water,” Catalysis Today 387, 143–149 (2022), 100 years of CASALE SA: a scientific perspective on catalytic processes.
  158. [159]Z. Benayad, R. David, and G. Stinermann, “Prebiotic chemical reactivity in solution with quantum accuracy and microscond sampling using neural network potentials,” Proceedings of the National Academy of Sciences 121, e232040121 (2024).
  159. [160]I.-B. Magdău, D. J. Arismendi-Arrieta, H. E. Smith, C. P. Grey, K. Hermansson, and G. Csányi, “Machine learning force fields for molecular liquids: Ethylene carbonate/ethyl methyl carbonate binary solvent,” npj Computational Materials 9, 146 (2023).
  160. [161]S. Boothroyd, L.-P. Wang, D. L. Mobley, J. D. Chodera, and M. R. Shirts, “Open force field evaluator: An automated, efficient, and scalable framework for the estimation of physical properties from molecular simulation,” Journal of chemical theory and computation 18, 3566–3576 (2022).
  161. [162]C. R. Harris, K. J. Millman, S. J. van der Walt, R. Gommers, P. Virtanen, D. Cournapeau, E. Wieser, J. Taylor, S. Berg, N. J. Smith, R. Kern, M. Picus, S. Hoyer, M. H. van Kerkwijk, M. Brett, A. Haldane, J. F. del Río, M. Wiebe, P. Peterson, P. Gérard-Marchant, K. Sheppard, T. Reddy, W. Weckesser, H. Abbasi, C. Gohlke, and T. E. Oliphant, “Array programming with numpy,” Nature 585, 357–362 (2020).DOI
  162. [163]R. J. Maple, M.-J. Hwang, T. Stockfisch, U. Dinur, M. Waldman, C. S. Ewig, and A. T. Hagler, “Derivation of class II force fields. I. methodology and quantum force field for the alkyl functional group and alkane molecules,” Journal of Computational Chemistry 15, 162–182 (1994).
  163. [164]M. J. Hwang, T. Stockfisch, and A. Hagler, “Derivation of class ii force fields. 2. derivation and characterization of a class ii force field, cff93, for the alkyl functional group and alkane molecules,” Journal of the American Chemical Society 116, 2515–2525 (1994).
  164. [165]J. Maple, M.-H. Hwang, T. Stockfisch, and A. Hagler, “Derivation of class ii force fields. iii. characterization of a quantum force field for alkanes,” Israel Journal of Chemistry 34, 195–231 (1994).
  165. [166]S. R. Xie, M. Rupp, and R. G. Hennig, “Ultra-fast interpretable machine-learning potentials,” npj Computational Materials 9 (2023), 10.1038/s41524-023-01092-7.
  166. [167]J. A. Lemkul, J. Huang, B. Roux, and A. D. J. MacKerell, “An empirical polarizable force field based on the classical drude oscillator model: Development history and recent applications,” Chemical Reviews 116, 4983–5013 (2016).
  167. [168]Y. Shi, Z. Xia, J. Zhang, R. Best, C. Wu, J. W. Ponder, and P. Ren, “Polarizable atomic multipole-based amoeba force field for proteins,” Journal of chemical theory and computation 9, 4046–4063 (2013).
  168. [169]A. Illarionov, S. Sakipov, L. Pereyaslavets, I. V. Kurnikov, G. Kamath, O. Butin, E. Voronina, I. Ivanhenko, I. Leontyev, G. Nawrocki, M. Darkhovskiy, M. Olevanov, Y. K. Cherniavsky, C. Lock, S. Greenslade, S. K. Sankaranarayanan, M. G. Kurnikova, J. Potoff, R. D. Kornberg, M. Levitt, and B. Fain, “Combining force fields and neural networks for an accurate representation of chemically diverse molecular interactions,” Journal of the American Chemical Society 145, 23620–23629 (2023).
  169. [170]A. C. T. v. Duin, S. Dasgupta, F. Lorant, and W. A. Goddard, “Reaxff: A reactive force field for hydrocarbons,” The Journal of Physical Chemistry A 105, 9396–9409 (2001).
  170. [171]M. C. Kaymak, A. Rahmounan, K. A. O’Hearn, A. C. T. v. Duin, K. M. J. Merz, and M. A. Aktulga, “Reax-reaff: A gradient-based framework for fast optimization of reactive force fields,” Journal of chemical theory and computation 18, 5181–5194 (2022).
  171. [172]A. Warsh and R. M. Weiss, “An empirical valence bond approach for comparing reactions in solutions and in enzymes,” Journal of the American Chemical Society 102, 6218–6226 (1980).
  172. [173]J. Loubaugh and G. A. Voth, “The quantum dynamics of an excess proton in water,” The Journal of Chemical Physics 104, 2056–2069 (1996).
  173. [174]D. E. Sagnella and M. E. Tuckerman, “An empirical valence bond model for proton transfer in water,” The Journal of Chemical Physics 108, 2073–2083 (1998).
  174. [175]W. W. Schmitt and G. A. Voth, “Multistate empirical valence bond model for proton transport in water,” The Journal of Physical Chemistry B 102, 5547–5551 (1998).
  175. [176]J. Åqvist and A. Warshel, “Simulation of enzyme reactions using valence bond force fields and other hybrid quantum/classical approaches,” Chemical Reviews 93, 2523–2544 (1993).
  176. [177]A. E. A. Allen and G. Csányi, “Toward transferable empirical valence bond models: Making classical force fields reactive,” The Journal of Chemical Physics 160, 124108 (2024).
  177. [178]L.-P. Wang, J. Chen, and T. Van Voorhis, “Systematic parametrization of polarizable force fields from quantum chemistry data,” Journal of chemical theory and computation 9, 452–460 (2013).
  178. [179]L.-P. Wang, T. J. Martinez, and V. S. Pande, “Building force fields: An automatic, systematic, and reproducible approach,” The Journal of physical chemistry letters 5, 1885–1891 (2014).
  179. [180]S. Thaler and J. Zavadlav, “Learning neural network potentials from experimental data via differentiable trajectory reweighting,” Nature communications 12, 6884 (2021).
  180. [181]J. Becker, R. S. DeFever, G. M. Tow, A. W. Dowling, and E. J. Maginn, “Machine learning directed optimization of classical molecular modeling force fields,” Journal of Chemical Information and Modeling 61, 4400–4414 (2021).
  181. [182]X. Wang, J. Li, L. Yang, F. Chen, Y. Wang, J. Chang, J. Chen, W. Feng, L. Zhang, and K. Yu, “Dmff: An open-source automatic differentiable platform for molecular force field development and molecular dynamics simulation,” Journal of Chemical Theory and Computation 19, 5897–5909 (2023).
  182. [183]K. B. Koziara, M. Stroet, A. K. Malde, and A. E. Mark, “Testing and validation of the automated topology builder (atb) version 2.0: prediction of hydration free enthalpies,” Journal of Computer-Aided Molecular Design 28, 221–233 (2014).
  183. [184]R. M. Betz and R. C. Walker, “Paramfit: Automated optimization of force field parameters for molecular dynamics simulations,” Journal of computational chemistry 36, 79–87 (2015).
  184. [185]E. Harder, W. Damm, J. Maple, C. Wu, M. Reboul, J. Y. Xiang, L. Wang, D. Lupyan, M. K. Dahlgren, J. L. Knight, et al., “Opls3: a force field providing broad coverage of drug-like small molecules and proteins,” Journal of chemical theory and computation 12, 281–296 (2016).
  185. [186]J. T. Horton, S. Boothroyd, J. Wagner, J. A. Mitchell, T. Gokey, D. L. Dotson, P. K. Behara, V. K. Ramaswamy, M. Mackey, J. D. Chodera, J. Anwar, D. L. Mobley, and D. J. Cole, “Open force field bespokefit: Automating bespoke torsion parametrization at scale,” Journal of Chemical Information and Modeling 62, 5622–5633 (2022).
  186. [187]A. Kumar and A. D. J. MacKerell, “Ferfram-v2.0: A comprehensive tool for charmm additive and drude polarizable force-field parameter optimization and validation,” The Journal of Physical Chemistry B 128, 4385–4395 (2024).
  187. [188]J. A. Maier, C. Martinez, K. Kasavajhala, L. Wickstrom, K. E. Hauser, and C. Simmerling, “ff14sb: improving the accuracy of protein side chain and backbone parameters from ff99sb,” Journal of chemical theory and computation 11, 3696–3713 (2015).
  188. [189]M. Zgarbová, J. Sponer, M. Otyepka, T. E. Cheatham III, R. Galindo-Murillo, and P. Jurečka, “Refinement of the sugar–phosphate backbone torsion beta for amber force fields improves the description of z- and b-dna,” Journal of chemical theory and computation 11, 5723–5736 (2015).
  189. [191]M. Zgarbová, M. Otyepka, J. Šponer, A. Mĺádek, P. Banáš, T. E. Cheatham III, and P. Jurečka, “Refinement of the cornell et al. nucleic acids force field based on reference quantum chemical calculations of glycosidic torsion profiles,” Journal of Chemical Theory and Computation 7, 2886–2902 (2011).
  190. [192]W. L. Jorgensen, J. Chandrasekhar, J. D. Madura, R. W. Impey, and M. L. Klein, “Comparison of simple potential functions for simulating liquid water,” The Journal of chemical physics 79, 926–935 (1983).
  191. [193]H. W. Horn, W. C. Swope, J. W. Pitera, J. D. Madura, T. J. Dick, G. L. Hura, and T. Head-Gordon, “Development of an improved four-site water model for biomolecular simulations: Tip4p-ew,” The Journal of chemical physics 120, 9665–9678 (2004).
  192. [194]S. Izadi, R. Anandakrishnan, and A. V. Onufriev, “Building water models: A different approach,” The Journal of Physical Chemistry Letters 5, 3863–3871 (2014).
  193. [195]I. S. Joung and T. E. Cheatham III, “Determination of alkali and halide monovalent ion parameters for use in explicitly solvated biomolecular simulations,” The journal of physical chemistry B 112, 9020–9041 (2008).
  194. [196]I. S. Joung and T. E. Cheatham III, “Molecular dynamics simulations of the dynamic and energetic properties of alkali and halide ions using water-model-specific ion parameters,” The Journal of Physical Chemistry B 113, 13279–13290 (2009).
  195. [197]P. Li, B. P. Roberts, D. K. Chakravorty, and K. M. Merz Jr, “Rational design of particle mesh ewald compatible lennard-jones parameters for +2 metal cations in explicit solvent,” Journal of chemical theory and computation 9, 2733–2748 (2013).
  196. [198]P. Li and K. M. Merz Jr, “Taking into account the ion-induced dipole interaction in the nonbonded model of ions,” Journal of chemical theory and computation 10, 289–297 (2014).
  197. [199]P. Li, L. F. Song, and K. M. Merz Jr, “Parameterization of highly charged metal ions using the 12-6-4 lj-type nonbonded model in explicit water,” The Journal of Physical Chemistry B 119, 883–895 (2015).
  198. [200]C. J. Dickson, R. C. Walker, and I. R. Gould, “Lipid21: complex lipid membrane simulations with amber,” Journal of chemical theory and computation 18, 1726–1736 (2022).
  199. [201]K. N. Kirschner, A. B. Yongye, S. M. Tschampel, J. González-Outeiriño, C. R. Daniels, B. L. Foley, and R. J. Woods, “Glycam06: a generalizable biomolecular force field. carbohydrates,” Journal of computational chemistry 29, 622–655 (2008).
  200. [202]M. L. DeMarco and R. J. Woods, “Atomic-resolution conformational analysis of the gm3 ganglioside in a lipid bilayer and its implications for ganglioside–protein recognition at membrane surfaces,” Glycobiology 19, 344–355 (2009).
  201. [203]M. L. DeMarco, R. J. Woods, J. H. Prestegard, and F. Tian, “Presentation of membrane-anchored glycosphingolipids determined from molecu lar dynamics simulations and nmr paramagnetic relaxation rate enhancement,” Journal of the American Chemical Society 132, 1334–1338 (2010).
  202. [204]J. Wang, R. M. Wolf, J. W. Caldwell, P. A. Kollman, and D. A. Case, “Development and testing of a general amber force field,” Journal of computational chemistry 25, 1157–1174 (2004).
  203. [205]J. Wang, Wang, P. A. Kollman, and D. A. Case, “Automatic atom type and bond type perception in molecular mechanical calculations,” Journal of molecular graphics and modelling 25, 247–260 (2006).
  204. [206]G. A. Khoury, J. P. Thompson, J. Smadbeck, C. A. Kieslich, and C. A. Floudas, “Forcefield_ptm: Ab initio charge and amber forcefield parameters for frequently occurring post-translational modifications,” Journal of chemical theory and computation 9, 5653–5674 (2013).
  205. [207]R. Aduri, B. T. Psciuk, P. Saro, H. Taniga, H. B. Schlegel, and J. SantaLucia, “Amber force field parameters for the naturally occurring modified nucleosides in rna,” Journal of chemical theory and computation 3, 1464–1475 (2007).
  206. [208]D. L. Mobley, C. C. Bannan, A. Rizzi, C. I. Bayly, J. D. Chodera, V. T. Lim, N. M. Lim, K. A. Beauchamp, D. R. Slochower, M. R. Shirts, et al., “Escaping atom types in force fields using direct chemical perception,” Journal of chemical theory and computation 14, 6076–6092 (2018).
  207. [209]M. Stroet, B. Caron, M. S. Engler, J. v. d. Woning, A. Kauffmann, M. v. Dijk, M. El-Kebir, K. M. Visscher, J. Holownia, C. Macfarlane, B. J. Bennion, S. Gelpi-Dominguez, F. C. Lightstone, T. v. d. Storm, D. P. Geerke, A. E. Mark, and G. W. Klau, “Oframp: a fragment-based tool to facilitate the parametrization of large molecules,” Journal of computer-aided molecular design 37, 357–371 (2023).
  208. [210]J. D. Yesselman, D. J. Price, J. L. Knight, and C. L. Brooks III, “Match: An atom-typing toolset for molecular mechanics force fields,” Journal of computational chemistry 33, 189–202 (2012).
  209. [211]L. Wang, P. K. Behara, M. W. Thompson, T. Gokey, Y. Wang, J. R. Wagner, D. J. Cole, M. K. Gilson, M. R. Shirts, and D. L. Mobley, “The open force field initiative: Open software and open science for molecular modeling,” The Journal of Physical Chemistry B (2024).
  210. [212]J. Wagner, M. Thompson, D. L. Mobley, J. Chodera, C. Bannan, A. Rizzi, trevorgokey, D. L. Dotson, J. A. Mitchell, jaimergp, Camila, P. Behara, C. Bayly, JoshHorton, I. Pulido, L. Wang, V. Lim, S. Sasmal, Simon-Boothroyd, A. Dalke, D. Smith, B. Westbrook, J. Horton, L.-P. Wang, R. Gowers, Z. Zhao, C. Davel, and Y. Zhao, “openforcefield/openff-toolkit: 0.15.2 Minor feature release,” (2024).
  211. [213]A. R. McIsaac, P. K. Behara, T. Gokey, C. Cavender, J. Horton, L. Wang, B. R. Westbrook, M. W. Thompson, M. Osato, H. M. Baumann, H. Jang, J. Wagne, D. Cole, C. Bayly, and D. Mobley, “openforcefield/openff-forcefields,” (2024).
  212. [214]K. Roos, C. Wu, W. Damm, M. Reboul, J. M. Stevenson, C. Lu, M. K. Dahlgren, S. Mondal, W. Chen, L. Wang, R. Abel, R. A. Friesner, and E. D. Harder, “Olspe3e: Extending force field coverage for drug-like small molecules,” Journal of Chemical Theory and Computation 15, 1863–1874 (2019).
  213. [215]T. Gokey and D. L. Mobley, “Hierarchical clustering of chemical space using binary-encoded smarts for building data-driven chemical perception models,” (2023).
  214. [216]Y. Wang, J. Fass, B. Kaminow, J. E. Herr, D. Rufa, I. Zhang, I. Pulido, M. Henry, H. E. Bruce Macdonald, K. Takaba, and J. D. Chodera, “End-to-end differentiable construction of molecular mechanics force fields,” Chem. Sci. 13, 12016–12033 (2022).
  215. [217]T. Takaba, I. Pulido, P. K. Behara, C. E. Cavender, A. J. Friedman, M. M. Henry, H. M. Opeskin, C. R. Rachella, A. M. Nagle, A. M. Payne, M. R. Shirts, D. L. Mobley, J. D. Chodera, and Y. Wang, “Machine-learned molecular mechanics force field for the simulation of protein-ligand systems and beyond,” (2023), arXiv:2307.07085 [physics.chem-ph].DOI
  216. [218]G. Chen, T. Jaffrelot Inizan, T. Plé, L. Lagardère, J.-P. Piquemal, and Y. Maday, “Advancing force fields parametrization: A directed graph attention networks approach,” Journal of Chemical Theory and Computation 20, 5558–5569 (2024).
  217. [219]L. Seute, E. Hartmann, J. Stühmer, and G. Frauke, “Grappa – a machine learned molecular mechanics force field,” arXiv preprint arXiv:2404.00050 (2024).DOI
  218. [220]M. Thürlemann, L. Böselt, and S. Riniker, “Regularized by physics: Graph neural network parametrized potentials for the description of intermolecular interactions,” Journal of Chemical Theory and Computation
  219. [221]M. T. Lehner, P. Katzberger, N. Maeder, C. C. Schiebroek, J. Teetz, G. A. Landrum, and S. Riniker, “Dash: Dynamic attention-based substructure hierarchy for partial charge assignment,” Journal of Chemical Information and Modeling 63, 6014–6028 (2023).
  220. [222]Y. Wang, I. Pulido, K. Takaba, B. Kaminow, J. Scheen, L. Wang, and J. D. Chodera, “Espalomacher: Machine learning-enabled ultrafast partial charge assignment,” The Journal of Physical Chemistry A 128, 4160–4167 (2024).
  221. [223]Y. Wang, J. Fass, C. D. Stern, K. Luo, and J. Chodera, “Graph nets for partial charge prediction,” (2019), arXiv:1909.07903 [physics.comp-ph].arxiv.org/abs/1909.07903
  222. [224]Y. Wang, Graph Machine Learning for (Bio) Molecular Modeling and Force Field Construction (Weill Medical College of Cornell University, 2023).
  223. [225]S. Passaro and C. L. Zitnick, “Reducing so(3) convolutions to so(2) for efficient equivariant gnns,” (2023), arXiv:2302.03655 [cs.LG].arxiv.org/abs/2302.03655
  224. [226]S. Luo, T. Chen, and A. S. Krishnapriyan, “Enabling efficient equivariant operations in the fourier basis via gaunt tensor products,” (2024), arXiv:2401.10216 [cs.LG].
  225. [227]B. Cheng, “Cartesian atomic cluster expansion for machine learning interatomic potentials,” (2024), arXiv:2402.07472 [physics.comp-ph].arxiv.org/abs/2402.07472
  226. [228]B. Smit, P. Hilbers, K. Esselink, L. Rupert, N. Van Os, and A. Schlijper, “Computer simulations of a water/oil interface in the presence of micelles,” Nature 348, 624–625 (1990).
  227. [229]M. Müller, K. Katsov, and M. Schick, “Biological and synthetic membranes: What can be learned from a coarse-grained description?” Physics Reports 434, 113–176 (2006).
  228. [230]S. J. Marrink, H. J. Risselada, S. Yefimov, D. P. Tieleman, and A. H. De Vries, “The martini force field: coarse grained model for biomolecular simulations,” The journal of physical chemistry B 111, 7812–7824 (2007).
  229. [231]P. C. Souza, R. Alessandri, J. Barnoud, S. Thallmair, I. Faustino, F. Grünewald, I. P. Matmanidis, H. Abdizadeh, B. M. Bruininks, T. A. Wassenaar, et al., “Martini 3: a general purpose force field for coarse-grained molecular dynamics,” Nature methods 18, 382–388 (2021).
  230. [232]W. Wang, S. Olsson, C. Wehmeyer, A. Pérez, N. E. Charron, G. De Fabritiis, F. Noé, and C. Clementi, “Machine learning of coarse-grained molecular dynamics force fields,” ACS central science 5, 755–767 (2019).
  231. [233]W. Wang and R. Gómez-Bombarelli, “Coarse-graining auto-encoders for molecular dynamics,” npj Computational Materials 5, 125 (2019).
  232. [234]S. Yang and R. Gómez-Bombarelli, “Chemically transferable generative backmapping of coarse-grained proteins,” arXiv preprint arXiv:2303.01569 (2023).arxiv.org/abs/2303.01569
  233. [235]S. Wang, B. Z. Li, M. Khabsa, H. Fang, and H. Ma, “Uniformer: Self-attention with linear complexity,” (2020), arXiv:2006.04768 [cs.LG].arxiv.org/abs/2006.04768
  234. [236]A. Vaswani, N. Shazeer, N. Parmar, J. Uszkoreit, L. Jones, A. N. Gomez, L. Kaiser, and I. Polosukhin, “Attention is all you need,” (2023), arXiv:1706.03762 [cs.CL].
  235. [237]J. D. Gale, L. M. LeBlanc, P. R. Spackman, A. Silvestri, and P. Raiteri, “A universal force field for materials, periodic gfn-ff: implementation and examination,” Journal of Chemical Theory and Computation 17, 7827–7849 (2021).
  236. [238]R. M. Gunner, T. Murakami, A. S. Runstenburg, M. Işık, and J. D. Chodera, “Standard state free energies, not pk as, are ideal for describing small molecule protonation and tautomeric states,” Journal of Computer-Aided Molecular Design 34, 561–573 (2020).
  237. [239]P. Eastman, B. P. Pritchard, J. D. Chodera, and T. E. Markland, “Nutmeg and spice: Models and data for biomolecular machine learning,” (2024), arXiv:2406.13112 [physics.chem-ph].arxiv.org/abs/2406.13112
  238. [240]A. Vaswani, N. Shazeer, N. Parmar, J. Uszkoreit, L. Jones, A. N. Gomez, L. Kaiser, and I. Polosukhin, “Attention is all you need,” (2023), arXiv:1706.03762 [cs.CL].
  239. [241]S. M. Larson, C. D. Snow, M. Shirts, and V. S. Pande, “Folding@home and genome@home: Using distributed computing to tackle previously intractable problems in computational biology,” (2009), arXiv:0901.0866 [physics.bio-ph].
  240. [242]M. Thürlemann, L. Böselt, and S. Riniker, “Learning atomic multipoles: Prediction of the electrostatic potential with equivariant graph neural networks,” Journal of Chemical Theory and Computation 18, 1701–1710 (2022), pMID: 35112866, https://doi.org/10.1021/acs.jctc.1c01021.
  241. [243]A. K. Rappe and W. A. Goddard III, “Charge equilibration for molecular dynamics simulations,” The Journal of Physical Chemistry 95, 3358–3363 (1991).
  242. [244]T. W. Ko, J. A. Finkler, S. Goedecker, and J. Behler, “A fourth-generation high-dimensional neural network potential with accurate electrostatics including non-local charge transfer,” Nat. Commun. 12, 1–11 (2021).
  243. [245]D. M. Anstine and O. Isayev, “Machine learning interatomic potentials and long-range physics,” The Journal of Physical Chemistry A 127, 2417–2431 (2023).
  244. [246]J. Westermayr, S. Chaudhuri, A. Jeindl, O. T. Hofmann, and R. J. Maurer, “Long-range dispersion-inclusive machine learning potentials for structure search and optimization of hybrid organic–inorganic interfaces,” Digital Discovery 1, 463–475 (2022).
  245. [247]N. T. P. Tu, N. Rezajooei, E. R. Johnson, and C. N. Rowley, “A neural network potential with rigorous treatment of long-range dispersion,” Digital Discovery (2023).
  246. [248]L. Bölsel, M. Thürlemann, and S. Riniker, “Machine learning in qm/mm molecular dynamics simulations of condensed-phase systems,” Journal of Chemical Theory and Computation 17, 2641–2658 (2021).
  247. [249]H. M. Senn and W. Thiel, “QM/MM methods for biomolecular systems,” Angew. Chem. Int. Ed Engl. 48, 1198–1229 (2009).
  248. [250]D. J. Cole, L. Mones, and G. Csányi, “A machine learning based intramolecular potential for a flexible organic molecule,” Faraday Discussions 224, 247–264 (2020).
  249. [251]J. Karwanske, Z. Wu, S. Tkaczyk, S. Wang, A. Baskerville, K. Ranasinghe, T. Langer, G. P. Wood, M. Wieder, and S. Boresch, “Insights and challenges in correcting force field based solvation free energies using a neural network potential,” The Journal of Physical Chemistry B 128, 6693–6703 (2024).
  250. [252]B. Lier, P. Poliak, P. Marquetand, J. Westermayr, and C. Oostenbrink, “BuRNN: Buffer region neural network approach for Polarizable Embedding neural Network/Molecular mechanics simulations,” J. Phys. Chem. Lett. 3, 3812–3818 (2022).
  251. [253]A. W. H. Grubmüller, H. Heller and K. Schulten, “Generalized verlet algorithm for efficient molecular dynamics simulations with long-range interactions,” Molecular Simulation 6, 121–142 (1991).
  252. [254]M. Tuckerman, B. J. Berne, and G. J. Martyna, “Reversible multiple time scale molecular dynamics,” The Journal of Chemical Physics 97, 1990–2001 (1992).
  253. [255]D. T. W. Streett and G. Saville, “Multiple time-step methods in molecular dynamics,” Molecular Physics 35, 639–648 (1978).
  254. [256]P. Minary, M. E. Tuckerman, and G. J. Martyna, “Long time molecular dynamics for enhanced conformational sampling in biomolecular systems,” Phys. Rev. Lett. 93, 150201 (2004).
  255. [257]P. F. Batcho, D. A. Case, and T. Schlick, “Optimized particle-mesh Ewald/multiple-time step integration for molecular dynamics simulations,” The Journal of Chemical Physics 115, 4003–4018 (2001).
  256. [258]M. Guidon, F. Schiffmann, J. Hutter, and J. VandeVondele, “Ab initio molecular dynamics using hybrid density functionals,” The Journal of Chemical Physics 128, 214104 (2008).
  257. [259]R. P. Steele, “Communication: Multiple-timestep ab initio molecular dynamics with electron correlation,” The Journal of Chemical Physics 139, 011102 (2013).
  258. [260]N. Luehr, T. E. Markland, and T. J. Martínez, “Multiple time step integrators in ab initio molecular dynamics,” The Journal of Chemical Physics 140, 084116 (2014).
  259. [261]W. Wang, S. Axelrod, and R. Gómez-Bombarelli, “Differentiable molecular simulations for control and learning,” (2020), arXiv:2003.00868 [physics.comp-ph].arxiv.org/abs/2003.00868
  260. [262]J. G. Greener and T. D. Jones, “Differentiable molecular simulation can learn all the parameters in a coarse-grained force field for proteins,” PloS One 16, e0256990 (2021).
  261. [263]P. Kidger, R. T. Q. Chen, and T. J. Lyons, ““hey, that’s not an ode”: Faster ode adjoints via seminorms.” International Conference on Machine Learning (2021).
  262. [264]R. T. Q. Chen, Y. Rubanova, J. Bettencourt, and D. Duvenaud, “Neural ordinary differential equations,” Advances in Neural Information Processing Systems (2018).
  263. [265]L. S. Pontryagin, Mathematical theory of optimal processes (Routledge, 2018).
  264. [266]S. S. Schoenholz and E. D. Cubuk, “Iax m.d. a framework for differentiable physics,” in Advances in Neural Information Processing Systems, Vol. 33 (Curran Associates, Inc., 2020).
  265. [268]J. Bradbury, R. Frostig, P. Hawkins, M. J. Johnson, C. Leary, D. Maclaurin, K. Necula, A. Paszke, J. VanderPlas, S. Wanderman-Milne, and Q. Zhang, “JAX: composable transformations of Python+NumPy programs,” (2018).
  266. [269]A. Paszke, S. Gross, F. Massa, A. Lerer, J. Bradbury, G. Chanan, T. Killeen, Z. Lin, N. Gimelshein, L. Antiga, A. Desmaison, A. Köpf, E. Yang, Z. DeVito, M. Raison, A. Tejani, S. Chilamkurthy, B. Steiner, L. Fang, J. Bai, and S. Chintala, “PyTorch: An imperative style, high-performance deep learning library,” (2019), arXiv:1912.01703 [cs.LG].arxiv.org/abs/1912.01703
  267. [270]NVIDIA, (2017).
  268. [271]Y. Zhao, “timemachine,” https://github.com/proteiner/timemachine (2024).
  269. [272]R. O. Dror, C. Young, and D. E. Shaw, “Anton, a special-purpose molecular simulation machine.” (2011).
  270. [273]D. E. Shaw, P. J. Adams, A. Azaria, J. A. Bank, B. Batson, A. Bell, M. Bergdorf, J. Bhatt, J. A. Butts, T. Correia, et al., “Anton 3: twenty microseconds of molecular dynamics simulation before lunch,” in Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis (2021) pp. 1–11.
  271. [274]R. Bommasani, D. A. Hudson, E. Adeli, R. Altman, S. Arora, S. von Arx, M. S. Bernstein, J. Bohg, A. Bosselut, E. Brunskill, E. Brynjolfsson, S. Buch, D. Card, R. Castellon, N. Chatterji, A. Chen, K. Creel, J. Q. Davis, D. Demszky, C. Donahue, M. Doumbouya, E. Durmus, S. Ermon, J. Etchemendy, K. Ethayarajh, G. Fei-Fei, C. Finn, T. Gale, L. Gillespie, K. Goel, N. Goodman, S. Grossman, G. Guha, T. Hashimoto, P. Henderson, J. Hewitt, D. E. Ho, J. Hong, K. Hsu, J. Huang, T. Icard, S. Jain, D. Jurafsky, P. Kalluri, S. Karachmeti, G. Keeling, F. Khani, O. Khattab, P. W. Koh, M. Krass, R. Krishna, R. Kudtipudi, A. Kumar, F. Ladhak, M. Lee, T. Lee, J. Leskovec, I. Levent, X. L. Li, X. Li, T. Ma, A. Malik, C. D. Manning, S. Mirchandani, E. Mitchell, Z. Munyikwa, S. Nair, A. Narayan, D. Narayanan, B. Newman, A. Nie, J. C. Niebles, H. Nilforoshan, J. Nyarko, C. Ogut, L. Orr, I. Papadimitriou, J. S. Park, C. Piech, E. Portelance, C. Potts, A. Raghunathan, R. Reich, H. Ren, F. Rong, Y. Roohani, C. Ruiz, J. Ryan, C. Ré, D. Sadigh, S. Sagawa, K. Santhanam, A. Shih, K. Srinivasan, A. Tamkin, R. Taori, A. W. Thomas, F. Tramèr, R. E. Wang, W. Wang, B. Wu, J. Wu, Y. Wu, S. M. Xie, M. Yasunaga, J. You, M. Zaharia, M. Zhang, T. Zhang, X. Zhang, Y. Zhang, L. Zheng, K. Zhou, and P. Liang, “On the opportunities and risks of foundation models,” (2022), arXiv:2108.07258 [cs.LG].arxiv.org/abs/2108.07258
  272. [275]L. Chanussot, A. Das, S. Goyal, T. Lavril, M. Shuai, M. Riviere, K. Tran, J. Heras-Domingo, C. Ho, W. Hu, A. Palizhati, A. Sriram, B. Wood, J. Yoon, D. Parikh, C. L. Zitnick, and Z. Ulissi, “Open catalyst 2020 (oc20) dataset and community challenges,” ACS Catalysis 11, 6059–6072 (2021).
  273. [276]A. Jain, S. P. Ong, G. Hautier, W. Chen, W. D. Richards, S. Dacek, S. Cholia, D. Gunter, D. Skinner, G. Ceder, et al., “Commentary: The materials project: A materials genome approach to accelerating materials innovation,” APL materials 1 (2013).
  274. [277]C. Zang and F. Wang, “MoFlow: An invertible flow model for generating molecular graphs,” in Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery; Data Mining, KDD ’20 (ACM, 2020).
  275. [278]W. Jin, R. Barzilay, and T. Jaakkola, “Junction tree variational autoencoder for molecular graph generation,” (2019), arXiv:1802.08436 [cs.LG].
  276. [279]C. Shi, M. Xu, Z. Zhu, W. Zhang, M. Zhang, and J. Tang, “Graphaf: a flow-based autoregressive model for molecular graph generation,” (2020), arXiv:2001.09382 [cs.LG].arxiv.org/abs/2001.09382
  277. [280]E. Mansimov, O. Mahmood, S. Kang, and K. Cho, “Molecular geometry prediction using a deep generative graph neural network,” Scientific Reports 9 (2019), 10.1038/s41598-019-56773-5.
  278. [281]E. Hoogeboom, V. G. Satorras, C. Vignac, and M. Welling, “Equivariant diffusion for molecule generation in 3d,” (2022), arXiv:2203.17003 [cs.LG].arxiv.org/abs/2203.17003
  279. [282]J. Jumper, R. Evans, A. Pritzel, T. Green, M. Figurnov, O. Ronneberger, K. Tunyasuvunakool, R. Bates, A. Žídek, A. Potapenko, et al., “Highly accurate protein structure prediction with alphafold,” nature 596, 583–589 (2021).
  280. [283]J. Abramson, J. Adler, J. Dunger, R. Evans, T. Green, A. Pritzel, O. Ronneberger, L. Willmore, A. J. Ballard, J. Bambrick, et al., “Accurate structure prediction of biomolecular interactions with alphafold3,” Nature 1, 3–24 (2024).
  281. [284]G. Ahdritz, N. Bouatta, C. Floristean, S. Kadyan, Q. Xia, W. Gerecke, T. J. O’Donnell, D. Berenberg, I. Fisk, N. Zanichelli, et al., “Openfold: Retraining alphafold2 yields new insights into its learning mechanisms and capacity for generalization,” Nature Methods , 1–11 (2024).
  282. [285]L. Klein, A. Y. K. Foong, T. E. Fjelde, B. Mlodozeniec, M. Brockschmidt, S. Nowozin, F. Noé, and R. Tomioka, “Timewarp: Transferable acceleration of molecular dynamics by learning time-coarsened dynamics,” (2023), arXiv:2302.01170 [stat.ML].arxiv.org/abs/2302.01170
  283. [286]F. Noé, S. Olsson, J. Köhler, and H. Wu, “Boltzmann generators: Sampling equilibrium states of many-body systems with deep learning,” Science 365, eaaw1147 (2019).
  284. [287]M. E. Tuckerman, “Machine learning transforms how microstates are sampled,” Science 365, 982–983 (2019).
  285. [288]L. Klein and F. Noé, “Transferable boltzmann generators,” (2024), arXiv:2406.14426 [stat.ML].arxiv.org/abs/2406.14426
  286. [289]J. Köhler, L. Klein, and F. Noé, “Equivariant flows: exact likelihood generative learning for symmetric densities,” in International conference on machine learning (PMLR, 2020), pp. 5361–5370.
  287. [290]L. I. Midgley, V. Stimper, J. Antorán, E. Mathieu, B. Schölkopf, and J. M. Hernández-Lobato, “Se(3) equivariant augmented coupling flows,” (2024), arXiv:2308.10364 [cs.LG].arxiv.org/abs/2308.10364
  288. [291]V. G. Satorras, E. Hoogeboom, F. B. Fuchs, I. Posner, and M. Welling, “E(n) equivariant normalizing flows,” (2022), arXiv:2105.09016 [cs.LG].arxiv.org/abs/2105.09016
  289. [292]Y. LeCun, S. Chopra, R. Hadsell, M. Ranzato, F. Huang, et al., “A tutorial on energy-based learning,” Predicting structured data 1 (2006).
  290. [293]Y. Song and D. P. Kingma, “How to train your energy-based models,” arXiv preprint arXiv:2101.03288 (2021).arxiv.org/abs/2101.03288
  291. [294]F.-A. Croitoru, V. Hondru, R. T. Ionescu, and M. Shah, “Diffusion models in vision: A survey,” IEEE Transactions on Pattern Analysis and Machine Intelligence 45, 10850–10869 (2023).
  292. [295]L. Yang, Z. Zhang, Y. Song, S. Hong, R. Xu, Y. Zhao, W. Zang, B. Cui, and M.-H. Yang, “Diffusion models: A comprehensive survey of methods and applications,” ACM Computing Surveys 56, 1–39 (2023).
  293. [296]Y. Song, J. Sohl-Dickstein, D. P. Kingma, A. Kumar, S. Ermon, and B. Poole, “Score-based generative modeling through stochastic differential equations,” (2021), arXiv:2011.13456 [cs.LG].arxiv.org/abs/2011.13456
  294. [297]J. Ho, A. Jain, and P. Abbeel, “Denoising diffusion probabilistic models,” (2020), arXiv:2006.11239 [cs.LG].arxiv.org/abs/2006.11239
  295. [298]M. Arts, V. G. Satorras, C.-W. Huang, D. Zuegner, M. Federici, C. Clementi, F. Noé, R. Pinsler, and R. van den Berg, “Two for one: Diffusion models and force fields for coarse-grained molecular dynamics,” (2023), arXiv:2302.00600 [cs.LG].arxiv.org/abs/2302.00600

Paper details

vlnc:W_j86w3ucv
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Physics and Astronomy

Not recorded for this paper

View statement
Looking for related papers…
Contents