{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T15:10:42Z","timestamp":1775229042468,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":57,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,3,8]],"date-time":"2021-03-08T00:00:00Z","timestamp":1615161600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["IIS-1707548,CBET-1638320"],"award-info":[{"award-number":["IIS-1707548,CBET-1638320"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,3,8]]},"DOI":"10.1145\/3437963.3441734","type":"proceedings-article","created":{"date-parts":[[2021,3,6]],"date-time":"2021-03-06T04:36:17Z","timestamp":1615005377000},"page":"779-787","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":197,"title":["Learning to Drop: Robust Graph Neural Network via Topological Denoising"],"prefix":"10.1145","author":[{"given":"Dongsheng","family":"Luo","sequence":"first","affiliation":[{"name":"Pennsylvania State University, State College, PA, USA"}]},{"given":"Wei","family":"Cheng","sequence":"additional","affiliation":[{"name":"NEC Laboratories America, Princeton, NJ, USA"}]},{"given":"Wenchao","family":"Yu","sequence":"additional","affiliation":[{"name":"NEC Laboratories America, Princeton, NJ, USA"}]},{"given":"Bo","family":"Zong","sequence":"additional","affiliation":[{"name":"NEC Laboratories America, Princeton, NJ, USA"}]},{"given":"Jingchao","family":"Ni","sequence":"additional","affiliation":[{"name":"NEC Laboratories America, Princeton, NJ, USA"}]},{"given":"Haifeng","family":"Chen","sequence":"additional","affiliation":[{"name":"NEC Laboratories America, Princeton, NJ, USA"}]},{"given":"Xiang","family":"Zhang","sequence":"additional","affiliation":[{"name":"Pennsylvania State University, State College, PA, USA"}]}],"member":"320","published-online":{"date-parts":[[2021,3,8]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Raman Arora and Jalaj Upadhyay. 2019. On Differentially Private Graph Sparsification and Applications. In NeurIPS . 13378--13389.  Raman Arora and Jalaj Upadhyay. 2019. On Differentially Private Graph Sparsification and Applications. In NeurIPS . 13378--13389."},{"key":"e_1_3_2_1_2_1","volume-title":"STOC","volume":"96","author":"Bencz\u00far Andr\u00e1s A","year":"1996","unstructured":"Andr\u00e1s A Bencz\u00far and David R Karger . 1996 . Approximating st Minimum Cuts in O (n2) Time .. In STOC , Vol. 96 . Citeseer, 47--55. Andr\u00e1s A Bencz\u00far and David R Karger. 1996. Approximating st Minimum Cuts in O (n2) Time.. In STOC, Vol. 96. Citeseer, 47--55."},{"key":"e_1_3_2_1_3_1","volume-title":"Estimating or propagating gradients through stochastic neurons for conditional computation. arXiv preprint arXiv:1308.3432","author":"Bengio Yoshua","year":"2013","unstructured":"Yoshua Bengio , Nicholas L\u00e9onard , and Aaron Courville . 2013. Estimating or propagating gradients through stochastic neurons for conditional computation. arXiv preprint arXiv:1308.3432 ( 2013 ). Yoshua Bengio, Nicholas L\u00e9onard, and Aaron Courville. 2013. Estimating or propagating gradients through stochastic neurons for conditional computation. arXiv preprint arXiv:1308.3432 (2013)."},{"key":"e_1_3_2_1_4_1","volume-title":"Spectral networks and locally connected networks on graphs. arXiv preprint arXiv:1312.6203","author":"Bruna Joan","year":"2013","unstructured":"Joan Bruna , Wojciech Zaremba , Arthur Szlam , and Yann LeCun . 2013. Spectral networks and locally connected networks on graphs. arXiv preprint arXiv:1312.6203 ( 2013 ). Joan Bruna, Wojciech Zaremba, Arthur Szlam, and Yann LeCun. 2013. Spectral networks and locally connected networks on graphs. arXiv preprint arXiv:1312.6203 (2013)."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Andrew Carlson Justin Betteridge Bryan Kisiel Burr Settles Estevam R Hruschka and Tom M Mitchell. 2010. Toward an architecture for never-ending language learning. In AAAI .  Andrew Carlson Justin Betteridge Bryan Kisiel Burr Settles Estevam R Hruschka and Tom M Mitchell. 2010. Toward an architecture for never-ending language learning. In AAAI .","DOI":"10.1609\/aaai.v24i1.7519"},{"key":"e_1_3_2_1_6_1","volume-title":"Fastgcn: fast learning with graph convolutional networks via importance sampling. arXiv preprint arXiv:1801.10247","author":"Chen Jie","year":"2018","unstructured":"Jie Chen , Tengfei Ma , and Cao Xiao . 2018. Fastgcn: fast learning with graph convolutional networks via importance sampling. arXiv preprint arXiv:1801.10247 ( 2018 ). Jie Chen, Tengfei Ma, and Cao Xiao. 2018. Fastgcn: fast learning with graph convolutional networks via importance sampling. arXiv preprint arXiv:1801.10247 (2018)."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(89)90044-5"},{"key":"e_1_3_2_1_8_1","unstructured":"JJ David. 1995. Algorithms for analysis and design of robust controllers. (1995).  JJ David. 1995. Algorithms for analysis and design of robust controllers. (1995)."},{"key":"e_1_3_2_1_9_1","unstructured":"Micha\u00ebl Defferrard Xavier Bresson and Pierre Vandergheynst. 2016. Convolutional neural networks on graphs with fast localized spectral filtering. In NIPS . 3844--3852.  Micha\u00ebl Defferrard Xavier Bresson and Pierre Vandergheynst. 2016. Convolutional neural networks on graphs with fast localized spectral filtering. In NIPS . 3844--3852."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Talya Eden Shweta Jain Ali Pinar Dana Ron and C Seshadhri. 2018. Provable and practical approximations for the degree distribution using sublinear graph samples. In WWW. 449--458.  Talya Eden Shweta Jain Ali Pinar Dana Ron and C Seshadhri. 2018. Provable and practical approximations for the degree distribution using sublinear graph samples. In WWW. 449--458.","DOI":"10.1145\/3178876.3186111"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Negin Entezari Saba Al-Sayouri Amirali Darvishzadeh and Evangelos Papalexakis. 2020. All You Need is Low (Rank): Defending Against Adversarial Attacks on Graphs. In WSDM. ACM.  Negin Entezari Saba Al-Sayouri Amirali Darvishzadeh and Evangelos Papalexakis. 2020. All You Need is Low (Rank): Defending Against Adversarial Attacks on Graphs. In WSDM. ACM.","DOI":"10.1145\/3336191.3371789"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.37.11.760"},{"key":"e_1_3_2_1_13_1","volume-title":"Community detection in graphs. CoRR","author":"Fortunato Santo","year":"2009","unstructured":"Santo Fortunato . 2009. Community detection in graphs. CoRR , Vol. abs\/ 0906 .0612 ( 2009 ). Santo Fortunato. 2009. Community detection in graphs. CoRR , Vol. abs\/0906.0612 (2009)."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1090\/mcom\/3239"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1162\/089976698300017269"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2005.1555942"},{"key":"e_1_3_2_1_17_1","unstructured":"Will Hamilton Zhitao Ying and Jure Leskovec. 2017. Inductive representation learning on large graphs. In NIPS. 1024--1034.  Will Hamilton Zhitao Ying and Jure Leskovec. 2017. Inductive representation learning on large graphs. In NIPS. 1024--1034."},{"key":"e_1_3_2_1_18_1","volume-title":"A Unifying Framework for Spectrum-Preserving Graph Sparsification and Coarsening. arXiv preprint arXiv:1902.09702","author":"Hermsdorff Gecia Bravo","year":"2019","unstructured":"Gecia Bravo Hermsdorff and Lee M Gunderson . 2019. A Unifying Framework for Spectrum-Preserving Graph Sparsification and Coarsening. arXiv preprint arXiv:1902.09702 ( 2019 ). Gecia Bravo Hermsdorff and Lee M Gunderson. 2019. A Unifying Framework for Spectrum-Preserving Graph Sparsification and Coarsening. arXiv preprint arXiv:1902.09702 (2019)."},{"key":"e_1_3_2_1_19_1","unstructured":"Yifan Hou Jian Zhang James Cheng Kaili Ma Richard T. B. Ma Hongzhi Chen and Ming-Chang Yang. 2020. Measuring and Improving the Use of Graph Information in Graph Neural Networks. In ICLR .  Yifan Hou Jian Zhang James Cheng Kaili Ma Richard T. B. Ma Hongzhi Chen and Ming-Chang Yang. 2020. Measuring and Improving the Use of Graph Information in Graph Neural Networks. In ICLR ."},{"key":"e_1_3_2_1_20_1","unstructured":"Wenbing Huang Tong Zhang Yu Rong and Junzhou Huang. 2018. Adaptive sampling towards fast graph representation learning. In NeurIPS . 4558--4567.  Wenbing Huang Tong Zhang Yu Rong and Junzhou Huang. 2018. Adaptive sampling towards fast graph representation learning. In NeurIPS . 4558--4567."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"Catalin Ionescu Orestis Vantzos and Cristian Sminchisescu. 2015. Matrix backpropagation for deep networks with structured layers. In ICCV . 2965--2973.  Catalin Ionescu Orestis Vantzos and Cristian Sminchisescu. 2015. Matrix backpropagation for deep networks with structured layers. In ICCV . 2965--2973.","DOI":"10.1109\/ICCV.2015.339"},{"key":"e_1_3_2_1_22_1","volume-title":"Categorical reparameterization with gumbel-softmax. arXiv preprint arXiv:1611.01144","author":"Jang Eric","year":"2016","unstructured":"Eric Jang , Shixiang Gu , and Ben Poole . 2016. Categorical reparameterization with gumbel-softmax. arXiv preprint arXiv:1611.01144 ( 2016 ). Eric Jang, Shixiang Gu, and Ben Poole. 2016. Categorical reparameterization with gumbel-softmax. arXiv preprint arXiv:1611.01144 (2016)."},{"key":"e_1_3_2_1_23_1","volume-title":"Graph Structure Learning for Robust Graph Neural Networks. arXiv preprint arXiv:2005.10203","author":"Jin Wei","year":"2020","unstructured":"Wei Jin , Yao Ma , Xiaorui Liu , Xianfeng Tang , Suhang Wang , and Jiliang Tang . 2020. Graph Structure Learning for Robust Graph Neural Networks. arXiv preprint arXiv:2005.10203 ( 2020 ). Wei Jin, Yao Ma, Xiaorui Liu, Xianfeng Tang, Suhang Wang, and Jiliang Tang. 2020. Graph Structure Learning for Robust Graph Neural Networks. arXiv preprint arXiv:2005.10203 (2020)."},{"key":"e_1_3_2_1_24_1","volume-title":"Low-rank Sparse Decomposition of Graph Adjacency Matrices for Extracting Clean Clusters","author":"Kanada Taiju","unstructured":"Taiju Kanada , Masaki Onuki , and Yuichi Tanaka . 2018. Low-rank Sparse Decomposition of Graph Adjacency Matrices for Extracting Clean Clusters . In APSIPA ASC. IEEE , 1153--1159. Taiju Kanada, Masaki Onuki, and Yuichi Tanaka. 2018. Low-rank Sparse Decomposition of Graph Adjacency Matrices for Extracting Clean Clusters. In APSIPA ASC. IEEE, 1153--1159."},{"key":"e_1_3_2_1_25_1","volume-title":"Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907","author":"Kipf Thomas N","year":"2016","unstructured":"Thomas N Kipf and Max Welling . 2016a. Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907 ( 2016 ). Thomas N Kipf and Max Welling. 2016a. Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907 (2016)."},{"key":"e_1_3_2_1_26_1","volume-title":"Variational graph auto-encoders. arXiv preprint arXiv:1611.07308","author":"Kipf Thomas N","year":"2016","unstructured":"Thomas N Kipf and Max Welling . 2016b. Variational graph auto-encoders. arXiv preprint arXiv:1611.07308 ( 2016 ). Thomas N Kipf and Max Welling. 2016b. Variational graph auto-encoders. arXiv preprint arXiv:1611.07308 (2016)."},{"key":"e_1_3_2_1_27_1","unstructured":"Qimai Li Zhichao Han and Xiao-Ming Wu. 2018a. Deeper insights into graph convolutional networks for semi-supervised learning. In AAAI .  Qimai Li Zhichao Han and Xiao-Ming Wu. 2018a. Deeper insights into graph convolutional networks for semi-supervised learning. In AAAI ."},{"key":"e_1_3_2_1_28_1","unstructured":"Ruoyu Li Sheng Wang Feiyun Zhu and Junzhou Huang. 2018b. Adaptive graph convolutional neural networks. In AAAI .  Ruoyu Li Sheng Wang Feiyun Zhu and Junzhou Huang. 2018b. Adaptive graph convolutional neural networks. In AAAI ."},{"key":"e_1_3_2_1_29_1","volume-title":"Learning Sparse Neural Networks through $ L_0 $ Regularization. arXiv preprint arXiv:1712.01312","author":"Louizos Christos","year":"2017","unstructured":"Christos Louizos , Max Welling , and Diederik P Kingma . 2017. Learning Sparse Neural Networks through $ L_0 $ Regularization. arXiv preprint arXiv:1712.01312 ( 2017 ). Christos Louizos, Max Welling, and Diederik P Kingma. 2017. Learning Sparse Neural Networks through $ L_0 $ Regularization. arXiv preprint arXiv:1712.01312 (2017)."},{"key":"e_1_3_2_1_30_1","unstructured":"Andreas Loukas. 2020. What graph neural networks cannot learn: depth vs width. In ICLR .  Andreas Loukas. 2020. What graph neural networks cannot learn: depth vs width. In ICLR ."},{"key":"e_1_3_2_1_31_1","unstructured":"Jianxin Ma Peng Cui Kun Kuang Xin Wang and Wenwu Zhu. 2019. Disentangled Graph Convolutional Networks. In ICML. 4212--4221.  Jianxin Ma Peng Cui Kun Kuang Xin Wang and Wenwu Zhu. 2019. Disentangled Graph Convolutional Networks. In ICML. 4212--4221."},{"key":"e_1_3_2_1_32_1","volume-title":"The concrete distribution: A continuous relaxation of discrete random variables. arXiv preprint arXiv:1611.00712","author":"Maddison Chris J","year":"2016","unstructured":"Chris J Maddison , Andriy Mnih , and Yee Whye Teh . 2016. The concrete distribution: A continuous relaxation of discrete random variables. arXiv preprint arXiv:1611.00712 ( 2016 ). Chris J Maddison, Andriy Mnih, and Yee Whye Teh. 2016. The concrete distribution: A continuous relaxation of discrete random variables. arXiv preprint arXiv:1611.00712 (2016)."},{"key":"e_1_3_2_1_33_1","volume-title":"Neural variational inference and learning in belief networks. arXiv preprint arXiv:1402.0030","author":"Mnih Andriy","year":"2014","unstructured":"Andriy Mnih and Karol Gregor . 2014. Neural variational inference and learning in belief networks. arXiv preprint arXiv:1402.0030 ( 2014 ). Andriy Mnih and Karol Gregor. 2014. Neural variational inference and learning in belief networks. arXiv preprint arXiv:1402.0030 (2014)."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1137\/120876605"},{"key":"e_1_3_2_1_35_1","unstructured":"Jingchao Ni Shiyu Chang Xiao Liu Wei Cheng Haifeng Chen Dongkuan Xu and Xiang Zhang. 2018. Co-regularized deep multi-network embedding. In WWW .  Jingchao Ni Shiyu Chang Xiao Liu Wei Cheng Haifeng Chen Dongkuan Xu and Xiang Zhang. 2018. Co-regularized deep multi-network embedding. In WWW ."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"crossref","unstructured":"James M Ortega. 1990. Numerical analysis: a second course .SIAM.  James M Ortega. 1990. Numerical analysis: a second course .SIAM.","DOI":"10.1137\/1.9781611971323"},{"key":"e_1_3_2_1_37_1","series-title":"SIAM review","volume-title":"Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization","author":"Recht Benjamin","year":"2010","unstructured":"Benjamin Recht , Maryam Fazel , and Pablo A Parrilo . 2010. Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization . SIAM review , Vol. 52 , 3 ( 2010 ), 471--501. Benjamin Recht, Maryam Fazel, and Pablo A Parrilo. 2010. Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM review , Vol. 52, 3 (2010), 471--501."},{"key":"e_1_3_2_1_38_1","volume-title":"DropEdge: Towards Deep Graph Convolutional Networks on Node Classification. ICLR","author":"Rong Yu","year":"2020","unstructured":"Yu Rong , Wenbing Huang , Tingyang Xu , and Junzhou Huang . 2020. DropEdge: Towards Deep Graph Convolutional Networks on Node Classification. ICLR ( 2020 ). Yu Rong, Wenbing Huang, Tingyang Xu, and Junzhou Huang. 2020. DropEdge: Towards Deep Graph Convolutional Networks on Node Classification. ICLR (2020)."},{"key":"e_1_3_2_1_39_1","first-page":"61","article-title":"The graph neural network model","volume":"20","author":"Scarselli Franco","year":"2008","unstructured":"Franco Scarselli , Marco Gori , Ah Chung Tsoi , Markus Hagenbuchner , and Gabriele Monfardini . 2008 . The graph neural network model . IEEE TNN , Vol. 20 , 1 (2008), 61 -- 80 . Franco Scarselli, Marco Gori, Ah Chung Tsoi, Markus Hagenbuchner, and Gabriele Monfardini. 2008. The graph neural network model. IEEE TNN , Vol. 20, 1 (2008), 61--80.","journal-title":"IEEE TNN"},{"key":"e_1_3_2_1_40_1","volume-title":"Collective classification in network data. AI magazine","author":"Sen Prithviraj","year":"2008","unstructured":"Prithviraj Sen , Galileo Namata , Mustafa Bilgic , Lise Getoor , Brian Galligher , and Tina Eliassi-Rad . 2008. Collective classification in network data. AI magazine , Vol. 29 , 3 ( 2008 ), 93--93. Prithviraj Sen, Galileo Namata, Mustafa Bilgic, Lise Getoor, Brian Galligher, and Tina Eliassi-Rad. 2008. Collective classification in network data. AI magazine , Vol. 29, 3 (2008), 93--93."},{"key":"e_1_3_2_1_41_1","volume-title":"Sweg: Lossless and lossy summarization of web-scale graphs. In WWW. ACM, 1679--1690.","author":"Shin Kijung","year":"2019","unstructured":"Kijung Shin , Amol Ghoting , Myunghwan Kim , and Hema Raghavan . 2019 . Sweg: Lossless and lossy summarization of web-scale graphs. In WWW. ACM, 1679--1690. Kijung Shin, Amol Ghoting, Myunghwan Kim, and Hema Raghavan. 2019. Sweg: Lossless and lossy summarization of web-scale graphs. In WWW. ACM, 1679--1690."},{"key":"e_1_3_2_1_42_1","volume-title":"Essa Yacoub, Kamil Ugurbil","author":"Van Essen David C","year":"2013","unstructured":"David C Van Essen , Stephen M Smith , Deanna M Barch , Timothy EJ Behrens , Essa Yacoub, Kamil Ugurbil , Wu-Minn HCP Consortium , et almbox. 2013 . The WU-Minn human connectome project: an overview. Neuroimage (2013). David C Van Essen, Stephen M Smith, Deanna M Barch, Timothy EJ Behrens, Essa Yacoub, Kamil Ugurbil, Wu-Minn HCP Consortium, et almbox. 2013. The WU-Minn human connectome project: an overview. Neuroimage (2013)."},{"key":"e_1_3_2_1_43_1","volume-title":"Graph attention networks. arXiv preprint arXiv:1710.10903","author":"Petar Velivc","year":"2017","unstructured":"Petar Velivc kovi\u0107 , Guillem Cucurull , Arantxa Casanova , Adriana Romero , Pietro Lio , and Yoshua Bengio . 2017. Graph attention networks. arXiv preprint arXiv:1710.10903 ( 2017 ). Petar Velivc kovi\u0107 , Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Lio, and Yoshua Bengio. 2017. Graph attention networks. arXiv preprint arXiv:1710.10903 (2017)."},{"key":"e_1_3_2_1_44_1","volume-title":"Uncovering Hierarchical Structure in Social Networks using Isospectral Reductions. arXiv preprint arXiv:1801.03385","author":"Wang Chi-Jen","year":"2017","unstructured":"Chi-Jen Wang , Seokjoo Chae , Leonid A Bunimovich , and Benjamin Z Webb . 2017. Uncovering Hierarchical Structure in Social Networks using Isospectral Reductions. arXiv preprint arXiv:1801.03385 ( 2017 ). Chi-Jen Wang, Seokjoo Chae, Leonid A Bunimovich, and Benjamin Z Webb. 2017. Uncovering Hierarchical Structure in Social Networks using Isospectral Reductions. arXiv preprint arXiv:1801.03385 (2017)."},{"key":"e_1_3_2_1_45_1","volume-title":"2019 b. Learning Robust Representations with Graph Denoising Policy Network","author":"Wang Lu","year":"2019","unstructured":"Lu Wang , Wenchao Yu , Wei Wang , Wei Cheng , Wei Zhang , Hongyuan Zha , Xiaofeng He , and Haifeng Chen . 2019 b. Learning Robust Representations with Graph Denoising Policy Network . IEEE ICDM ( 2019 ). Lu Wang, Wenchao Yu, Wei Wang, Wei Cheng, Wei Zhang, Hongyuan Zha, Xiaofeng He, and Haifeng Chen. 2019 b. Learning Robust Representations with Graph Denoising Policy Network. IEEE ICDM (2019)."},{"key":"e_1_3_2_1_46_1","unstructured":"Lichen Wang Bo Zong Qianqian Ma Wei Cheng Jingchao Ni Wenchao Yu Yanchi Liu Dongjin Dong and Haifeng Chen. 2020. Inductive and Unsupervised Representation Learning on Graph Structured Objects. In ICLR .  Lichen Wang Bo Zong Qianqian Ma Wei Cheng Jingchao Ni Wenchao Yu Yanchi Liu Dongjin Dong and Haifeng Chen. 2020. Inductive and Unsupervised Representation Learning on Graph Structured Objects. In ICLR ."},{"key":"e_1_3_2_1_47_1","unstructured":"Wei Wang Zheng Dang Yinlin Hu Pascal Fua and Mathieu Salzmann. 2019 a. Backpropagation-Friendly Eigendecomposition. In NeurIPS. 3156--3164.  Wei Wang Zheng Dang Yinlin Hu Pascal Fua and Mathieu Salzmann. 2019 a. Backpropagation-Friendly Eigendecomposition. In NeurIPS. 3156--3164."},{"key":"e_1_3_2_1_48_1","volume-title":"Simple statistical gradient-following algorithms for connectionist reinforcement learning. Machine learning","author":"Williams Ronald J","year":"1992","unstructured":"Ronald J Williams . 1992. Simple statistical gradient-following algorithms for connectionist reinforcement learning. Machine learning , Vol. 8 , 3--4 ( 1992 ), 229--256. Ronald J Williams. 1992. Simple statistical gradient-following algorithms for connectionist reinforcement learning. Machine learning , Vol. 8, 3--4 (1992), 229--256."},{"key":"e_1_3_2_1_49_1","volume-title":"How powerful are graph neural networks? arXiv preprint arXiv:1810.00826","author":"Xu Keyulu","year":"2018","unstructured":"Keyulu Xu , Weihua Hu , Jure Leskovec , and Stefanie Jegelka . 2018. How powerful are graph neural networks? arXiv preprint arXiv:1810.00826 ( 2018 ). Keyulu Xu, Weihua Hu, Jure Leskovec, and Stefanie Jegelka. 2018. How powerful are graph neural networks? arXiv preprint arXiv:1810.00826 (2018)."},{"key":"e_1_3_2_1_50_1","volume-title":"6th World Congress on Global Optimization .","author":"Xue F","year":"2020","unstructured":"F Xue and J Xin . 2020 . Learning Sparse Neural Networks via l0 and l1 by a Relaxed Variable Splitting Method with Application to Multi-scale Curve Classification . In 6th World Congress on Global Optimization . F Xue and J Xin. 2020. Learning Sparse Neural Networks via l0 and l1 by a Relaxed Variable Splitting Method with Application to Multi-scale Curve Classification. In 6th World Congress on Global Optimization ."},{"key":"e_1_3_2_1_51_1","volume-title":"Revisiting semi-supervised learning with graph embeddings. arXiv preprint arXiv:1603.08861","author":"Yang Zhilin","year":"2016","unstructured":"Zhilin Yang , William W Cohen , and Ruslan Salakhutdinov . 2016. Revisiting semi-supervised learning with graph embeddings. arXiv preprint arXiv:1603.08861 ( 2016 ). Zhilin Yang, William W Cohen, and Ruslan Salakhutdinov. 2016. Revisiting semi-supervised learning with graph embeddings. arXiv preprint arXiv:1603.08861 (2016)."},{"key":"e_1_3_2_1_52_1","unstructured":"Hanqing Zeng Hongkuan Zhou Ajitesh Srivastava Rajgopal Kannan and Viktor Prasanna. 2020. GraphSAINT: Graph Sampling Based Inductive Learning Method. In ICLR .  Hanqing Zeng Hongkuan Zhou Ajitesh Srivastava Rajgopal Kannan and Viktor Prasanna. 2020. GraphSAINT: Graph Sampling Based Inductive Learning Method. In ICLR ."},{"key":"e_1_3_2_1_53_1","volume-title":"Adaptive Structural Fingerprints For Graph Attention Networks. ICLR","author":"Zhang Kai","year":"2020","unstructured":"Kai Zhang , Yaokang Zhu , Jun Wang , and Jie Zhang . 2020. Adaptive Structural Fingerprints For Graph Attention Networks. ICLR ( 2020 ). Kai Zhang, Yaokang Zhu, Jun Wang, and Jie Zhang. 2020. Adaptive Structural Fingerprints For Graph Attention Networks. ICLR (2020)."},{"key":"e_1_3_2_1_54_1","volume-title":"Deep learning on graphs: A survey. arXiv preprint arXiv:1812.04202","author":"Zhang Ziwei","year":"2018","unstructured":"Ziwei Zhang , Peng Cui , and Wenwu Zhu . 2018. Deep learning on graphs: A survey. arXiv preprint arXiv:1812.04202 ( 2018 ). Ziwei Zhang, Peng Cui, and Wenwu Zhu. 2018. Deep learning on graphs: A survey. arXiv preprint arXiv:1812.04202 (2018)."},{"key":"e_1_3_2_1_55_1","volume-title":"PairNorm: Tackling Oversmoothing in GNNs. arXiv preprint arXiv:1909.12223","author":"Zhao Lingxiao","year":"2019","unstructured":"Lingxiao Zhao and Leman Akoglu . 2019. PairNorm: Tackling Oversmoothing in GNNs. arXiv preprint arXiv:1909.12223 ( 2019 ). Lingxiao Zhao and Leman Akoglu. 2019. PairNorm: Tackling Oversmoothing in GNNs. arXiv preprint arXiv:1909.12223 (2019)."},{"key":"e_1_3_2_1_56_1","unstructured":"Cheng Zheng Bo Zong Wei Cheng Dongjin Song Jingchao Ni Wenchao Yu Haifeng Chen and Wei Wang. 2020. Robust Graph Representation Learning via Neural Sparsification. In ICML .  Cheng Zheng Bo Zong Wei Cheng Dongjin Song Jingchao Ni Wenchao Yu Haifeng Chen and Wei Wang. 2020. Robust Graph Representation Learning via Neural Sparsification. In ICML ."},{"key":"e_1_3_2_1_57_1","volume-title":"Graph neural networks: A review of methods and applications. arXiv preprint arXiv:1812.08434","author":"Zhou Jie","year":"2018","unstructured":"Jie Zhou , Ganqu Cui , Zhengyan Zhang , Cheng Yang , Zhiyuan Liu , Lifeng Wang , Changcheng Li , and Maosong Sun . 2018. Graph neural networks: A review of methods and applications. arXiv preprint arXiv:1812.08434 ( 2018 ). Jie Zhou, Ganqu Cui, Zhengyan Zhang, Cheng Yang, Zhiyuan Liu, Lifeng Wang, Changcheng Li, and Maosong Sun. 2018. Graph neural networks: A review of methods and applications. arXiv preprint arXiv:1812.08434 (2018)."}],"event":{"name":"WSDM '21: The Fourteenth ACM International Conference on Web Search and Data Mining","location":"Virtual Event Israel","acronym":"WSDM '21","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 14th ACM International Conference on Web Search and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3437963.3441734","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3437963.3441734","content-type":"text\/html","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3437963.3441734","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3437963.3441734","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:47:34Z","timestamp":1750193254000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3437963.3441734"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,8]]},"references-count":57,"alternative-id":["10.1145\/3437963.3441734","10.1145\/3437963"],"URL":"https:\/\/doi.org\/10.1145\/3437963.3441734","relation":{},"subject":[],"published":{"date-parts":[[2021,3,8]]},"assertion":[{"value":"2021-03-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}