{"url":"/method/graphsaint","slug":"graphsaint","name":"GraphSAINT","full_name":"Graph sampling based inductive learning method","full_name_withheld":false,"description_markdown":"Scalable method to train large scale GNN models via sampling small subgraphs.","description_state":"present","introduced_year":null,"introduced_by":{"title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","paper":"/paper/graphsaint-graph-sampling-based-inductive","first_author":"Hanqing Zeng","n_authors":5,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/graphsaint-graph-sampling-based-inductive"},"source":{"url":"https://arxiv.org/abs/1907.04931v4","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Graphs","area_id":"graphs","collection":"Graph Representation Learning","url":"/methods/category/graph-representation-learning","pwc_aliases":[]}],"n_papers_tagged":7,"archive_num_papers":7,"papers_newest_first":[{"paper":"/paper/lifelong-graph-summarization-with-neural","title":"Lifelong Graph Learning for Graph Summarization","date":"2024-07-25","arxiv_id":"2407.18042","n_code_links":1,"syntology":null},{"paper":null,"title":"PolicyClusterGCN: Identifying Efficient Clusters for Training Graph Convolutional Networks","date":"2023-06-25","arxiv_id":"2306.14357","n_code_links":0,"syntology":null},{"paper":null,"title":"BitGNN: Unleashing the Performance Potential of Binary Graph Neural Networks on GPUs","date":"2023-05-04","arxiv_id":"2305.02522","n_code_links":0,"syntology":null},{"paper":"/paper/a-new-graph-node-classification-benchmark","title":"A New Graph Node Classification Benchmark: Learning Structure from Histology Cell Graphs","date":"2022-11-11","arxiv_id":"2211.06292","n_code_links":1,"syntology":{"ran":0,"of":3,"unverified":3,"pointer_only":0}},{"paper":"/paper/decoupling-the-depth-and-scope-of-graph-1","title":"Decoupling the Depth and Scope of Graph Neural Networks","date":"2022-01-19","arxiv_id":"2201.07858","n_code_links":1,"syntology":{"ran":0,"of":2,"unverified":2,"pointer_only":2}},{"paper":null,"title":"On Batch-size Selection for Stochastic Training for Graph Neural Networks","date":"2021-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/graphsaint-graph-sampling-based-inductive","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","date":"2019-07-10","arxiv_id":"1907.04931","n_code_links":8,"syntology":null}],"papers_shown":7,"tasks":[{"task":"/task/node-classification","name":"Node Classification","papers":4},{"task":"/task/graph-learning","name":"Graph Learning","papers":2},{"task":"/task/node-property-prediction","name":"Node Property Prediction","papers":2},{"task":"/task/attribute","name":"Attribute","papers":1},{"task":"/task/deep-learning","name":"Deep Learning","papers":1},{"task":"/task/graph-attention","name":"Graph Attention","papers":1},{"task":"/task/graph-embedding","name":"Graph Embedding","papers":1},{"task":"/task/graph-neural-network","name":"Graph Neural Network","papers":1},{"task":"/task/graph-representation-learning","name":"Graph Representation Learning","papers":1},{"task":"/task/graph-sampling","name":"Graph Sampling","papers":1},{"task":"/task/inductive-learning","name":"Inductive Learning","papers":1},{"task":"/task/link-prediction","name":"Link Prediction","papers":1},{"task":"/task/reinforcement-learning-1","name":"Reinforcement Learning (RL)","papers":1},{"task":"/task/graph-partitioning","name":"graph partitioning","papers":1},{"task":"/task/whole-slide-images","name":"whole slide images","papers":1}],"tasks_shown":15,"n_tasks":15,"usage_by_year":[{"year":"2019","papers":1},{"year":"2021","papers":1},{"year":"2022","papers":2},{"year":"2023","papers":2},{"year":"2024","papers":1}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/graphsaint"},"syntology_read_at":"2026-09-24T18:15:14+00:00"}