{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T14:49:25Z","timestamp":1773758965813,"version":"3.50.1"},"reference-count":134,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Major Science and Technology Innovation 2030 \u201cNew Generation Artificial Intelligence\u201c Key Project","award":["2021ZD0111700"],"award-info":[{"award-number":["2021ZD0111700"]}]},{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61976162"],"award-info":[{"award-number":["61976162"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"publisher","award":["82174230"],"award-info":[{"award-number":["82174230"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62002090"],"award-info":[{"award-number":["62002090"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62172354"],"award-info":[{"award-number":["62172354"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Artificial Intelligence Innovation Project of Wuhan Science and Technology Bureau","award":["2022010702040070"],"award-info":[{"award-number":["2022010702040070"]}]},{"name":"Science and Technology Major Project of Hubei Province","award":["2019AEA170"],"award-info":[{"award-number":["2019AEA170"]}]},{"DOI":"10.13039\/501100000780","name":"EC","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Neural Netw. Learning Syst."],"published-print":{"date-parts":[[2024,10]]},"DOI":"10.1109\/tnnls.2023.3282049","type":"journal-article","created":{"date-parts":[[2023,6,27]],"date-time":"2023-06-27T17:37:51Z","timestamp":1687887471000},"page":"14903-14917","source":"Crossref","is-referenced-by-count":25,"title":["Comprehensive Graph Gradual Pruning for Sparse Training in Graph Neural Networks"],"prefix":"10.1109","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2377-2567","authenticated-orcid":false,"given":"Chuang","family":"Liu","sequence":"first","affiliation":[{"name":"School of Computer Science, Wuhan University, Wuhan, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1908-3187","authenticated-orcid":false,"given":"Xueqi","family":"Ma","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, Imperial College London, London, U.K"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3180-0484","authenticated-orcid":false,"given":"Yibing","family":"Zhan","sequence":"additional","affiliation":[{"name":"JD Explore Academy, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8976-2084","authenticated-orcid":false,"given":"Liang","family":"Ding","sequence":"additional","affiliation":[{"name":"JD Explore Academy, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0783-5273","authenticated-orcid":false,"given":"Dapeng","family":"Tao","sequence":"additional","affiliation":[{"name":"School of Information Science and Engineering and the Yunnan Key Laboratory of Media Convergence, Yunnan University, Kunming, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0059-8458","authenticated-orcid":false,"given":"Bo","family":"Du","sequence":"additional","affiliation":[{"name":"School of Computer Science, Wuhan University, Wuhan, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8383-2483","authenticated-orcid":false,"given":"Wenbin","family":"Hu","sequence":"additional","affiliation":[{"name":"School of Computer Science, Wuhan University, Wuhan, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8432-3963","authenticated-orcid":false,"given":"Danilo P.","family":"Mandic","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, Imperial College London, London, U.K"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. 5th Int. Conf. Learn. Represent.","author":"Kipf"},{"key":"ref2","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"30","author":"Hamilton"},{"key":"ref3","first-page":"1","article-title":"Graph attention networks","volume-title":"Proc. 6th Int. Conf. Learn. Represent.","author":"Veli\u010dkovi\u0107"},{"key":"ref4","first-page":"1","article-title":"How powerful are graph neural networks?","volume-title":"Proc. 7th Int. Conf. Learn. Represent.","author":"Xu"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3114027"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2021.3105617"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2022.3182715"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2022.3184967"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1561\/2200000078-1"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1561\/2200000078-2"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1561\/2200000078-3"},{"key":"ref13","article-title":"Open graph benchmark: Datasets for machine learning on graphs","author":"Hu","year":"2020","journal-title":"arXiv:2005.00687"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.00936"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3074057"},{"key":"ref16","first-page":"1725","article-title":"Simple and deep graph convolutional networks","volume-title":"Proc. 37th Int. Conf. Mach. Learn.","author":"Chen"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2022\/772"},{"key":"ref18","first-page":"1","article-title":"Degree-quant: Quantization-aware training for graph neural networks","volume-title":"Proc. 9th Int. Conf. Learn. Represent.","author":"Tailor"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i8.20873"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"key":"ref21","first-page":"1695","article-title":"A unified lottery ticket hypothesis for graph neural networks","volume-title":"Proc. 38th Int. Conf. Mach. Learn.","author":"Chen"},{"key":"ref22","first-page":"1","article-title":"Inductive lottery ticket learning for graph neural networks","volume-title":"Proc. ICLR","author":"Sui"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.l803.03635"},{"key":"ref24","first-page":"1","article-title":"Sparsity in deep learning: Pruning and growth for efficient inference and training in neural networks","volume":"22","author":"Hoefler","year":"2021","journal-title":"J. Mach. Learn. Res."},{"key":"ref25","first-page":"6861","article-title":"Simplifying graph convolutional networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Wu"},{"key":"ref26","first-page":"1","article-title":"Combining neural networks with personalized PageRank for classification on graphs","volume-title":"Proc. 7th Int. Conf. Learn. Represent.","author":"Gasteiger"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2022.3174515"},{"key":"ref28","first-page":"1250","article-title":"Graph sparsification approaches for Laplacian smoothing","volume-title":"Proc. Artif. Intell. Statist.","author":"Sadhanala"},{"key":"ref29","first-page":"688","article-title":"Improved large-scale graph learning through ridge spectral sparsification","volume-title":"Proc. 35th Int. Conf. Mach. Learn.","author":"Calandriello"},{"key":"ref30","first-page":"11458","article-title":"Robust graph representation learning via neural sparsification","volume-title":"Proc. 37th Int. Conf. Mach. Learn.","author":"Zheng"},{"key":"ref31","first-page":"1","article-title":"DropEdge: Towards deep graph convolutional networks on node classification","volume-title":"Proc. 8th Int. Conf. Learn. Represent.","author":"Rong"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-47426-3_22"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"ref34","first-page":"3237","article-title":"Spectrally approximating large graphs with smaller graphs","volume-title":"Proc. 35th Int. Conf. Mach. Learn.","author":"Loukas"},{"issue":"116","key":"ref35","first-page":"1","article-title":"Graph reduction with spectral and cut guarantees","volume":"20","author":"Loukas","year":"2019","journal-title":"J. Mach. Learn. Res."},{"key":"ref36","first-page":"1","article-title":"Graph coarsening with neural networks","volume-title":"Proc. 9th Int. Conf. Learn. Represent.","author":"Cai"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467256"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/3186727"},{"key":"ref39","article-title":"SIGN: Scalable inception graph neural networks","author":"Frasca","year":"2020","journal-title":"arXiv:2004.11198"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403076"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403296"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11691"},{"key":"ref43","first-page":"3259","article-title":"Linear mode connectivity and the lottery ticket hypothesis","volume-title":"Proc. 37th Int. Conf. Mach. Learn.","author":"Frankle"},{"key":"ref44","first-page":"12380","article-title":"Efficient lottery ticket finding: Less data is more","volume-title":"Proc. 38th Int. Conf. Mach. Learn.","author":"Zhang"},{"key":"ref45","first-page":"1","article-title":"Drawing Early-Bird tickets: Toward more efficient training of deep networks","volume-title":"Proc. 8th Int. Conf. Learn. Represent.","author":"You"},{"key":"ref46","article-title":"Deconstructing lottery tickets: Zeros, signs, and the supermask","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"32","author":"Zhou"},{"key":"ref47","first-page":"12749","article-title":"Sanity checks for lottery tickets: Does your winning ticket really win the Jackpot?","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"34","author":"Ma"},{"key":"ref48","first-page":"1780","article-title":"You are caught stealing my winning lottery ticket! Making a lottery ticket claim its ownership","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"34","author":"Chen"},{"key":"ref49","first-page":"1","article-title":"Long live the lottery: The existence of winning tickets in lifelong learning","volume-title":"Proc. 9th Int. Conf. Learn. Represent.","author":"Chen"},{"key":"ref50","first-page":"1","article-title":"GANs can play lottery tickets too","volume-title":"Proc. 9th Int. Conf. Learn. Represent.","author":"Chen"},{"key":"ref51","first-page":"15834","article-title":"The lottery ticket hypothesis for pre-trained BERT networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NIPS)","volume":"33","author":"Chen"},{"key":"ref52","first-page":"1","article-title":"Fast graph representation learning with PyTorch geometric","volume-title":"Proc. Int. Conf. Learn. Represent. Workshop Represent. Learn. Graphs Manifolds","author":"Fey"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.14778\/3461535.3461547"},{"key":"ref54","first-page":"1","article-title":"Sparse training via boosting pruning plasticity with neuroregeneration","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"34","author":"Liu"},{"key":"ref55","article-title":"Exploring sparsity in recurrent neural networks","author":"Narang","year":"2017","journal-title":"arXiv:1704.05119"},{"key":"ref56","article-title":"To prune, or not to prune: Exploring the efficacy of pruning for model compression","author":"Zhu","year":"2017","journal-title":"arXiv:1710.01878"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-018-04316-3"},{"key":"ref58","first-page":"4646","article-title":"Parameter efficient training of deep convolutional neural networks by dynamic sparse reparameterization","volume-title":"Proc. 36th Int. Conf. Mach. Learn.","author":"Mostafa"},{"key":"ref59","first-page":"2943","article-title":"Rigging the lottery: Making all tickets winners","volume-title":"Proc. 37th Int. Conf. Mach. Learn.","author":"Evci"},{"key":"ref60","article-title":"Sparse networks from scratch: Faster training without losing performance","author":"Dettmers","year":"2019","journal-title":"arXiv:1907.04840"},{"key":"ref61","first-page":"1","article-title":"Picking winning tickets before training by preserving gradient flow","volume-title":"Proc. 8th Int. Conf. Learn. Represent.","author":"Wang"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i6.20611"},{"key":"ref63","article-title":"Keep the gradients flowing: Using gradient flow to study sparse network optimization","author":"Hooker","year":"2021","journal-title":"arXiv:2102.01670"},{"key":"ref64","first-page":"9833","article-title":"Training your sparse neural network better with any mask","volume-title":"Proc. 39th Int. Conf. Mach. Learn.","author":"Jaiswal"},{"key":"ref65","first-page":"6989","article-title":"Do we actually need dense over-parameterization? In-time over-parameterization in sparse training","volume-title":"Proc. 38th Int. Conf. Mach. Learn.","volume":"139","author":"Liu"},{"key":"ref66","first-page":"8620","article-title":"Dense for the price of sparse: Improved performance of sparsely initialized networks via a subspace offset","volume-title":"Proc. 38th Int. Conf. Mach. Learn.","author":"Price"},{"key":"ref67","first-page":"1","article-title":"FastGCN: Fast learning with graph convolutional networks via importance sampling","volume-title":"Proc. 6th Int. Conf. Learn. Represent.","author":"Chen"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1145\/3490181"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00054"},{"key":"ref70","first-page":"7793","article-title":"Beyond homophily in graph neural networks: Current limitations and effective designs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Zhu"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1038\/nature14539"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526781"},{"key":"ref73","first-page":"21","article-title":"MixHop: Higher-order graph convolutional architectures via sparsified neighborhood mixing","volume-title":"Proc. 36th Int. Conf. Mach. Learn.","volume":"97","author":"Abu-El-Haija"},{"key":"ref74","first-page":"1","article-title":"Adaptive universal generalized PageRank graph neural network","volume-title":"Proc. 9th Int. Conf. Learn. Represent.","author":"Chien"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i5.16514"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1016\/0098-3004(93)90090-R"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1137\/090771806"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1038\/44565"},{"issue":"11","key":"ref79","first-page":"1","article-title":"Visualizing data using t-SNE","volume":"9","author":"Van der Maaten","year":"2008","journal-title":"J. Mach. Learn. Res."},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-007-9033-z"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2022.109265"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/565"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2020.05.077"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1145\/3293883.3295712"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.01464"},{"key":"ref86","first-page":"1","article-title":"Learning N:M fine-grained structured sparse neural networks from scratch","volume-title":"Proc. 9th Int. Conf. Learn. Represent.","author":"Zhou"},{"key":"ref87","article-title":"Pitfalls of graph neural network evaluation","author":"Shchur","year":"2018","journal-title":"arXiv:1811.05868"},{"key":"ref88","article-title":"The PageRank citation ranking: Bringing order to the web","author":"Page","year":"1999"},{"key":"ref89","article-title":"Adam: A method for stochastic optimization","author":"Kingma","year":"2014","journal-title":"arXiv:1412.6980"},{"key":"ref90","first-page":"1","article-title":"Large scale learning on non-homophilous graphs: New benchmarks and strong simple methods","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Lim"},{"key":"ref91","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219890"},{"key":"ref92","first-page":"942","article-title":"Stochastic training of graph convolutional networks with variance reduction","volume-title":"Proc. 35th Int. Conf. Mach. Learn.","volume":"80","author":"Chen"},{"key":"ref93","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330925"},{"key":"ref94","first-page":"1","article-title":"GraphSAINT: Graph sampling based inductive learning method","volume-title":"Proc. 8th Int. Conf. Learn. Represent.","author":"Zeng"},{"key":"ref95","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN52387.2021.9533429"},{"key":"ref96","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2019.00056"},{"key":"ref97","doi-asserted-by":"publisher","DOI":"10.1109\/JAS.2021.1004311"},{"key":"ref98","first-page":"1","article-title":"Graph condensation for graph neural networks","volume-title":"Proc. 10th Int. Conf. Learn. Represent.","author":"Jin"},{"key":"ref99","doi-asserted-by":"publisher","DOI":"10.1109\/WACV56688.2023.00645"},{"key":"ref100","first-page":"2224","article-title":"Convolutional networks on graphs for learning molecular fingerprints","volume-title":"Proc. 28th Int. Conf. Neural Inf. Process. Syst.","author":"Duvenaud"},{"key":"ref101","doi-asserted-by":"publisher","DOI":"10.5555\/3327345.3327389"},{"key":"ref102","first-page":"874","article-title":"Spectral clustering with graph neural networks for graph pooling","volume-title":"Proc. Int. Conf. Mach. Learn.","volume":"119","author":"Bianchi"},{"key":"ref103","first-page":"1","article-title":"StructPool: Structured graph pooling via conditional random fields","volume-title":"Proc. 8th Int. Conf. Learn. Represent.","author":"Yuan"},{"key":"ref104","first-page":"1","article-title":"Memory-based graph networks","volume-title":"Proc. 8th Int. Conf. Learn. Represent.","author":"Khasahmadi"},{"key":"ref105","first-page":"2083","article-title":"Graph U-Nets","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Gao"},{"key":"ref106","first-page":"3734","article-title":"Self-attention graph pooling","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Lee"},{"key":"ref107","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380083"},{"key":"ref108","first-page":"1","article-title":"Hierarchical graph pooling with structure learning","volume-title":"Proc. 34th AAAI Conf. Artif. Intell.","author":"Zhang"},{"key":"ref109","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3062794"},{"key":"ref110","first-page":"14093","article-title":"Graph cross networks with vertex infomax pooling","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Li"},{"key":"ref111","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3090664"},{"key":"ref112","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.3044146"},{"key":"ref113","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3067441"},{"key":"ref114","first-page":"377","article-title":"Masked graph auto-encoder constrained graph pooling","volume-title":"Proc. ECML PKDD","author":"Liu"},{"key":"ref115","article-title":"Graph pooling for graph neural networks: Progress, challenges, and opportunities","author":"Liu","year":"2022","journal-title":"arXiv:2204.07321"},{"key":"ref116","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403049"},{"key":"ref117","first-page":"19314","article-title":"Iterative deep graph learning for graph neural networks: Better and robust node embeddings","volume-title":"Proc. NIPS","volume":"33","author":"Chen"},{"key":"ref118","first-page":"22667","article-title":"SLAPS: Self-supervision improves structure learning for graph neural networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"34","author":"Fatemi"},{"key":"ref119","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i4.20335"},{"key":"ref120","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2021.04.025"},{"key":"ref121","article-title":"A survey on graph structure learning: Progress and opportunities","author":"Zhu","year":"2021","journal-title":"arXiv:2103.03036"},{"key":"ref122","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1503.02531"},{"key":"ref123","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00710"},{"key":"ref124","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/320"},{"key":"ref125","first-page":"1","article-title":"Graph-less neural networks: Teaching old MLPs new tricks via distillation","volume-title":"Proc. 10th Int. Conf. Learn. Represent.","author":"Zhang"},{"key":"ref126","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/314"},{"key":"ref127","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-05318-5_3"},{"key":"ref128","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/195"},{"key":"ref129","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00169"},{"key":"ref130","first-page":"7968","article-title":"Large-scale graph neural architecture search","volume-title":"Proc. 39th Int. Conf. Mach. Learn.","author":"Guan"},{"key":"ref131","doi-asserted-by":"publisher","DOI":"10.26599\/TST.2021.9010057"},{"key":"ref132","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/637"},{"key":"ref133","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.00937"},{"key":"ref134","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.00161"}],"container-title":["IEEE Transactions on Neural Networks and Learning Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/5962385\/10707065\/10164013.pdf?arnumber=10164013","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,8]],"date-time":"2024-10-08T17:41:48Z","timestamp":1728409308000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10164013\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10]]},"references-count":134,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tnnls.2023.3282049","relation":{},"ISSN":["2162-237X","2162-2388"],"issn-type":[{"value":"2162-237X","type":"print"},{"value":"2162-2388","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10]]}}}