University of Cambridge > Talks.cam > Artificial Intelligence Research Group Talks (Computer Laboratory) > ACMP: Allen-Cahn Message Passing with Attractive and Repulsive Forces for Graph Neural Networks

ACMP: Allen-Cahn Message Passing with Attractive and Repulsive Forces for Graph Neural Networks

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Pietro Lio.

https://cl-cam-ac-uk.zoom.us/j/99166955895?pwd=SzI0M3pMVEkvNmw3Q0dqNDVRalZvdz09

Neural message passing is a basic feature extraction unit for graph-structured data considering neighboring node features in network propagation from one layer to the next. We model such a process by an interacting particle system with attractive and repulsive forces and the Allen-Cahn force arising in the modeling of phase transition. The dynamics of the system is a reaction-diffusion process which can separate particles without blowing up. This induces an Allen-Cahn message passing (ACMP) for graph neural networks where the numerical iteration for the particle system solution constitutes the message passing propagation. ACMP which has a simple implementation with a neural ODE solver can propel the network depth up to one hundred of layers with theoretically proven strictly positive lower bound of the Dirichlet energy. It thus provides a deep model of GNNs circumventing the common GNN problem of oversmoothing. GNNs with ACMP achieve state of the art performance for real-world node classification tasks on both homophilic and heterophilic datasets.

Joint with Yuelin Wang (SJTU), Kai Yi (UNSW), Xinliang Liu (KAUST) and Shi Jin (SJTU).

This talk is part of the Artificial Intelligence Research Group Talks (Computer Laboratory) series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2024 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity