Shoot from the HIP: Hessian Interatomic Potentials without derivatives

• URL: http://arxiv.org/abs/2509.21624v1
• Date: Thu, 25 Sep 2025 21:43:34 GMT
• Title: Shoot from the HIP: Hessian Interatomic Potentials without derivatives
• Abstract summary: Hessians are expensive to calculate and scale poorly with system size.<n>We demonstrate that Hessians can be predicted directly from a deep learning model.<n>This makes HIP Hessians one to two orders of magnitude faster, more accurate, more memory efficient, easier to train, and enables more favorable scaling with system size.
• Score: 2.406669016462152
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Fundamental tasks in computational chemistry, from transition state search to vibrational analysis, rely on molecular Hessians, which are the second derivatives of the potential energy. Yet, Hessians are computationally expensive to calculate and scale poorly with system size, with both quantum mechanical methods and neural networks. In this work, we demonstrate that Hessians can be predicted directly from a deep learning model, without relying on automatic differentiation or finite differences. We observe that one can construct SE(3)-equivariant, symmetric Hessians from irreducible representations (irrep) features up to degree $l$=2 computed during message passing in graph neural networks. This makes HIP Hessians one to two orders of magnitude faster, more accurate, more memory efficient, easier to train, and enables more favorable scaling with system size. We validate our predictions across a wide range of downstream tasks, demonstrating consistently superior performance for transition state search, accelerated geometry optimization, zero-point energy corrections, and vibrational analysis benchmarks. We open-source the HIP codebase and model weights to enable further development of the direct prediction of Hessians at https://github.com/BurgerAndreas/hip

Related papers

• Projected Hessian Learning: Fast Curvature Supervision for Accurate Machine-Learning Interatomic Potentials [3.0325110391148264]
  Projected Hessian Learning (PHL) is a scalable second-order training framework that injects curvature information using only Hessian-vector products (HVPs)<n>We benchmark PHL on a chemically diverse dataset of reactants, products transition states, and normal-mode sampled geometries computed at omegaB97XD/6-31G(d)<n>With randomized probes per minibatch, both HVP schemes match full-Hessian training in energy, force, and Hessian accuracy while delivering >24x speedups for the small molecular systems studied.
  arXiv  Detail & Related papers  (2026-03-04T19:09:16Z)
• The Adaptive Vekua Cascade: A Differentiable Spectral-Analytic Solver for Physics-Informed Representation [0.0]
  Adaptive-based neural networks have emerged as a powerful tool for representing continuous physical fields.<n>They face two fundamental pathologies: spectral bias and the curse of dimensionality.<n>We propose a hybrid architecture that bridges analytic analytic decouples manifold learning from function approximation.
  arXiv  Detail & Related papers  (2025-12-12T18:41:35Z)
• Facet: highly efficient E(3)-equivariant networks for interatomic potentials [6.741915610607818]
  Computational materials discovery is limited by the high cost of first-principles calculations.<n>Machine learning potentials that predict energies from crystal structures are promising, but existing methods face computational bottlenecks.<n>We present Facet, a GNN architecture for efficient ML potentials.
  arXiv  Detail & Related papers  (2025-09-10T09:06:24Z)
• Data-Efficient Time-Dependent PDE Surrogates: Graph Neural Simulators vs. Neural Operators [0.0]
  We propose Neural Graph Simulators (GNS) as a principled surrogate modeling paradigm for time-dependent partial differential equations (PDEs)<n>GNS leverages message-passing combined with numerical time-stepping schemes to learn PDE dynamics by modeling the instantaneous time derivatives.<n>Results demonstrate that GNS is markedly more data-efficient, achieving less than 1% relative L2 error using only 3% of available trajectories.
  arXiv  Detail & Related papers  (2025-09-07T17:54:23Z)
• Enabling Automatic Differentiation with Mollified Graph Neural Operators [75.3183193262225]
  We propose the mollified graph neural operator (mGNO), the first method to leverage automatic differentiation and compute emphexact gradients on arbitrary geometries.<n>For a PDE example on regular grids, mGNO paired with autograd reduced the L2 relative data error by 20x compared to finite differences.<n>It can also solve PDEs on unstructured point clouds seamlessly, using physics losses only, at resolutions vastly lower than those needed for finite differences to be accurate enough.
  arXiv  Detail & Related papers  (2025-04-11T06:16:30Z)
• How Feature Learning Can Improve Neural Scaling Laws [79.59705237659547]
  We develop a solvable model of neural scaling laws beyond the kernel limit.<n>We show how performance scales with model size, training time, and the total amount of available data.
  arXiv  Detail & Related papers  (2024-09-26T14:05:32Z)
• Neural Quantum States and Peaked Molecular Wave Functions: Curse or Blessing? [0.5530212768657544]
  We introduce a novel algorithm for autoregressive sampling without replacement of a procedure to calculate a computationally cheaper surrogate for the local energy. Our calculations require substantially less resources and exhibit more than order of magnitude speedup compared to the previous works.
  arXiv  Detail & Related papers  (2024-08-14T15:49:04Z)
• Reduced-Order Neural Operators: Learning Lagrangian Dynamics on Highly Sparse Graphs [19.1312659245072]
  We present GIOROM, a data-driven discretization invariant framework for accelerating Lagrangian simulations through reduced-order modeling (ROM)<n>We leverage a data-driven graph-based neural approximation of the PDE solution operator.<n>GIOROM achieves a 6.6$times$-32$times$ reduction in input dimensionality while maintaining high-fidelity reconstructions across diverse Lagrangian regimes.
  arXiv  Detail & Related papers  (2024-07-04T13:37:26Z)
• Assessing Neural Network Representations During Training Using Noise-Resilient Diffusion Spectral Entropy [55.014926694758195]
  Entropy and mutual information in neural networks provide rich information on the learning process. We leverage data geometry to access the underlying manifold and reliably compute these information-theoretic measures. We show that they form noise-resistant measures of intrinsic dimensionality and relationship strength in high-dimensional simulated data.
  arXiv  Detail & Related papers  (2023-12-04T01:32:42Z)
• Geometry-Informed Neural Operator for Large-Scale 3D PDEs [76.06115572844882]
  We propose the geometry-informed neural operator (GINO) to learn the solution operator of large-scale partial differential equations. We successfully trained GINO to predict the pressure on car surfaces using only five hundred data points.
  arXiv  Detail & Related papers  (2023-09-01T16:59:21Z)
• Training Feedback Spiking Neural Networks by Implicit Differentiation on the Equilibrium State [66.2457134675891]
  Spiking neural networks (SNNs) are brain-inspired models that enable energy-efficient implementation on neuromorphic hardware. Most existing methods imitate the backpropagation framework and feedforward architectures for artificial neural networks. We propose a novel training method that does not rely on the exact reverse of the forward computation.
  arXiv  Detail & Related papers  (2021-09-29T07:46:54Z)
• Binary Graph Neural Networks [69.51765073772226]
  Graph Neural Networks (GNNs) have emerged as a powerful and flexible framework for representation learning on irregular data. In this paper, we present and evaluate different strategies for the binarization of graph neural networks. We show that through careful design of the models, and control of the training process, binary graph neural networks can be trained at only a moderate cost in accuracy on challenging benchmarks.
  arXiv  Detail & Related papers  (2020-12-31T18:48:58Z)
• Directed Graph Attention Neural Network Utilizing 3D Coordinates for Molecular Property Prediction [11.726245297344418]
  Kernel method and graph neural networks have been widely studied as two mainstream methods for property prediction. In this work, we shed light on the Directed Graph Attention Neural Network (DGANN), which only takes chemical bonds as edges. Our model has matched or outperformed most baseline graph neural networks on QM9 datasets.
  arXiv  Detail & Related papers  (2020-12-01T11:06:40Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.