Papers › Fast Graph Representation Learning with PyTorch Geometric

Fast Graph Representation Learning with PyTorch Geometric

6 Mar 2019arXiv:1903.02428archive 2025-07-28

Matthias Fey, Jan Eric Lenssen

We introduce PyTorch Geometric, a library for deep learning on irregularly structured input data such as graphs, point clouds and manifolds, built upon PyTorch. In addition to general graph data structures and processing methods, it contains a variety of recently published methods from the domains of relational learning and 3D data processing. PyTorch Geometric achieves high data throughput by leveraging sparse GPU acceleration, by providing dedicated CUDA kernels and by introducing efficient mini-batch handling for input examples of different size. In this work, we present the library in detail and perform a comprehensive comparative study of the implemented methods in homogeneous evaluation scenarios.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="1903.02428")

Code

Syntology Ran 0 of 2 code samples harvested from 1 repository linked to this paper; 2 have no recorded run.

By repository: community (archive-listed): 2 samples from 1 repository, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

rusty1s/pytorch_geometric officialmentioned in papermentioned on GitHubpytorchMIT report
leojklarner/gauche mentioned on GitHubpytorchMIT report
long-9621/splinecnn mentioned on GitHubpytorchMIT report
luxtu/OCTA-graph mentioned on GitHubpytorch report
ncfrey/litmatter mentioned on GitHubpytorch report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

2 samples harvested; 0 ran; 0 honoured the contract we drafted; 2 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

2unverified

Licence: 0 of the 2 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from long-9621/splinecnn. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

get_planetoid_dataset long-9621/splinecnn/benchmark/citation/datasets.py community (archive-listed) unverified MIT (permissive) · a13883d41a1eff70 · report
read_file long-9621/splinecnn/torch_geometric/io/planetoid.py community (archive-listed) unverified MIT (permissive) · 35ef2289cbdcde86 · report

Tasks

Graph ClassificationGraph Representation LearningNode ClassificationRelational ReasoningRepresentation Learning

1 archive task tag without a task page not shown.

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Graph Classification COLLAB GCN Accuracy 80.6% #11 of 39 Archive leaderboard report
Graph Classification IMDb-B GIN-0 Accuracy 72.8% #38 of 51 Archive leaderboard report
Graph Classification MUTAG GIN-0 Accuracy 85.7% #61 of 74 Archive leaderboard report
Graph Classification PROTEINS DiffPool Accuracy 75.1% #69 of 103 Archive leaderboard report
Graph Classification REDDIT-B DiffPool Accuracy 92.1 #4 of 12 Archive leaderboard report
Node Classification Citeseer APPNP Accuracy 70.0 ± 1.4 #59 of 71 Archive leaderboard report
Node Classification Cora APPNP Accuracy 82.2% ± 1.5% #54 of 73 Archive leaderboard report
Node Classification Pubmed APPNP Accuracy 79.4 ± 2.2 #47 of 70 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections