Finite-dimensional latent representations for neighbor-triplet aggregation
Determine whether the angle-feature dimension in the HGNN can be bounded or substantially reduced relative to the number of neighbor triplets while retaining the universal approximation and completeness guarantees.
References
Tightening this gap remains an open problem.
— Why Multi-Layer Message Passing Works: Completeness Theory for Graph Neural Network Interatomic Potentials
(2609.00528 - Ming et al., 1 Sep 2026) in Section Discussion and perspective