{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T14:25:12Z","timestamp":1760711112585,"version":"3.28.0"},"reference-count":37,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,12,17]],"date-time":"2022-12-17T00:00:00Z","timestamp":1671235200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,12,17]],"date-time":"2022-12-17T00:00:00Z","timestamp":1671235200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,12,17]]},"DOI":"10.1109\/bigdata55660.2022.10020964","type":"proceedings-article","created":{"date-parts":[[2023,1,26]],"date-time":"2023-01-26T19:35:23Z","timestamp":1674761723000},"page":"931-941","source":"Crossref","is-referenced-by-count":2,"title":["IGRP: Iterative Gradient Rank Pruning for Finding Graph Lottery Ticket"],"prefix":"10.1109","author":[{"given":"Po-Wei","family":"Harn","sequence":"first","affiliation":[{"name":"Auburn University,Computer Science and Software Engineering,Auburn,AL,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sai Deepthi","family":"Yeddula","sequence":"additional","affiliation":[{"name":"Auburn University,Computer Science and Software Engineering,Auburn,AL,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Hui","sequence":"additional","affiliation":[{"name":"Auburn University,Computer Science and Software Engineering,Auburn,AL,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jie","family":"Zhang","sequence":"additional","affiliation":[{"name":"National Central University,Computer Science and Informatin Engineering,Taoyuan,Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Libo","family":"Sun","sequence":"additional","affiliation":[{"name":"Auburn University,Computer Science and Software Engineering,Auburn,AL,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Min-Te","family":"Sun","sequence":"additional","affiliation":[{"name":"National Central University,Computer Science and Informatin Engineering,Taoyuan,Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei-Shinn","family":"Ku","sequence":"additional","affiliation":[{"name":"Auburn University,Computer Science and Software Engineering,Auburn,AL,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Graph attention networks","volume":"abs\/1710.10903","author":"Velickovic","year":"2017","journal-title":"CoRR"},{"key":"ref2","article-title":"Graphmix: Regularized training of graph neural networks for semisupervised learning","volume":"abs\/1909.11715","author":"Verma","year":"2019","journal-title":"CoRR"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00220"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/icde.2013.6544833"},{"key":"ref5","first-page":"5171","article-title":"Link prediction based on graph neural networks","author":"Zhang","year":"2018","journal-title":"NeurIPS"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2625251"},{"key":"ref7","first-page":"4805","article-title":"Hierarchical graph representation learning with differentiable pooling","author":"Ying","year":"2018","journal-title":"NeurIPS"},{"key":"ref8","article-title":"How powerful are graph neural networks?","volume":"abs\/1810.00826","author":"Xu","year":"2018","journal-title":"CoRR"},{"key":"ref9","article-title":"Graph contrastive learning with augmentations","author":"You","year":"2020","journal-title":"NeurIPS"},{"key":"ref10","first-page":"3259","article-title":"Linear mode connectivity and the lottery ticket hypothesis","volume-title":"ICML, ser. Proceedings of Machine Learning Research","volume":"119","author":"Frankle"},{"key":"ref11","article-title":"Learning both weights and connections for efficient neural networks","volume":"abs\/1506.02626","author":"Han","year":"2015","journal-title":"CoRR"},{"key":"ref12","article-title":"Comparing rewinding and finetuning in neural network pruning","author":"Renda","year":"2020","journal-title":"ICLR"},{"key":"ref13","article-title":"The lottery ticket hypothesis for pre-trained BERT networks","author":"Chen","year":"2020","journal-title":"NeurIPS"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i9.16980"},{"key":"ref15","article-title":"Playing the lottery with rewards and multiple languages: lottery tickets in RL and NLP","author":"Yu","year":"2020","journal-title":"ICLR"},{"key":"ref16","first-page":"1695","article-title":"A unified lottery ticket hypothesis for graph neural networks","volume-title":"ICML, ser. Proceedings of Machine Learning Research","volume":"139","author":"Chen"},{"key":"ref17","article-title":"Pruning neural networks without any data by iteratively conserving synaptic flow","author":"Tanaka","year":"2020","journal-title":"NeurIPS"},{"key":"ref18","article-title":"Snip: single-shot network pruning based on connection sensitivity","author":"Lee","year":"2019","journal-title":"ICLR (Poster)"},{"key":"ref19","article-title":"Picking winning tickets before training by preserving gradient flow","author":"Wang","year":"2020","journal-title":"ICLR"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-47426-3_22"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2008.2005605"},{"key":"ref22","article-title":"Spectral networks and locally connected networks on graphs","author":"Bruna","year":"2014","journal-title":"ICLR"},{"key":"ref23","article-title":"Semi-supervised classification with graph convolutional networks","author":"Kipf","year":"2016","journal-title":"CoRR"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.11"},{"key":"ref25","first-page":"1024","article-title":"Inductive representation learning on large graphs","author":"Hamilton","year":"2017","journal-title":"NIPS"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-63823-8_76"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3411882"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2012.2235192"},{"key":"ref29","first-page":"3837","article-title":"Convolutional neural networks on graphs with fast localized spectral filtering","author":"Defferrard","year":"2016","journal-title":"NIPS"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.14778\/3461535.3461547"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.2307\/2695352"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5924"},{"key":"ref33","article-title":"The lottery ticket hypothesis: Finding sparse, trainable neural networks","author":"Frankle","year":"2019","journal-title":"ICLR"},{"key":"ref34","first-page":"4933","article-title":"One ticket to win them all: generalizing lottery ticket initializations across datasets and optimizers","author":"Morcos","year":"2019","journal-title":"NeurIPS"},{"key":"ref35","first-page":"3592","article-title":"Deconstructing lottery tickets: Zeros, signs, and the supermask","author":"Zhou","year":"2019","journal-title":"NeurIPS"},{"key":"ref36","article-title":"Wiki-cs: A wikipedia-based benchmark for graph neural networks","volume":"abs\/2007.02901","author":"Mernyei","year":"2020","journal-title":"CoRR"},{"key":"ref37","article-title":"Open graph benchmark: Datasets for machine learning on graphs","author":"Hu","year":"2020","journal-title":"NeurIPS"}],"event":{"name":"2022 IEEE International Conference on Big Data (Big Data)","start":{"date-parts":[[2022,12,17]]},"location":"Osaka, Japan","end":{"date-parts":[[2022,12,20]]}},"container-title":["2022 IEEE International Conference on Big Data (Big Data)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10020192\/10020156\/10020964.pdf?arnumber=10020964","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,13]],"date-time":"2024-02-13T06:43:13Z","timestamp":1707806593000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10020964\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,17]]},"references-count":37,"URL":"https:\/\/doi.org\/10.1109\/bigdata55660.2022.10020964","relation":{},"subject":[],"published":{"date-parts":[[2022,12,17]]}}}