Evidence map›Paper›PMID 40275478›Full record

ArticleJournal of chemical theory and computation2025

Beyond Numerical Hessians: Higher-Order Derivatives for Machine Learning Interatomic Potentials via Automatic Differentiation.

Nils Gönnheimer, Karsten Reuter, Johannes T Margraf

Abstract read
In one paragraph

Article in Journal of chemical theory and computation, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 4 papers.

0numbers the graph read from it
0cells of the map it votes in
4citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

4 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors.

Nils GönnheimerBavarian Center for Battery Technology (BayBatt), University of Bayreuth, Bayreuth 95448, Germany.
Karsten ReuterFritz Haber Institute of the Max Planck Society, Berlin 14195, Germany.ORCID 0000-0001-8473-8659
Johannes T MargrafBavarian Center for Battery Technology (BayBatt), University of Bayreuth, Bayreuth 95448, Germany.ORCID 0000-0002-0862-5289

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

The development of machine learning interatomic potentials (MLIPs) has revolutionized computational chemistry by enhancing the accuracy of empirical force fields while retaining a large computational speed-up compared to first-principles calculations. Despite these advancements, the calculation of Hessian matrices for large systems remains challenging, in particular because analytical second-order derivatives are often not implemented. This necessitates the use of computationally expensive finite-difference methods, which can furthermore display low precision in some cases. Automatic differentiation (AD) offers a promising alternative to reduce this computational effort and makes the calculation of Hessian matrices more efficient and accurate. Here, we present the implementation of AD-based second-order derivatives for the popular MACE equivariant graph neural network architecture. The benefits of this method are showcased via a high-throughput prediction of heat capacities of porous materials with the MACE-MP-0 foundation model. This is essential for precisely describing gas adsorption in these systems and was previously possible only with bespoke ML models or expensive first-principles calculations. We find that the availability of foundation models and accurate analytical Hessian matrices offers comparable accuracy to bespoke ML models in a zero-shot manner and additionally allows for the investigation of finite-size and rounding errors in the first-principles data.

Identifiers

PMID40275478
PMCPMC12080109

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.