Timezone: »

 
Poster
Relational Pooling for Graph Representations
Ryan Murphy · Balasubramaniam Srinivasan · Vinayak A Rao · Bruno Ribeiro

Wed Jun 12 06:30 PM -- 09:00 PM (PDT) @ Pacific Ballroom #174
in Posters Wed »

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.

Keywords: Networks and Relational Learning · Others · Representation Learning

Author Information

Ryan Murphy (Purdue University)

Ph.D. from Purdue University where I worked with Professors Bruno Ribeiro and Vinayak Rao on machine learning methods for graphs (networks) and unordered sequences. Applications for this work include predicting molecular properties, diagnosing neurodegenerative disease, and anomaly detection.

Balasubramaniam Srinivasan (Purdue University)
Vinayak A Rao (Purdue University)
Bruno Ribeiro (Purdue University)

Related Events (a corresponding poster, oral, or spotlight)

More from the Same Authors