A Clifford Algebraic Approach to E(n)-Equivariant High-order Graph Neural Networks
<|reference_start|>A Clifford Algebraic Approach to E(n)-Equivariant High-order Graph Neural Networks: Designing neural network architectures that can handle data symmetry is crucial. This is especially important for geometric graphs whose properties are equivariance under Euclidean transformations. Current equivariant graph neural networks (EGNNs), particularly those using message passing, have a limitation in expressive power. Recent high-order graph neural networks can overcome this limitation, yet they lack equivariance properties, representing a notable drawback in certain applications in chemistry and physical sciences. In this paper, we introduce the Clifford Group Equivariant Graph Neural Networks (CG-EGNNs), a novel EGNN that enhances high-order message passing by integrating high-order local structures in the context of Clifford algebras. As a key benefit of using Clifford algebras, CG-EGNN can learn functions that capture equivariance from positional features. By adopting the high-order message passing mechanism, CG-EGNN gains richer information from neighbors, thus improving model performance. Furthermore, we establish the universality property of the $k$-hop message passing framework, showcasing greater expressive power of CG-EGNNs with additional $k$-hop message passing mechanism. We empirically validate that CG-EGNNs outperform previous methods on various benchmarks including n-body, CMU motion capture, and MD17, highlighting their effectiveness in geometric deep learning.<|reference_end|>
@article{tran2024a,
    title={A Clifford Algebraic Approach to E(n)-Equivariant High-order Graph
  Neural Networks},
    author={Hoang-Viet Tran, Thieu N. Vo, Tho Tran Huu, Tan Minh Nguyen},
    journal={arXiv preprint arXiv:2410.04692},
    year={2024},
    archivePrefix={arXiv},
    eprint={2410.04692},
    primaryClass={cs.LG stat.ML}
}