Clifford Group Equivariant Simplicial Message Passing Networks

• URL: http://arxiv.org/abs/2402.10011v3
• Date: Tue, 12 Mar 2024 12:38:09 GMT
• Title: Clifford Group Equivariant Simplicial Message Passing Networks
• Authors: Cong Liu, David Ruhe, Floor Eijkelboom, Patrick Forr\'e
• Abstract summary: We introduce Clifford Group Equivariant Simplicial Message Passing Networks. Our method integrates the expressivity of Clifford group-equivariant layers with simplicial message passing. Our method is able to outperform both equivariant and simplicial graph neural networks on a variety of geometric tasks.
• Score: 7.598439350696356
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We introduce Clifford Group Equivariant Simplicial Message Passing Networks, a method for steerable E(n)-equivariant message passing on simplicial complexes. Our method integrates the expressivity of Clifford group-equivariant layers with simplicial message passing, which is topologically more intricate than regular graph message passing. Clifford algebras include higher-order objects such as bivectors and trivectors, which express geometric features (e.g., areas, volumes) derived from vectors. Using this knowledge, we represent simplex features through geometric products of their vertices. To achieve efficient simplicial message passing, we share the parameters of the message network across different dimensions. Additionally, we restrict the final message to an aggregation of the incoming messages from different dimensions, leading to what we term shared simplicial message passing. Experimental results show that our method is able to outperform both equivariant and simplicial graph neural networks on a variety of geometric tasks.

Related papers

• A Clifford Algebraic Approach to E(n)-Equivariant High-order Graph Neural Networks [2.2543808018990443]
  We introduce the Clifford Group Equivariant Graph Neural Networks (CG-EGNNs) CG-EGNNs enhance high-order message passing by integrating high-order local structures in the context of Clifford algebras. We empirically validate that CG-EGNNs outperform previous methods on various benchmarks including n-body, CMU motion capture, and MD17.
  arXiv  Detail & Related papers  (2024-10-07T02:12:42Z)
• Simplicial Representation Learning with Neural $k$-Forms [14.566552361705499]
  This paper focuses on leveraging geometric information from simplicial complexes embedded in $mathbbRn$ using node coordinates. We use differential k-forms in mathbbRn to create representations of simplices, offering interpretability and geometric consistency without message passing. Our method is efficient, versatile, and applicable to various input complexes, including graphs, simplicial complexes, and cell complexes.
  arXiv  Detail & Related papers  (2023-12-13T21:03:39Z)
• Clifford Group Equivariant Neural Networks [14.260561321140976]
  We introduce Clifford Group Equivariant Neural Networks, a novel approach for constructing $mathrmO(n)$- and $mathrmE(n)$-equivariant models. We demonstrate, notably from a single core implementation, state-of-the-art performance on several distinct tasks.
  arXiv  Detail & Related papers  (2023-05-18T17:35:35Z)
• E(n) Equivariant Message Passing Simplicial Networks [1.6243562700235228]
  We present $mathrmE(n)$ Equivariant Message Passing Simplicial Networks (EMPSNs) EMPSNs learn high-dimensional simplex features in graphs (e.g. triangles) We show that EMPSNs are on par with state-of-the-art approaches for learning on geometric graphs.
  arXiv  Detail & Related papers  (2023-05-11T19:10:26Z)
• Geometric Clifford Algebra Networks [53.456211342585824]
  We propose Geometric Clifford Algebra Networks (GCANs) for modeling dynamical systems. GCANs are based on symmetry group transformations using geometric (Clifford) algebras.
  arXiv  Detail & Related papers  (2023-02-13T18:48:33Z)
• Dist2Cycle: A Simplicial Neural Network for Homology Localization [66.15805004725809]
  Simplicial complexes can be viewed as high dimensional generalizations of graphs that explicitly encode multi-way ordered relations. We propose a graph convolutional model for learning functions parametrized by the $k$-homological features of simplicial complexes.
  arXiv  Detail & Related papers  (2021-10-28T14:59:41Z)
• Geometric and Physical Quantities improve E(3) Equivariant Message Passing [59.98327062664975]
  We introduce Steerable E(3) Equivariant Graph Neural Networks (SEGNNs) that generalise equivariant graph networks. This model, composed of steerables, is able to incorporate geometric and physical information in both the message and update functions. We demonstrate the effectiveness of our method on several tasks in computational physics and chemistry.
  arXiv  Detail & Related papers  (2021-10-06T16:34:26Z)
• Primal-Dual Mesh Convolutional Neural Networks [62.165239866312334]
  We propose a primal-dual framework drawn from the graph-neural-network literature to triangle meshes. Our method takes features for both edges and faces of a 3D mesh as input and dynamically aggregates them. We provide theoretical insights of our approach using tools from the mesh-simplification literature.
  arXiv  Detail & Related papers  (2020-10-23T14:49:02Z)
• Building powerful and equivariant graph neural networks with structural message-passing [74.93169425144755]
  We propose a powerful and equivariant message-passing framework based on two ideas. First, we propagate a one-hot encoding of the nodes, in addition to the features, in order to learn a local context matrix around each node. Second, we propose methods for the parametrization of the message and update functions that ensure permutation equivariance.
  arXiv  Detail & Related papers  (2020-06-26T17:15:16Z)
• Convolutional Occupancy Networks [88.48287716452002]
  We propose Convolutional Occupancy Networks, a more flexible implicit representation for detailed reconstruction of objects and 3D scenes. By combining convolutional encoders with implicit occupancy decoders, our model incorporates inductive biases, enabling structured reasoning in 3D space. We empirically find that our method enables the fine-grained implicit 3D reconstruction of single objects, scales to large indoor scenes, and generalizes well from synthetic to real data.
  arXiv  Detail & Related papers  (2020-03-10T10:17:07Z)

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.