Pith. sign in

REVIEW 1 cited by

Clifford Group Equivariant Simplicial Message Passing Networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2402.10011 v3 pith:P24GRFBP submitted 2024-02-15 cs.AI

classification cs.AI
keywords messagepassingsimplicialcliffordequivariantgeometricmethodnetworks
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Resolving Oversmoothing with Opinion Dissensus

    cs.LG 2025-01 conditional novelty 6.0 of 10

    BIMP, a continuous-depth GNN based on nonlinear opinion dynamics, is shown to avoid oversmoothing when its constant input has unique entries, and it outperforms baselines on ten node-classification datasets.

Pith tools