Marcel F. Langer, Adrian Hill, Michele Ceriotti
A carefully validated, immediately useful method that raises the tractable system size for MLIP Hessians by ~4x and wall time by ~10x, with a genuinely novel 'lossy ASD' twist, but limited by single-observable validation, two model families, and a JAX-only implementation.
Machine learning interatomic potentials (MLIPs) learn the mapping from atomic positions to potential energy. The forces, the negative gradient of this energy, drive molecular dynamics and are readily obtained using automatic differentiation. Higher-order derivatives, most notably the Hessian, describe collective motion and allow the direct prediction of experimental observables, but are considered computationally inaccessible for large systems. We suggest a solution: in physical systems, interactions decay with distance, and most MLIPs build on this locality through message passing up to a finite receptive field. This implies both sparsity of higher-order derivatives and their decay with distance. This structure can be exploited using automatic sparse differentiation (ASD). We explain how to compute the sparsity pattern for MLIP derivatives and demonstrate that, for multiple foundation MLIPs, ASD computes full Hessians of large porous materials exactly, but with modest speedups at best. The larger gains come from truncated ASD: discarding small, but nonzero, Hessian entries between distant atoms yields order-of-magnitude speedups with negligible impact on predicted observables.
The paper addresses a concrete and widely felt bottleneck: computing full Hessians of machine-learning interatomic potentials (MLIPs), which cost backward passes and hence , capping vibrational analysis at ~2000 atoms in prior work (Gönnheimer et al. 2025). The contribution has three parts. (1) A closed-form derivation of the exact Hessian sparsity pattern for message-passing MLIPs: the pattern is the Boolean sum of adjacency-matrix powers up to , with for node readouts (MACE) and for edge readouts (PET). (2) An application of classical automatic sparse differentiation (ASD) — star coloring plus compressed HVPs — with the practically important optimization of coloring the atom graph rather than the coordinate pattern (17× median coloring speedup, 22.8 h → 1.2 h across the benchmark). (3) The genuinely novel piece: *truncated* ASD, in which a deliberately-too-small -hop pattern is used, accepting both discarded couplings and coloring-collision contamination, in exchange for far fewer HVPs.
The headline empirical structure is notable for its honesty: exact ASD is essentially a negative result (median end-to-end speedups of 1.2–1.7×, never above 6×), because foundation-model receptive fields are comparable in size to even large MOF unit cells. The payoff is in truncation: force-constant blocks decay ~2 orders of magnitude per hop for MACE and ~1 for PET, so (MACE) or (PET-S) converges to <0.1‰ at 11–13× median speedup.
This is the strongest aspect of the paper and well above typical standards for the format. Specifically: the hop count is not merely argued but verified empirically in 96 measurements on hand-built graph families using randomly initialized models (where all structurally allowed couplings are generically nonzero) plus production checkpoints. Supercells are chosen *exactly* per structure and model by tracking periodic image folding, rather than by the usual "large enough" heuristic. The JAX re-implementations of MACE and PET are validated against upstream PyTorch in double precision, with a valuable warning that JAX's default TF32 matmuls degrade forces by nearly four orders of magnitude — a practical trap that others will benefit from. Ablations isolate precision, the D3 correction, and PET's adaptive-cutoff force terms. The benchmark subset is selected deterministically by farthest-point sampling on interpretable features (size, density, Hessian fill). The truncation error is decomposed into discarded-coupling and contamination components, with contamination found to track the discarded term at a stable ~0.6 ratio down to the single-precision floor. Timings are end-to-end, including pattern construction and coloring, and break-even is marked explicitly.
The main methodological gap is the absence of comparison to the community's actual workflow: finite-displacement force constants with crystal-symmetry reduction (phonopy), which is the real competitor to dense AD. Speedups are quoted only against dense AD. Additionally, the truncation claim rests on a single observable, the heat capacity — arguably the most forgiving one, being an integral over the spectrum. The authors are candid that linewidths and third-order properties will weight exactly the distant couplings truncation discards, but this means "negligible impact on predicted observables" is currently supported narrowly.
Phonons from foundation MLIPs are an actively growing area (Loew et al. 2025; Elena et al. 2025; PFT; HORM; HIP). Moving the tractable ceiling from ~1900 atoms to ~7000–9000 atoms on a single H100, with order-of-magnitude wall-time reductions (e.g., RSM0010 MACE: 39,619 s → ~5,600 s at ), is a real enabler for high-throughput screening of porous materials, thermal transport, and vibrational spectroscopy. A secondary conceptual contribution likely to outlast the specific implementation is the observation that message-passing depth is now a *cost-relevant* architectural decision: receptive field size directly sets higher-derivative sparsity, which reframes a design choice previously made on accuracy grounds alone. The "lossy ASD" idea — using a subset sparsity pattern when per-entry magnitudes can be bounded a priori — is stated generically and could transfer to other structured-Jacobian/Hessian problems in scientific computing.
Adoption friction is real: the work is JAX-based (custom MACE re-implementation, `asdex`, `pet-jax`), while most of the MLIP ecosystem is PyTorch. Until ported, uptake may be limited to the authors' orbit. The experimental comparison (Appendix I) also tempers the narrative: predicted overestimates calorimetry by 17–84%, so the limiting error is the potential, not the Hessian algorithm — though the authors turn this into a forward-looking argument for experiment-based fine-tuning, which the differentiable pipeline enables.
Strengths: exceptionally careful experimental hygiene; a clear, correct, reusable recipe; an honest negative result (exact ASD underdelivers) that saves others wasted effort; archived code and data on Zenodo; an error decomposition that makes the approximation interpretable rather than heuristic.
Limitations: conceptual novelty is moderate — ASD dates to the 1970s, and distance truncation of force constants is standard lattice dynamics (hiphive, phonopy supercells); the contribution is the marriage of the two plus careful engineering, not a new paradigm. Only two model families and one class of materials (porous, deliberately the best case for sparsity) are tested; dense solids and long-range/attention-based models would benefit less. No theory for the truncation error, so hop-count selection remains empirical and observable-dependent. The third-derivative extension, which is where the scaling really bites and where the payoff could be transformative, is explicitly left to future work.
Overall: a well-executed, practically valuable methods paper with a clean conceptual hook and unusually thorough validation, whose ceiling on impact is set by narrow observable coverage, modest conceptual novelty, and ecosystem friction.
Generated Sep 18, 2026
A carefully validated, immediately useful method that raises the tractable system size for MLIP Hessians by ~4x and wall time by ~10x, with a genuinely novel 'lossy ASD' twist, but limited by single-observable validation, two model families, and a JAX-only implementation.