Inductive Representation Learning on Large Graphs
read the original abstract
Low-dimensional embeddings of nodes in large graphs have proved extremely useful in a variety of prediction tasks, from content recommendation to identifying protein functions. However, most existing approaches require that all nodes in the graph are present during training of the embeddings; these previous approaches are inherently transductive and do not naturally generalize to unseen nodes. Here we present GraphSAGE, a general, inductive framework that leverages node feature information (e.g., text attributes) to efficiently generate node embeddings for previously unseen data. Instead of training individual embeddings for each node, we learn a function that generates embeddings by sampling and aggregating features from a node's local neighborhood. Our algorithm outperforms strong baselines on three inductive node-classification benchmarks: we classify the category of unseen nodes in evolving information graphs based on citation and Reddit post data, and we show that our algorithm generalizes to completely unseen graphs using a multi-graph dataset of protein-protein interactions.
This paper has not been read by Pith yet.
Forward citations
Cited by 28 Pith papers
-
Gauge-Equivariant Graph Neural Networks for Lattice Gauge Theories
Gauge-equivariant graph neural networks embed non-Abelian local symmetries directly into message passing for lattice gauge theories, enabling learning of nonlocal observables from local operations.
-
Sheaf Neural Networks on SPD Manifolds: Second-Order Geometric Representation Learning
Sheaf neural networks on the SPD manifold enable strictly more expressive second-order geometric representations than Euclidean versions and achieve SOTA results on most MoleculeNet benchmarks.
-
Learning Dynamic Stability Landscapes in Synchronization Networks
Introduces graph-to-image prediction of per-node dynamic stability landscapes in oscillator networks from topology, releases two 10k-graph datasets, and shows GNN-CNN models achieve good accuracy with cross-size gener...
-
Graph Neural Networks in the Wilson Loop Representation of Abelian Lattice Gauge Theories
A gauge-invariant GNN using Wilson loops as inputs accurately predicts observables and simulates dynamics in Z2 and U(1) lattice gauge models.
-
TRAVELFRAUDBENCH: A Configurable Evaluation Framework for GNN Fraud Ring Detection in Travel Networks
TravelFraudBench is a new configurable benchmark for GNN-based fraud ring detection in travel networks, simulating star, clique, and chain topologies and showing GraphSAGE outperforming MLP baselines on AUC and ring recovery.
-
BRIDGE and TCH-Net: Heterogeneous Benchmark and Multi-Branch Baseline for Cross-Domain IoT Botnet Detection
BRIDGE creates the first formal heterogeneous multi-dataset benchmark for IoT botnet detection with LODO evaluation, and TCH-Net achieves mean LODO F1 of 0.5577 while reaching F1 0.8296 on standard tests, outperformin...
-
Complex-Valued GNNs for Distributed Basis-Invariant Control of Planar Systems
Complex-valued GNNs using phase-equivariant activations achieve global basis invariance for distributed planar control, outperforming real-valued baselines in data efficiency, tracking, and generalization on flocking.
-
Cross-Paradigm Graph Backdoor Attacks with Promptable Subgraph Triggers
CP-GBA distills a queryable repository of promptable subgraph triggers via graph prompt learning to achieve transferable backdoor attacks on GNNs with state-of-the-art success rates across paradigms and defenses.
-
Effective Capacitance Modeling Using Graph Neural Networks
GNN-Ceff is the first graph neural network model for post-layout effective capacitance prediction in VLSI circuits, delivering up to 929x speedup over serial state-of-the-art methods with improved accuracy on real benchmarks.
-
Neural Point-Forms
Neural point-forms are introduced as permutation-invariant neural layers that output learned form-comparison matrices for point clouds, with a claimed consistency proof under sampling and manifold assumptions and comp...
-
TabPFN-3: Technical Report
TabPFN-3 delivers state-of-the-art tabular prediction performance on benchmarks up to 1M rows, is up to 20x faster than prior versions, and introduces test-time scaling that beats non-TabPFN models by hundreds of Elo points.
-
Quantum Injection Pathways for Implicit Graph Neural Networks
Independent quantum signal injection into graph DEQs yields higher test accuracy and fewer solver iterations than state-dependent or backbone-dependent injection and classical equilibrium models on NCI1, PROTEINS, and...
-
GRASP -- Graph-Based Anomaly Detection Through Self-Supervised Classification
GRASP detects anomalies in system provenance graphs via self-supervised executable prediction from two-hop neighborhoods, outperforming prior PIDS on DARPA datasets by identifying all documented attacks where behavior...
-
MediaGraph: A Network Theoretic Framework to Analyze Reporting Preferences in Indian News Media
MediaGraph uses co-occurrence networks from Indian news on farmer protests and a new link predictability metric to reveal source-specific reporting preferences and under-representation of farmer leaders.
-
K-STEMIT: Knowledge-Informed Spatio-Temporal Efficient Multi-Branch Graph Neural Network for Subsurface Stratigraphy Thickness Estimation from Radar Data
K-STEMIT reduces RMSE by 21% for subsurface stratigraphy thickness estimation from radar data via a knowledge-informed spatio-temporal GNN with adaptive feature fusion and physical priors from the MAR weather model.
-
Communication-free Sampling and 4D Hybrid Parallelism for Scalable Mini-batch GNN Training
ScaleGNN uses communication-free sampling and 4D parallelism to scale mini-batch GNN training to 2048 GPUs, achieving 3.5x speedup over prior state-of-the-art on ogbn-products.
-
Rethinking Fraud Safety Evaluation: Multi-Round Attacks Reveal Safety-Utility Tradeoffs in Graph-Context LLM Defenders
Graph-context LLM fraud defenders improve early refusal under replay and adaptive multi-round attacks compared to text baselines but increase benign over-refusal, with the cost localized to how the LLM consumes struct...
-
Fast and Featureless Node Representation Learning with Partial Pairwise Supervision
Contrastive FUSE learns node embeddings from partial pairwise supervision and structural signals alone by optimizing a spectral contrastive objective with a lightweight modularity approximation, yielding competitive p...
-
Graph Transductive Sharpening: Leveraging Unlabeled Predictions in Node Classification
Transductive Sharpening adds an entropy-minimization term on unlabeled-node predictions to the training objective for graph node classification.
-
Category-based and Popularity-guided Video Game Recommendation: A Balance-oriented Framework
CPGRec improves video game recommendations on Steam by balancing accuracy and diversity through category-based game connections, popularity-guided propagation, and a new negative-sample reweighting method.
-
CPGRec+: A Balance-oriented Framework for Personalized Video Game Recommendations
CPGRec+ improves game recommendations on Steam data by reweighting player-game edges with signed preference strengths and using LLMs to generate preference-aware descriptions, yielding higher accuracy and diversity th...
-
Predicting Alzheimer's disease progression using rs-fMRI and a history-aware graph neural network
History-aware GNN predicts Alzheimer's progression from rs-fMRI graphs with 82.9% accuracy and 68.8% on CN-to-MCI transitions.
-
Real-World Challenges in Fake News Detection: Dealing with Posts by Cold Users
Cold users dominate fake news datasets, and the User Evidence Network approximates their absent behavior data from existing user interactions to enable robust misinformation detection.
-
Clickbait detection: quick inference with maximum impact
A hybrid clickbait detector combines OpenAI embeddings with six heuristic features, applies PCA reduction, and uses graph and tree classifiers to achieve competitive F1-scores and high ROC-AUC with reduced inference time.
-
Ligandformer: A Graph Neural Network for Predicting Compound Property with Robust Interpretation
Ligandformer is a self-attention graph neural network framework that predicts compound properties, outputs attention maps for local structural interpretation, and claims improved robustness and generalization over pri...
-
DeepTrax: Embedding Graphs of Financial Transactions
DeepTrax learns embeddings for accounts and merchants in financial transaction graphs via methods inspired by standard graph embedding techniques, reporting strong link prediction performance and utility in fraud dete...
-
Benchmarking Swarm Optimization Algorithms for Parameter Initialization in the Quantum Approximate Optimization Algorithm
Swarm methods such as PSO, FIPSO, and QPSO yield lower approximation gaps and more stable convergence than Adam, COBYLA, or SPSA when tuning QAOA parameters on weighted MaxCut instances, especially under noise and lim...
-
Deep Learning for Sequential Decision Making under Uncertainty: Foundations, Frameworks, and Frontiers
A tutorial framing deep learning as a complement to optimization for sequential decision-making under uncertainty, with applications in supply chains, healthcare, and energy.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.