Provably expressive temporal graph networks

Vikas Garg, Samuel Kaski, Diego Parente Paiva Mesquita, Amauri Holanda De Souza Junior

Research output: Chapter in Book/Conference proceedingConference contributionpeer-review

Abstract

Temporal graph networks (TGNs) have gained prominence as models for embedding dynamic interactions, but little is known about their theoretical underpinnings. We establish fundamental results about the representational power and limits of the two main categories of TGNs: those that aggregate temporal walks (WA-TGNs), and those that augment local message passing with recurrent memory modules (MP-TGNs). Specifically, novel constructions reveal the inadequacy of MP-TGNs and WA-TGNs, proving that neither category subsumes the other. We extend the 1-WL (Weisfeiler-Leman) test to temporal graphs, and show that the most powerful MP-TGNs should use injective updates, as in this case they become as expressive as the temporal WL. Also, we show that sufficiently deep MP-TGNs cannot benefit from memory, and MP/WA-TGNs fail to compute graph properties such as girth. These theoretical insights lead us to PINT --- a novel architecture that leverages injective temporal message passing and relative positional features. Import
Original languageEnglish
Title of host publicationAdvances in Neural Information Processing Systems 35
Subtitle of host publication36th Conference on Neural Information Processing Systems (NeurIPS 2022)
EditorsS. Koyejo, S. Mohamed, A. Agarwal, D. Belgrave, K. Cho, A. Oh
Place of PublicationRed Hook, NY
PublisherCurran Associates, Inc.
Pages32257-32269
Number of pages13
Volume42
ISBN (Electronic)9781713873129
ISBN (Print)9781713871088
Publication statusPublished - Apr 2023
EventConference on Neural Information Processing Systems -
Duration: 28 Nov 20229 Dec 2022

Conference

ConferenceConference on Neural Information Processing Systems
Period28/11/229/12/22

Research Beacons, Institutes and Platforms

  • Institute for Data Science and AI
  • Digital Futures
  • Sustainable Futures

Fingerprint

Dive into the research topics of 'Provably expressive temporal graph networks'. Together they form a unique fingerprint.

Cite this