REVIEW 7 cited by
OGB-LSC: A Large-Scale Challenge 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
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 applications. However, existing efforts to advance large-scale graph ML have been largely limited by the lack of a suitable public benchmark. Here we present OGB Large-Scale Challenge (OGB-LSC), a collection of three real-world datasets for facilitating the advancements in large-scale graph ML. The OGB-LSC datasets are orders of magnitude larger than existing ones, covering three core graph learning tasks -- link prediction, graph regression, and node classification. Furthermore, we provide dedicated baseline experiments, scaling up expressive graph ML models to the massive datasets. We show that expressive models significantly outperform simple scalable baselines, indicating an opportunity for dedicated efforts to further improve graph ML at scale. Moreover, OGB-LSC datasets were deployed at ACM KDD Cup 2021 and attracted more than 500 team registrations globally, during which significant performance improvements were made by a variety of innovative techniques. We summarize the common techniques used by the winning solutions and highlight the current best practices in large-scale graph ML. Finally, we describe how we have updated the datasets after the KDD Cup to further facilitate research advances. The OGB-LSC datasets, baseline code, and all the information about the KDD Cup are available at https://ogb.stanford.edu/docs/lsc/ .
Forward citations
Cited by 7 Pith papers
-
Cross-Resolution Semantic Learning for Graph Domain Adaptation
CReSL improves graph domain adaptation by learning cross-resolution source-to-target routing and grafting target representations toward source class prototypes.
-
Mayura: Exploiting Similarities in Motifs for Temporal Co-Mining
Mayura introduces the MG-Tree, a hierarchical prefix tree over temporal motifs, enabling exact co-mining of multiple motifs with 1.7-2.4x average speedups on GPU/CPU.
-
A Benchmark for Quantum Chemistry Relaxations via Machine Learning Interatomic Potentials
PubChemQCR is a large public dataset of DFT-based molecular relaxation trajectories with energy and force labels, benchmarked with nine machine learning interatomic potentials.
-
OmniVec2 -- A Novel Transformer based Network for Large Scale Multimodal and Multitask Learning
A shared-backbone transformer with pairwise modality training reports top results across 25 datasets spanning 12 modalities.
-
MolVision: Molecular Property Prediction with Vision Language Models
Adding a rendered molecular image to the SMILES prompt of a vision-language model improves molecular property prediction, and a Tanimoto-similarity contrastive fine-tuning step boosts the gains.
-
Are We Really Measuring Progress? Transferring Insights from Evaluating Recommender Systems to Temporal Link Prediction
Temporal link prediction benchmarks can rank models differently depending on sampling and aggregation choices, so current progress measurements are not reliable.
-
Graph Prompting for Graph Learning Models: Recent Advances and Future Directions
A survey of graph prompting methods that categorizes them by the stage at which prompts are applied: data, representation, or task.
Discussion (0). Continue with ORCID to comment.