Relational Pooling for Graph Representations

R. Murphy,Balasubramaniam Srinivasan,Vinayak A. Rao,Bruno Ribeiro

Published 2019 in International Conference on Machine Learning

ABSTRACT

This work generalizes graph neural networks (GNNs) beyond those based on the Weisfeiler-Lehman (WL) algorithm, graph Laplacians, and diffusions. Our approach, denoted Relational Pooling (RP), draws from the theory of finite partial exchangeability to provide a framework with maximal representation power for graphs. RP can work with existing graph representation models and, somewhat counterintuitively, can make them even more powerful than the original WL isomorphism test. Additionally, RP allows architectures like Recurrent Neural Networks and Convolutional Neural Networks to be used in a theoretically sound approach for graph classification. We demonstrate improved performance of RP-based graph representations over state-of-the-art methods on a number of tasks.

PUBLICATION RECORD

  • Publication year

    2019

  • Venue

    International Conference on Machine Learning

  • Publication date

    2019-03-06

  • Fields of study

    Mathematics, Computer Science

  • Identifiers
  • External record

    Open on Semantic Scholar

  • Source metadata

    Semantic Scholar

CITATION MAP

EXTRACTION MAP

CLAIMS

  • No claims are published for this paper.

CONCEPTS

  • No concepts are published for this paper.

REFERENCES

Showing 1-69 of 69 references · Page 1 of 1

CITED BY

Showing 1-100 of 284 citing papers · Page 1 of 3