activity
20182021
most citedFast Graph Representation Learning with PyTorch Geometric

1.3k citations · 1.4k across the 5 of their papers we have counts for

collaborators

10 papers

cs.LG202111 cited

GNNAutoScale: Scalable and Expressive Graph Neural Networks via Historical Embeddings

Matthias Fey, Jan E. Lenssen, Frank Weichert +1

We present GNNAutoScale (GAS), a framework for scaling arbitrary message-passing GNNs to large graphs. GAS prunes entire sub-trees of the computation graph by utilizing historical…

cs.LG2021

OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphs

Weihua Hu, Matthias Fey, Hongyu Ren +3

Enabling effective and efficient machine learning (ML) over large-scale graph data (e.g., graphs with billions of edges) can have a great impact on both industrial and scientific a…

cs.LG202036 cited

Hierarchical Inter-Message Passing for Learning on Molecular Graphs

Matthias Fey, Jan-Gin Yuen, Frank Weichert

We present a hierarchical neural message passing architecture for learning on molecular graphs. Our model takes in two complementary graph representations: the raw molecular graph…

cs.LG2020

Open Graph Benchmark: Datasets for Machine Learning on Graphs

Weihua Hu, Matthias Fey, Marinka Zitnik +5

We present the Open Graph Benchmark (OGB), a diverse set of challenging and realistic benchmark datasets to facilitate scalable, robust, and reproducible graph machine learning (ML…

cs.CV2020

Adversarial Generation of Continuous Implicit Shape Representations

Marian Kleineberg, Matthias Fey, Frank Weichert

This work presents a generative adversarial architecture for generating three-dimensional shapes based on signed distance representations. While the deep generation of shapes has b…

cs.LG202056 cited

Deep Graph Matching Consensus

Matthias Fey, Jan E. Lenssen, Christopher Morris +2

This work presents a two-stage neural architecture for learning and refining structural correspondences between graphs. First, we use localized node embeddings computed by a graph…