REVIEW 13 cited by
Open Graph Benchmark: Datasets for Machine Learning on Graphs
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
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) research. OGB datasets are large-scale, encompass multiple important graph ML tasks, and cover a diverse range of domains, ranging from social and information networks to biological networks, molecular graphs, source code ASTs, and knowledge graphs. For each dataset, we provide a unified evaluation protocol using meaningful application-specific data splits and evaluation metrics. In addition to building the datasets, we also perform extensive benchmark experiments for each dataset. Our experiments suggest that OGB datasets present significant challenges of scalability to large-scale graphs and out-of-distribution generalization under realistic data splits, indicating fruitful opportunities for future research. Finally, OGB provides an automated end-to-end graph ML pipeline that simplifies and standardizes the process of graph data loading, experimental setup, and model evaluation. OGB will be regularly updated and welcomes inputs from the community. OGB datasets as well as data loaders, evaluation scripts, baseline code, and leaderboards are publicly available at https://ogb.stanford.edu .
Forward citations
Cited by 13 Pith papers
-
ParasGB: A Graph Benchmark Suite for Parasitic Estimation on AMS Circuits
ParasGB releases the first public graph benchmark for predicting post-layout parasitic capacitance and resistance from pre-layout analog/SRAM circuit schematics.
-
One Model, Many Graphs: Learning over Attributed Graphs across Heterogeneous Modalities with Vision-Language Models
OMG-VLM is a single VLM-based model that handles text-, image-, and multi-attributed graphs through structure-aware adapters, reporting gains on several node/link prediction benchmarks.
-
CTS-Bench: Benchmarking Graph Coarsening Trade-offs for GNNs in Clock Tree Synthesis
Generic graph coarsening of gate-level netlists cuts GNN memory by about 17x and training time by about 3x, but makes clock-skew prediction R^2 negative on unseen designs.
-
Plain Transformers are Surprisingly Powerful Link Predictors
A plain-style Transformer over sampled local subgraphs, with a multiplicative adjacency residual, reaches state-of-the-art link prediction on several benchmarks without node IDs or hand-crafted heuristics.
-
Task-Aware Adaptive Modulation: A Replay-Free and Resource-Efficient Approach For Continual Graph Learning
TAAM achieves replay-free, pre-training-free continual graph learning by routing each task to a small node-attentive modulator inserted into a frozen GNN.
-
Memorization in Graph Neural Networks
GNNs memorize node labels more on low-homophily graphs, a behavior NCMemo can quantify and graph rewiring can partially mitigate.
-
SBGD: Improving Graph Diffusion Generative Model via Stochastic Block Diffusion
By diffusing on block subgraphs rather than the full graph, SBGD reports lower memory use and better size generalization for graph diffusion generative models.
-
THGFM: Dual-Branch Temporal Heterogeneous Graph Fusion Model
THGFM couples shared-space and relation-partitioned attention branches with non-competitive gated fusion (TC-NGSF) and rotary temporal attention (RoTA), reporting +3.25% mean and +12.37% peak relative gains over a rei...
-
MEGA-CL: A Molecular Foundation Model for Generalizable ADMET Prediction through Graph External Attention and Contrastive Learning
A contrastive GNN with external attention, pre-trained on ~100M molecules, improves multi-task ADMET prediction and shows prospective wet-lab agreement on three compounds.
-
OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation
OpenRTAG is a benchmark that organizes text-attributed-graph data-quality issues into a 3x3 taxonomy (text/structure/label by sparsity/noise/imbalance) and evaluates model robustness across nine datasets and three tasks.
-
The Oversmoothing Fallacy: A Misguided Narrative in GNN Research
The authors argue GNN oversmoothing is overstated, that zero-collapsing (vanishing gradient) is the actual failure mode, and that residual connections plus batch normalization suffice to train very deep GCNs.
-
ReconXF: Graph Reconstruction Attack via Public Feature Explanations on Privatized Node Features and Labels
ReconXF reconstructs graph structure from public feature explanations and differentially private node features and labels, outperforming prior attacks on Cora and Citeseer.
-
NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing
NOCL lets an LLM handle node, edge, and graph tasks on text and non-text graphs by compressing each node's description into one semantic embedding and turning the graph into a text prompt.
Discussion (0). Sign in to comment.