It is proved that the Hypergraph Neural Network, an invariant architecture with 3-body message passing, is a universal approximator for potential energy surfaces and provides the first rigorous justification for the common practice of using multi-layer message passing with a per-layer cutoff smaller than the physical interaction range.
Abstract
We prove that the Hypergraph Neural Network, an invariant architecture with 3-body message passing, is a universal approximator for potential energy surfaces. Our main contribution is a multi-layer completeness theory. We show that $L$ layers of message passing on sparse, cutoff-based graphs achieve the same representational power as having access to the full $L$-hop neighborhood, provided the configurations are generic, satisfy an overlap condition and a connectivity condition. This provides the first rigorous justification for the common practice of using multi-layer message passing with a per-layer cutoff smaller than the physical interaction range, the setting used by virtually all practical graph neural network based machine-learned interatomic potentials. As immediate consequences, we show that both DPA3 and CHGNet architectures inherit universal approximation.
A common layer equation is introduced that represents covered architectures through seven components: an update domain, channel set, propagation bank, per-channel message maps, channel-fusion operator, ego/residual map, and update map, which exposes the empirical inverse problem of mapping measurable graph and task pro...
S. Navuluru, Siddhartha Shankar Das, B. Ni et al.· 0 citations
A GNN based on Continuous-Time Quantum Walks (CTQW) and exploiting two properties of the CTQW propagator, preserving mid- and high-frequency signals for heterophilic graphs while preventing Dirichlet-energy collapse.
Yu-Liang Zhan, Ze-Feng Gao, Jian Li et al.· 0 citations
On graph discrimination it is proved a matching limitation: on graphs where every edge sees the same number of shortest cycles of the same length, the descriptor becomes constant and any model built on it collapses back to the 1-WL bound.
SIGIL unifies several existing regimes in graph foundation model design under a single framework that maps any attributed graph to a unified representation space of fixed dimension.
Machine-learned interatomic potentials (MLIPs) have emerged as a promising alternative to classical force fields and first-principles theory for predicting the properties of chemical and material systems. Many MLIPs are graph neural networks with O(3)-equivariant features, whose accuracy comes at substantial computatio...
We formulate the corner transfer matrix equations, and the corner transfer matrix renormalization group built on them, as a set of local equations on general planar graphs. These equations depend only on the local subgraphs of the planar graph and are glued together consistently to describe the whole graph. Solving the...
Illia Lukin, A. Sotnikov· 0 citations
Related blog posts
MIT News · Artificial Intelligence· news.mit.eduOct 13, 2026
Machine-learning networks can learn without detailed instructions from a designer. Those that do may offer insight into how the brain reorganizes itself during learning.
Microsoft Research Blog· microsoft.comJul 13, 2026
Cryptographic code supports vital protections in modern computing systems. Learn how a new method helps verify code as developers write it while preserving speed and adaptability as it gets implemented and evolves. The post Verifying Rust cryptography in SymCrypt, from standards to code appeared first on Microsoft Research.