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.

Background

The DeepSets-based proofs use the angle-feature dimension as the latent dimension of the aggregation. According to the paper, the required dimension grows at least with the number of neighbor triplets, whereas practical architectures commonly use much smaller dimensions, such as 64. Closing this theoretical-practical dimensionality gap is explicitly identified as unresolved.

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