pith. sign in

hub Canonical reference

Inductive Representation Learning on Large Graphs

Canonical reference. 71% of citing Pith papers cite this work as background.

32 Pith papers citing it
Background 71% of classified citations
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.

hub tools

citation-role summary

background 5 method 2

citation-polarity summary

representative citing papers

Learning Dynamic Stability Landscapes in Synchronization Networks

cs.LG · 2026-05-22 · unverdicted · novelty 7.0

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 generalization.

Effective Capacitance Modeling Using Graph Neural Networks

cs.LG · 2025-07-04 · unverdicted · novelty 7.0

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

cs.LG · 2026-05-15 · unverdicted · novelty 6.0

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 competitive results on synthetic and biological data.

Quantum Injection Pathways for Implicit Graph Neural Networks

quant-ph · 2026-05-09 · unverdicted · novelty 6.0

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 MUTAG benchmarks.

GRASP -- Graph-Based Anomaly Detection Through Self-Supervised Classification

cs.CR · 2026-05-08 · unverdicted · novelty 6.0

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 behaviors are learnable plus additional unlabeled suspicious activity.

Fast and Featureless Node Representation Learning with Partial Pairwise Supervision

cs.LG · 2026-05-19 · unverdicted · novelty 5.0

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 performance and runtime gains on citation and co-purchase graphs.

Dual-Stream EEG Decoding for 3D Visual Perception

cs.CV · 2026-06-20 · unverdicted · novelty 4.0

Dual-stream EEG decoder separates identity and orientation to support 3D reconstruction from neural signals via circular regression and conditioned diffusion.

citing papers explorer

Showing 32 of 32 citing papers.