A Neural Network Potential with Rigorous Treatment of Long-Range Dispersion
Bibliographic record
Abstract
Neural Network Potentials (NNPs) have quickly emerged as powerful computational methods for modeling large chemical systems with the accuracy of quantum mechanical methods but at a much smaller computational cost. To make the training and evaluation of the underlying neural networks practical, these methods commonly cutoff interatomic interactions at a modest range (e.g., 5~\AA), so longer-range interactions like London dispersion are neglected. This limits the accuracy of these models for intermolecular interactions. In this work, we develop a new NNP designed for modeling chemical systems were dispersion is an essential component. This new NNP is extended to treat dispersion interactions rigorously by calculating atomic dispersion coefficients through a second NN, which is trained to reproduce the coefficients from the quantum-mechanically derived exchange-hole dipole moment (XDM) model. Calculation of the dispersion component of intermolecular interactions through this scheme provides results in very good agreement with the QM data, with a mean absolute error (MAE) of 0.6 kcal/mol and a coefficient of determination (R2) of 0.98. The dispersion components of these intermolecular interactions are predicted in excellent agreement with the QM data, with a mean absolute error (MAE) of 0.02 kcal/mol and an R2 of 1.00. This combined dispersion-corrected NNP, called ANIPBE0-MLXDM, predicts intermolecular interaction energies for complexes from the DE370K test set with an MAE of 0.5 kcal/mol and an R2 of 0.94 relative to high-level ab initio results (CCSD(T)/CBS), but with a computational cost that is billions of times smaller. The ANIPBE0-MLXDM method is effective for simulating large-scale dispersion-driven systems, like gas adsorption in porous materials, molecular liquids, and nanostructures, on a single computer workstation.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".