Sparse hierarchical representation learning on molecular graphs

Abstract

Architectures for sparse hierarchical representation learning have recently been proposed for graph-structured data, but so far assume the absence of edge features in the graph. We close this gap and propose a method to pool graphs with edge features, inspired by the hierarchical nature of chemistry. In particular, we introduce two types of pooling layers compatible with an edge-feature graph-convolutional architecture and investigate their performance for molecules relevant to drug discovery on a set of two classification and two regression benchmark datasets of MoleculeNet. We find that our models significantly outperform previous benchmarks on three of the datasets and reach state-of-the-art results on the fourth benchmark, with pooling improving performance for three out of four tasks, keeping performance stable on the fourth task, and generally speeding up the training process.

arXiv comment4 pages, 2 figures, accepted as a DLG 2019 workshop paper at KDD 2019

References in corpus (13)

• Neural Message Passing for Quantum Chemistry
• Spectral Networks and Locally Connected Networks on Graphs
• Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering
• Hierarchical Graph Representation Learning with Differentiable Pooling
• Learning Convolutional Neural Networks for Graphs
• Discriminative Embeddings of Latent Variable Models for Structured Data
• Gated Graph Sequence Neural Networks
• Towards Sparse Hierarchical Graph Classifiers
• Flexible Neural Representation for Physics Prediction
• Learning Graph-Level Representation for Drug Discovery
• Edge Attention-based Multi-Relational Graph Convolutional Networks
• Geometric deep learning on graphs and manifolds using mixture model CNNs
• Learning Graph Pooling and Hybrid Convolutional Operations for Text Representations