Pith. sign in

REVIEW 35 cited by

GraphSAINT: Graph Sampling Based Inductive Learning Method

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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

arxiv 1907.04931 v4 pith:RDGXBKNO submitted 2019-07-10 cs.LG stat.ML

Hanqing Zeng , Hongkuan Zhou , Ajitesh Srivastava , Rajgopal Kannan , Viktor Prasanna This is my paper · ORCID
classification cs.LGstat.ML
keywords samplinggraphgraphsainttraininggraphslearningaccuracygcns
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Graph Convolutional Networks (GCNs) are powerful models for learning representations of attributed graphs. To scale GCNs to large graphs, state-of-the-art methods use various layer sampling techniques to alleviate the "neighbor explosion" problem during minibatch training. We propose GraphSAINT, a graph sampling based inductive learning method that improves training efficiency and accuracy in a fundamentally different way. By changing perspective, GraphSAINT constructs minibatches by sampling the training graph, rather than the nodes or edges across GCN layers. Each iteration, a complete GCN is built from the properly sampled subgraph. Thus, we ensure fixed number of well-connected nodes in all layers. We further propose normalization technique to eliminate bias, and sampling algorithms for variance reduction. Importantly, we can decouple the sampling from the forward and backward propagation, and extend GraphSAINT with many architecture variants (e.g., graph attention, jumping connection). GraphSAINT demonstrates superior performance in both accuracy and training time on five large graphs, and achieves new state-of-the-art F1 scores for PPI (0.995) and Reddit (0.970).

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 35 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. CoRe-GNN: Multilevel Message passing on Coarsened graphs

    cs.LG 2026-08 conditional novelty 7.0 of 10

    CoRe-GNN runs message passing both inside clusters and on a coarsened graph in parallel, letting scalable training keep long-range signal.

  2. Heterogeneous Graph Backdoor Attack

    cs.CR 2025-05 conditional novelty 7.0 of 10

    HGBA is a backdoor attack against heterogeneous graph neural networks that uses a single relation-based trigger edge to achieve high attack success with low budget and resistance to defenses.

  3. LGNNIC: Acceleration of Large-Scale GNN Training using SmartNICs

    cs.DC 2026-08 conditional novelty 6.0 of 10

    Moving neighbor sampling and FP16 quantization to a BlueField-2 SmartNIC reduces transferred data and delivers measured GNN training speedups on three datasets.

  4. Edge Sparsification via Temporal Forman-Ricci Curvature for Dynamic Graph Learning

    cs.LG 2026-08 conditional novelty 6.0 of 10

    TRicci removes about 80% of edges in temporal graphs while preserving 97.7% of full-graph ROC-AUC and cutting end-to-end runtime by 55.94% on graph-level prediction tasks.

  5. Wrong Code, Right Structure: Learning Netlist Representations from Imperfect LLM-Generated RTL

    cs.LG 2026-03 conditional novelty 6.0 of 10

    Training on filtered, functionally imperfect LLM-generated RTL netlists lets GNNs match or beat models trained on scarce clean netlist data for sub-circuit identification.

  6. Attention Enhanced Entity Recommendation for Intelligent Monitoring in Cloud Systems

    cs.LG 2025-10 conditional novelty 6.0 of 10

    A heterogeneous-graph recommender with multi-head attention, random-walk attention, and an alignment loss recommends cloud-monitor dimensions, beating baseline GNNs on Microsoft's production data and on DBLP/LastFM.

  7. GraphPFN: A Prior-Data Fitted Graph Foundation Model

    cs.LG 2025-09 conditional novelty 6.0 of 10

    GraphPFN, a graph foundation model pretrained on synthetic graphs from a stochastic-block-model plus preferential-attachment prior with graph-aware structured causal models, outperforms existing graph foundation model...

  8. Simple yet Effective Graph Distillation via Clustering

    cs.LG 2025-05 conditional novelty 6.0 of 10

    ClustGDD distills large graphs by clustering node embeddings and refining synthetic attributes, achieving state-of-the-art node classification accuracy at orders of magnitude lower time cost.

  9. Open Your Eyes: Vision Enhances Message Passing Neural Networks in Link Prediction

    cs.CV 2025-05 accept novelty 6.0 of 10

    Visual features extracted from rendered subgraph images consistently improve message-passing link predictors on seven benchmarks, and an efficient node-centered variant scales to large graphs.

  10. Fused3S: Fast Sparse Attention on Tensor Cores

    cs.DC 2025-05 conditional novelty 6.0 of 10

    A fused tensor-core sparse attention kernel (SDDMM, softmax, SpMM) that achieves large speedups over prior baselines on H100 and A30.

  11. Boosting Graph Robustness Against Backdoor Attacks: An Over-Similarity Perspective

    cs.LG 2025-02 conditional novelty 6.0 of 10

    SimGuard detects graph backdoor triggers by exploiting their mutual feature and structural similarity, detecting and removing them during both training and inference.

  12. Resolving Oversmoothing with Opinion Dissensus

    cs.LG 2025-01 conditional novelty 6.0 of 10

    BIMP, a continuous-depth GNN based on nonlinear opinion dynamics, is shown to avoid oversmoothing when its constant input has unique entries, and it outperforms baselines on ten node-classification datasets.

  13. Random Walk Guided Hyperbolic Graph Distillation

    cs.LG 2025-01 conditional novelty 6.0 of 10

    HyDRO distills graphs in hyperbolic space with random-walk spectral gap matching, improving link prediction and continual graph learning.

  14. Towards Precise Prediction Uncertainty in GNNs: Refining GNNs with Topology-grouping Strategy

    cs.LG 2024-12 conditional novelty 6.0 of 10

    A post-hoc GNN calibration method that groups nodes by confidence and neighborhood prediction similarity and applies group-specific temperatures, reducing expected calibration error on many benchmarks.

  15. FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Cores

    cs.DC 2024-12 conditional novelty 6.0 of 10

    FlashSparse uses the identity A×B=(B^T×A^T)^T to reduce sparse matrix multiplication's nonzero-vector granularity from 16×1 to 8×1 on tensor cores, reporting SOTA speedups.

  16. MADE: Graph Backdoor Defense with Masked Unlearning

    cs.CR 2024-11 conditional novelty 6.0 of 10

    MADE is a training-set-only graph backdoor defense combining homophily-based poisoned-sample isolation with masked unlearning to drive attack success rate to near zero while keeping accuracy high.

  17. Personalized One-shot Federated Graph Learning for Heterogeneous Clients

    cs.LG 2024-11 conditional novelty 6.0 of 10

    O-pFGL achieves one-shot personalized federated graph learning by aggregating class-wise feature statistics into a surrogate graph and combining global distillation with local fine-tuning, outperforming baselines on 1...

  18. FuseSampleAgg: One-Pass Neighborhood Estimation for Budgeted Knowledge-Graph Refresh and Validation

    cs.LG 2025-11 conditional novelty 5.0 of 10

    FuseSampleAgg performs neighbor sampling and mean aggregation for 1-2 hop GraphSAGE in a single fused CUDA pass, eliminating intermediate block tensors and reporting 1.1-51x step-time and 3.4-100x peak-memory gains ov...

  19. Asynchronous Message Passing for Addressing Oversquashing in Graph Neural Networks

    cs.LG 2025-09 reject novelty 5.0 of 10

    CAMP updates nodes in centrality-ranked batches to spread information across GNN layers and claims to reduce oversquashing without rewiring, but the proof and evidence are not convincing.

  20. RapidGNN: Energy and Communication-Efficient Distributed Training on Large-Scale Graph Neural Networks

    cs.LG 2025-09 conditional novelty 5.0 of 10

    Deterministic sampling plus hot-node caching and prefetching speeds up distributed GNN training by about 2.5x to 3x on tested graphs while cutting remote fetches and energy.

  21. Neighbor-Sampling Based Momentum Stochastic Methods for Training Graph Neural Networks

    math.OC 2025-08 unverdicted novelty 5.0 of 10

    The paper creates Adam-style optimizers that combine neighbor sampling and control variates for graph neural networks, with optimal convergence rates and better node-classification performance than control-variate SGD.

  22. Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation

    cs.SI 2025-07 conditional novelty 5.0 of 10

    CMV-ND builds one feature view per exact hop distance and then runs existing clustering methods on those views, improving attribute-missing large-scale graph clustering in experiments.

  23. AdaptGOT: A Pre-trained Model for Adaptive Contextual POI Representation Learning

    cs.CL 2025-06 conditional novelty 5.0 of 10

    AdaptGOT combines four graph sampling strategies, a geography-co-occurrence-text attention module, and a mixture-of-experts aggregator to produce task-adaptive POI embeddings that outperform baseline pre-trained embed...

  24. GraphFLEx: Structure Learning Framework for Large Expanding Graphs

    cs.LG 2025-05 reject novelty 5.0 of 10

    GraphFLEx uses clustering, hashing-based coarsening, and local graph learning to incrementally infer structure in large expanding graphs, claiming faster runtime and near-original accuracy.

  25. RapidGNN: Communication Efficient Large-Scale Distributed Training of Graph Neural Networks

    cs.DC 2025-05 conditional novelty 5.0 of 10

    RapidGNN speeds up distributed GNN training by deterministically precomputing mini-batches, caching frequently used remote node features, and prefetching upcoming batches, cutting training time by about 2.1x on averag...

  26. FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs

    cs.LG 2025-04 reject novelty 5.0 of 10

    FedHERO shares a learned latent-graph generator across federated clients and keeps a private local channel, improving node classification when client graphs have different heterophily patterns.

  27. Rethinking Client-oriented Federated Graph Learning

    cs.LG 2025-04 reject novelty 5.0 of 10

    FedC4 combines graph condensation with selective client-to-client sharing, reporting better accuracy and up to 1000x lower communication in federated graph learning, though its privacy proof has a gap.

  28. Inference-friendly Graph Compression for Graph Neural Networks

    cs.LG 2025-04 reject novelty 5.0 of 10

    A graph compression scheme that merges inference-equivalent nodes so GNN inference can run on a smaller graph with no or little decompression, claiming 55-85% inference cost reduction with small accuracy loss.

  29. ScaDyG:A New Paradigm for Large-scale Dynamic Graph Learning

    cs.LG 2025-01 reject novelty 5.0 of 10

    ScaDyG proposes a decoupled, step-wise exponential time encoding with hypernetwork aggregation for scalable dynamic graph learning, but the key proof of equivalence with composite exponential message passing is invali...

  30. DESIGN: Encrypted GNN Inference via Server-Side Input Graph Pruning

    cs.CR 2025-07 reject novelty 4.0 of 10

    DESIGN uses encrypted node degrees to prune graphs and adaptively choose polynomial activations, reporting 1.7x-2.4x speedups over a basic FHE GNN baseline.

  31. AH-UGC: Adaptive and Heterogeneous-Universal Graph Coarsening

    cs.SI 2025-05 conditional novelty 4.0 of 10

    AH-UGC produces multiple coarsened graphs from one sorted hashed list and keeps heterogeneous node types pure by coarsening each type separately.

  32. SCFCRC: Simultaneously Counteract Feature Camouflage and Relation Camouflage for Fraud Detection

    cs.LG 2025-01 conditional novelty 4.0 of 10

    SCFCRC combines a feature filter trained with propagated pseudo-labels and a mixture-of-experts refiner with masking regularization to improve fraud detection on YelpChi and Amazon.

  33. GNN-MultiFix: Addressing the pitfalls for GNNs for multi-label node classification

    cs.LG 2024-11 conditional novelty 4.0 of 10

    GNN-MultiFix combines graph features, propagated training labels, and DeepWalk position embeddings to improve multi-label node classification.

  34. From free-evolution to tomographic representation

    quant-ph 2025-08 unverdicted novelty 3.0 of 10

    An abstract claims general tomogram expressions for one-dimensional quantum systems, but the supplied full text is a different paper on hardware security, so the result cannot be verified.

  35. HGCN(O): A Self-Tuning GCN HyperModel Toolkit for Outcome Prediction in Event-Sequence Data

    cs.LG 2025-07 reject novelty 3.0 of 10

    A self-tuning toolkit of four GCN input architectures (O-, T-, TP-, TE-GCN) is applied to outcome prediction; the claimed advantage over baselines is unsupported, and the balanced-data perfect scores are likely leakag...

Pith tools