{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T08:59:14Z","timestamp":1775638754257,"version":"3.50.1"},"reference-count":181,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U22B2037"],"award-info":[{"award-number":["U22B2037"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U23B2048"],"award-info":[{"award-number":["U23B2048"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["92470121"],"award-info":[{"award-number":["92470121"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62402016"],"award-info":[{"award-number":["62402016"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["SH-2024JK29"],"award-info":[{"award-number":["SH-2024JK29"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"High-performance Computing Platform of Peking University"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1109\/tkde.2025.3540787","type":"journal-article","created":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T18:29:40Z","timestamp":1739298580000},"page":"3173-3192","source":"Crossref","is-referenced-by-count":10,"title":["Acceleration Algorithms in GNNs: A Survey"],"prefix":"10.1109","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-1665-8212","authenticated-orcid":false,"given":"Lu","family":"Ma","sequence":"first","affiliation":[{"name":"School of CS, Peking University, Beijing, China"}]},{"given":"Zeang","family":"Sheng","sequence":"additional","affiliation":[{"name":"School of CS, Peking University, Beijing, China"}]},{"given":"Xunkai","family":"Li","sequence":"additional","affiliation":[{"name":"School of CS, Beijing Institute of Technology, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-1146-8925","authenticated-orcid":false,"given":"Xinyi","family":"Gao","sequence":"additional","affiliation":[{"name":"University of Queensland, Brisbane, QLD, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9900-894X","authenticated-orcid":false,"given":"Zhezheng","family":"Hao","sequence":"additional","affiliation":[{"name":"School of AI, Northwestern Polytechnical University, Xi’an, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1905-8053","authenticated-orcid":false,"given":"Ling","family":"Yang","sequence":"additional","affiliation":[{"name":"School of CS, Peking University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6766-757X","authenticated-orcid":false,"given":"Xiaonan","family":"Nie","sequence":"additional","affiliation":[{"name":"School of CS, Peking University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0051-0046","authenticated-orcid":false,"given":"Jiawei","family":"Jiang","sequence":"additional","affiliation":[{"name":"School of Computer Science, Wuhan University, Wuhan, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7532-5550","authenticated-orcid":false,"given":"Wentao","family":"Zhang","sequence":"additional","affiliation":[{"name":"Center for machine learning research, Peking University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1681-4677","authenticated-orcid":false,"given":"Bin","family":"Cui","sequence":"additional","affiliation":[{"name":"School of CS, Peking University, Beijing, China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2023.126441"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3661821"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICSSSM.2007.4280214"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-37196-7_2"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.ddtec.2020.11.009"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2023.3257759"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.117921"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3191784"},{"key":"ref9","article-title":"A survey on graph neural networks for knowledge graph completion","author":"Arora","year":"2020"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.2981333"},{"key":"ref11","first-page":"1","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kipf"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-01587-8_7"},{"key":"ref13","first-page":"1025","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Hamilton"},{"key":"ref14","article-title":"How powerful are graph neural networks?","author":"Xu","year":"2018"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1038\/s43246-022-00315-6"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/RBME.2021.3122522"},{"key":"ref17","first-page":"1263","article-title":"Neural message passing for quantum chemistry","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Gilmer"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/tpami.2024.3445463"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TAI.2022.3194869"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00710"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1561\/2200000096"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-022-10265-7"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3535101"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3488560.3501396"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219890"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403296"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3511986"},{"key":"ref28","article-title":"Open graph benchmark: Datasets for machine learning on graphs","author":"Hu","year":"2020"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599843"},{"key":"ref30","article-title":"A survey on graph neural network acceleration: Algorithms, systems, and customized hardware","author":"Zhang","year":"2023"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.23919\/cje.2023.00.135"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2022\/772"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/JAS.2021.1004311"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3469379.3469387"},{"key":"ref35","first-page":"6861","article-title":"Simplifying graph convolutional networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Wu"},{"key":"ref36","first-page":"5376","article-title":"A comprehensive study on large-scale graph training: Benchmarking and rethinking","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Duan"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/3711121"},{"key":"ref38","first-page":"1","article-title":"Degree-quant: Quantization-aware training for graph neural networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Tailor"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2021.07.045"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.14778\/3461535.3461547"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.00161"},{"key":"ref42","first-page":"1","article-title":"Graph condensation for graph neural networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Jin"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2025.3535877"},{"key":"ref44","first-page":"942","article-title":"Stochastic training of graph convolutional networks with variance reduction","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Chen"},{"key":"ref45","first-page":"6878","article-title":"Bandit samplers for training graph neural networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Liu"},{"key":"ref46","first-page":"25684","article-title":"GraphFM: Improving large-scale GNN training via feature momentum","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Yu"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467284"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/455"},{"key":"ref49","first-page":"21171","article-title":"Hierarchical graph transformer with adaptive node sampling","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Zhang"},{"key":"ref50","first-page":"1","article-title":"FastGCN: Fast learning with graph convolutional networks via importance sampling","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Chen"},{"key":"ref51","first-page":"4563","article-title":"Adaptive sampling towards fast graph representation learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Huang"},{"key":"ref52","first-page":"11247","article-title":"Layer-dependent importance sampling for training deep and large graph convolutional networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Zou"},{"key":"ref53","first-page":"1","article-title":"Grapes: Learning to sample graphs for scalable graph neural networks","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst. Workshop: New Front. Graph Learn.","author":"Younesian"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219947"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330925"},{"key":"ref56","first-page":"1","article-title":"Graphsaint: Graph sampling based inductive learning method","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Zeng"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403192"},{"key":"ref58","first-page":"19665","article-title":"Decoupling the depth and scope of graph neural networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Zeng"},{"key":"ref59","first-page":"3294","article-title":"Gnnautoscale: Scalable and expressive graph neural networks via historical embeddings","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Fey"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN52387.2021.9533429"},{"key":"ref61","first-page":"1","article-title":"LMC: Fast training of GNNs via subgraph sampling with provable convergence","volume-title":"Proc. 11th Int. Conf. Learn. Representations","author":"Shi"},{"key":"ref62","first-page":"1","article-title":"Simple spectral graph convolution","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Zhu"},{"key":"ref63","article-title":"Sign: Scalable inception graph neural networks","author":"Frasca","year":"2020"},{"key":"ref64","first-page":"14556","article-title":"Scalable graph neural networks via bidirectional propagation","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Chen"},{"key":"ref65","first-page":"20321","article-title":"Node dependent local smoothing for scalable graph learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Zhang"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3103984"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467243"},{"key":"ref68","first-page":"26467","article-title":"Nafs: A simple yet tough-to-beat baseline for graph representation learning","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Zhang"},{"key":"ref69","first-page":"1","article-title":"Predict then propagate: Graph neural networks meet personalized pagerank","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Gasteiger"},{"key":"ref70","first-page":"1","article-title":"Combining label propagation and simple models out-performs graph neural networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Huang"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2024.111210"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539121"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512044"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583408"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-023-00829-6"},{"key":"ref76","first-page":"1","article-title":"A software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices","volume":"38","author":"Karypis","year":"1998"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.4324\/9781410605337-29"},{"key":"ref78","first-page":"5453","article-title":"Representation learning on graphs with jumping knowledge networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Xu"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403236"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/320"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3223018"},{"key":"ref82","first-page":"29761","article-title":"Geometric knowledge distillation: Topology compression for graph neural networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Yang"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52688.2022.00895"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539315"},{"key":"ref85","article-title":"Graph-MLP: Node classification without message passing in graph","author":"Hu","year":"2021"},{"key":"ref86","article-title":"Graph-less neural networks: Teaching old MLPs new tricks via distillation","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Zhang"},{"key":"ref87","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3450068"},{"key":"ref88","first-page":"1","article-title":"Learning MLPs on graphs: A unified view of effectiveness, robustness, and efficiency","volume-title":"Proc. 11th Int. Conf. Learn. Representations","author":"Tian"},{"key":"ref89","first-page":"37571","article-title":"Quantifying the knowledge in GNNs for reliable distillation into MLPs","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Wu"},{"key":"ref90","first-page":"1","article-title":"Propagate & distill: Towards effective graph learners using propagation-embracing MLPs","volume-title":"Proc. 2nd Learn. Graphs Conf.","author":"Shin"},{"key":"ref91","first-page":"1","article-title":"VQGraph: Graph vector-quantization for bridging GNNs and MLPs","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Yang"},{"key":"ref92","article-title":"Learned low precision graph neural networks","author":"Zhao","year":"2020"},{"key":"ref93","doi-asserted-by":"publisher","DOI":"10.1109\/ictai50040.2020.00198"},{"key":"ref94","first-page":"6733","article-title":"VQ-GNN: A universal framework to scale up graph neural networks using vector quantization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Ding"},{"key":"ref95","first-page":"1","article-title":"$\\mathrm{A}^{2}\\mathrm{Q}$A2Q: Aggregation-aware quantization for graph neural networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Zhu"},{"key":"ref96","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2022.06.097"},{"key":"ref97","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2022.102578"},{"key":"ref98","doi-asserted-by":"publisher","DOI":"10.1145\/3583780.3614955"},{"key":"ref99","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2023.3285874"},{"key":"ref100","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA57654.2024.00020"},{"key":"ref101","first-page":"1695","article-title":"A unified lottery ticket hypothesis for graph neural networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Chen"},{"key":"ref102","doi-asserted-by":"publisher","DOI":"10.1007\/s11390-023-2583-5"},{"key":"ref103","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i8.20873"},{"key":"ref104","article-title":"Searching lottery tickets in graph neural networks: A dual perspective","volume-title":"Proc. 11th Int. Conf. Learn. Representations","author":"Wang"},{"key":"ref105","article-title":"Rethinking graph lottery tickets: Graph sparsity matters","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Hui"},{"key":"ref106","doi-asserted-by":"publisher","DOI":"10.1145\/3637528.3671766"},{"key":"ref107","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-021-01453-z"},{"key":"ref108","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.00497"},{"key":"ref109","article-title":"Distilling the knowledge in a neural network","author":"Hinton","year":"2015"},{"key":"ref110","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298801"},{"key":"ref111","doi-asserted-by":"publisher","DOI":"10.1201\/9781003162810-13"},{"key":"ref112","article-title":"A comprehensive survey on model quantization for deep neural networks","author":"Rokh","year":"2022"},{"key":"ref113","article-title":"Neural network quantization for efficient inference: A survey","author":"Weng","year":"2021"},{"key":"ref114","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00881"},{"key":"ref115","doi-asserted-by":"publisher","DOI":"10.1109\/emc2-nips53020.2019.00016"},{"key":"ref116","article-title":"Estimating or propagating gradients through stochastic neurons for conditional computation","author":"Bengio","year":"2013"},{"key":"ref117","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV48922.2021.00530"},{"key":"ref118","article-title":"Training deep neural networks with 8-bit floating point numbers","author":"Wang","year":"2018","journal-title":"Neural Inf. Process. Syst."},{"key":"ref119","first-page":"7686","article-title":"Scalable methods for 8-bit training of neural networks","volume-title":"Proc. Neural Inf. Process. Syst.","author":"Banner"},{"key":"ref120","article-title":"Exact: Scalable graph neural networks training via extreme activation compression","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Liu"},{"key":"ref121","article-title":"Mixed precision training","author":"Micikevicius","year":"2017"},{"key":"ref122","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3182659"},{"key":"ref123","doi-asserted-by":"publisher","DOI":"10.23919\/CCC50068.2020.9189610"},{"key":"ref124","article-title":"The lottery ticket hypothesis: Finding sparse, trainable neural networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Frankle"},{"key":"ref125","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-021-00878-3"},{"key":"ref126","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.00937"},{"key":"ref127","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV48922.2021.00525"},{"key":"ref128","doi-asserted-by":"publisher","DOI":"10.1145\/3577193.3593725"},{"key":"ref129","first-page":"53201","article-title":"Does graph distillation see like vision dataset counterpart?","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Yang"},{"key":"ref130","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE60146.2024.00237"},{"key":"ref131","article-title":"CTRL: Graph condensation via crafting rational trajectory matching","author":"Zhang","year":"2024"},{"key":"ref132","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539429"},{"key":"ref133","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2024.3362863"},{"key":"ref134","doi-asserted-by":"publisher","DOI":"10.1145\/3589334.3645551"},{"key":"ref135","article-title":"Structure-free graph condensation: From large-scale graphs to condensed graph-free data","author":"Zheng","year":"2023"},{"key":"ref136","article-title":"Navigating complexity: Toward lossless graph condensation via expanding window matching","author":"Zhang","year":"2024"},{"key":"ref137","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599398"},{"key":"ref138","doi-asserted-by":"publisher","DOI":"10.1145\/3589334.3645694"},{"key":"ref139","doi-asserted-by":"publisher","DOI":"10.1145\/3637528.3671917"},{"key":"ref140","article-title":"Graph condensation via receptive field distribution matching","author":"Liu","year":"2022"},{"key":"ref141","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM58522.2023.00141"},{"key":"ref142","first-page":"30702","article-title":"Graph distillation with Eigenbasis matching","volume-title":"Proc. 41st Int. Conf. Mach. Learn.","author":"Liu"},{"key":"ref143","article-title":"Rethinking and accelerating graph condensation: A training-free approach with class partition","author":"Gao","year":"2024"},{"key":"ref144","doi-asserted-by":"publisher","DOI":"10.1145\/3696410.3714851"},{"key":"ref145","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-70344-7_4"},{"key":"ref146","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2020.107281"},{"key":"ref147","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-020-09816-7"},{"key":"ref148","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-023-10464-w"},{"key":"ref149","first-page":"3123","article-title":"Binaryconnect: Training deep neural networks with binary weights during propagations","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Courbariaux"},{"key":"ref150","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374456"},{"key":"ref151","first-page":"3237","article-title":"Spectrally approximating large graphs with smaller graphs","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Loukas"},{"key":"ref152","article-title":"Dataset meta-learning from kernel ridge-regression","author":"Nguyen","year":"2020"},{"key":"ref153","doi-asserted-by":"publisher","DOI":"10.26599\/TST.2021.9010057"},{"key":"ref154","doi-asserted-by":"publisher","DOI":"10.1109\/MCI.2022.3222049"},{"key":"ref155","doi-asserted-by":"publisher","DOI":"10.1145\/3575637.3575644"},{"key":"ref156","article-title":"Fast graph representation learning with pytorch geometric","author":"Fey","year":"2019"},{"key":"ref157","article-title":"Deep graph library: A graph-centric, highly-performant package for graph neural networks","author":"Wang","year":"2019"},{"key":"ref158","first-page":"443","article-title":"{NeuGraph}: Parallel deep neural network computation on large graphs","volume-title":"Proc. 2019 USENIX Annu. Tech. Conf.","author":"Ma"},{"key":"ref159","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00137"},{"key":"ref160","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3340404"},{"key":"ref161","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467061"},{"key":"ref162","article-title":"A survey on temporal graph representation learning and generative modeling","author":"Gupta","year":"2022"},{"key":"ref163","article-title":"Graph neural networks for temporal graphs: State of the art, open challenges, and opportunities","author":"Longa","year":"2023"},{"key":"ref164","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-022-10375-2"},{"key":"ref165","article-title":"A comprehensive survey of dynamic graph neural networks: Models, frameworks, benchmarks, experiments and challenges","author":"Feng","year":"2024"},{"key":"ref166","article-title":"Towards data-centric graph machine learning: Review and outlook","author":"Zheng","year":"2023"},{"key":"ref167","article-title":"Data-centric graph learning: A survey","author":"Yang","year":"2023"},{"key":"ref168","article-title":"A survey on graph structure learning: Progress and opportunities","author":"Zhu","year":"2021"},{"key":"ref169","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512186"},{"key":"ref170","doi-asserted-by":"publisher","DOI":"10.1109\/TGRS.2022.3166252"},{"key":"ref171","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3172903"},{"key":"ref172","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2022.3170559"},{"key":"ref173","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3131584"},{"key":"ref174","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-023-06221-2"},{"key":"ref175","doi-asserted-by":"publisher","DOI":"10.1145\/3648358"},{"key":"ref176","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2023.3284976"},{"key":"ref177","doi-asserted-by":"publisher","DOI":"10.14778\/3551793.3551819"},{"key":"ref178","doi-asserted-by":"publisher","DOI":"10.1145\/3552326.3567501"},{"key":"ref179","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3559352"},{"key":"ref180","article-title":"Continual learning on graphs: A survey","author":"Tian","year":"2024"},{"key":"ref181","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3559352"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/69\/10981836\/10882936.pdf?arnumber=10882936","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T18:28:37Z","timestamp":1746469717000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10882936\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6]]},"references-count":181,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2025.3540787","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6]]}}}