activity
20192022
most citedSimplicial Attention Networks

11 citations · 11 across the 2 of their papers we have counts for

collaborators
Showing cs.LGShow all

8 papers · 1 filter

cs.LG20231 cited

CIN++: Enhancing Topological Message Passing

Lorenzo Giusti, Teodora Reu, Francesco Ceccarelli +2

Graph Neural Networks (GNNs) have demonstrated remarkable success in learning from graph-structured data. However, they face significant limitations in expressive power, struggling…

cs.LG202211 cited

Simplicial Attention Networks

Christopher Wei Jin Goh, Cristian Bodnar, Pietro Liò

Graph representation learning methods have mostly been limited to the modelling of node-wise interactions. Recently, there has been an increased interest in understanding how highe…

cs.LG2021

Neural ODE Processes

Alexander Norcliffe, Cristian Bodnar, Ben Day +2

Neural Ordinary Differential Equations (NODEs) use a neural network to model the instantaneous rate of change in the state of a system. However, despite their apparent suitability…

cs.LG2021

Weisfeiler and Lehman Go Topological: Message Passing Simplicial Networks

Cristian Bodnar, Fabrizio Frasca, Yu Guang Wang +4

The pairwise interaction paradigm of graph machine learning has predominantly governed the modelling of relational systems. However, graphs alone cannot capture the multi-level int…

cs.LG2020

The Role of Isomorphism Classes in Multi-Relational Datasets

Vijja Wichitwechkarn, Ben Day, Cristian Bodnar +2

Multi-interaction systems abound in nature, from colloidal suspensions to gene regulatory circuits. These systems can produce complex dynamics and graph neural networks have been p…

cs.LG2020

On Second Order Behaviour in Augmented Neural ODEs

Alexander Norcliffe, Cristian Bodnar, Ben Day +2

Neural Ordinary Differential Equations (NODEs) are a new class of models that transform data continuously through infinite-depth architectures. The continuous nature of NODEs has m…