Weisfeiler and Lehman Go Topological: Message Passing Simplicial Networks
By Cristian Bodnar, Fabrizio Frasca, Yu Guang Wang, Nina Otter, Guido Montúfar, Pietro Lio', Michael M. Bronstein. International Conference on Machine Learning, 2021
342 citations recorded by the source corpus.
The pairwise interaction paradigm of graph machine learning has predominantly governed the modelling of relational systems. However, graphs alone cannot capture the multi-level interactions present in many complex systems and the expressive power of such schemes was proven to be limited. To overcome these limitations, we propose Message Passing Simplicial Networks (MPSNs), a class of models that perform message passing on simplicial complexes (SCs). To theoretically analyse the expressivity of our model we introduce a Simplicial Weisfeiler-Lehman (SWL) colouring procedure for distinguishing non-isomorphic SCs. We relate the power of SWL to the problem of distinguishing non-isomorphic graphs and show that SWL and MPSNs are strictly more powerful than the WL test and not less powerful than the 3-WL test. We deepen the analysis by comparing our model with traditional graph neural networks (GNNs) with ReLU activations in terms of the number of linear regions of the functions they can represent. We empirically support our theoretical claims by showing that MPSNs can distinguish challenging strongly regular graphs for which GNNs fail and, when equipped with orientation equivariant layers, they can improve classification accuracy in oriented SCs compared to a GNN baseline.
Subfields: Artificial Intelligence, Computational Theory and Mathematics, Statistical and Nonlinear Physics
View Paper: https://www.semanticscholar.org/paper/758294483c308d9d6028321f0741b6e4617c9ab9
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Michael M. Bronstein
- Fabrizio Frasca
- Pietro Lio'
- M. Ovsjanikov
- Souhaib Attaiki
- Keenan Crane
- Nicholas Sharp
- Guido Montúfar
In Computational Theory and Mathematics
- Souhaib Attaiki
- Keenan Crane
- Nicholas Sharp
- M. Ovsjanikov
- Michael M. Bronstein
- Nina Otter
- Pietro Lio'
- Fabrizio Frasca
In Statistical and Nonlinear Physics
- Fabrizio Frasca
- Pietro Lio'
- Souhaib Attaiki
- Keenan Crane
- Nicholas Sharp
- M. Ovsjanikov
- Michael M. Bronstein
- Guido Montúfar
Citations in the corpus
- DiffusionNet: Discretization Agnostic Learning on Surfaces (2020, background): “Surface mesh structure has also been used in a variety of graphlike approaches that specifically leverage mesh connectivity [Bodnar et al. 2021; Feng et al. 2019; Gong et al. 2019; Hajij et al. 2020; Hanocka et al. 2019; Lim et al. 2018; Milano et al. 2020; Verma et al. 2018], the structure of discr”
- Weisfeiler and Lehman Go Cellular: CW Networks (2021, methodology): “[8] Cristian Bodnar, Fabrizio Frasca, Yu Guang Wang, Nina Otter, Guido Montúfar, Pietro Lio, and Michael Bronstein.”