{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,21]],"date-time":"2026-10-21T16:16:16Z","timestamp":1792599376360,"version":"4.5.0"},"publisher-location":"New York, NY, USA","reference-count":54,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T00:00:00Z","timestamp":1650844800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,4,25]]},"DOI":"10.1145\/3487553.3524725","type":"proceedings-article","created":{"date-parts":[[2022,8,16]],"date-time":"2022-08-16T22:41:30Z","timestamp":1660689690000},"page":"1128-1138","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Understanding Dropout for Graph Neural Networks"],"prefix":"10.1145","author":[{"given":"Juan","family":"Shu","sequence":"first","affiliation":[{"name":"Department of statistics, Purdue University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bowei","family":"Xi","sequence":"additional","affiliation":[{"name":"Department of statistics, Purdue University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yu","family":"Li","sequence":"additional","affiliation":[{"name":"Computer Science &amp; Engineering, Chinese University of Hong Kong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fan","family":"Wu","sequence":"additional","affiliation":[{"name":"Department of statistics, Purdue University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Charles","family":"Kamhoua","sequence":"additional","affiliation":[{"name":"US Army Research Laboratory, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jianzhu","family":"Ma","sequence":"additional","affiliation":[{"name":"Institute for artificial intelligence, Peking University, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,8,16]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.inffus.2021.05.008"},{"key":"e_1_3_2_1_2_1","volume-title":"Error and attack tolerance of complex networks. nature 406, 6794","author":"Albert R\u00e9ka","year":"2000","unstructured":"R\u00e9ka Albert , Hawoong Jeong , and Albert-L\u00e1szl\u00f3 Barab\u00e1si . 2000. Error and attack tolerance of complex networks. nature 406, 6794 ( 2000 ), 378\u2013382. R\u00e9ka Albert, Hawoong Jeong, and Albert-L\u00e1szl\u00f3 Barab\u00e1si. 2000. Error and attack tolerance of complex networks. nature 406, 6794 (2000), 378\u2013382."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579166"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(85)90092-9"},{"key":"e_1_3_2_1_5_1","volume-title":"Network science","author":"Barab\u00e1si Albert-L\u00e1szl\u00f3","unstructured":"Albert-L\u00e1szl\u00f3 Barab\u00e1si and M\u00e1rton P\u00f3sfai . 2016. Network science . Cambridge University Press , Cambridge . http:\/\/barabasi.com\/networksciencebook\/ Albert-L\u00e1szl\u00f3 Barab\u00e1si and M\u00e1rton P\u00f3sfai. 2016. Network science. Cambridge University Press, Cambridge. http:\/\/barabasi.com\/networksciencebook\/"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.3389\/fphy.2020.00228"},{"key":"e_1_3_2_1_7_1","unstructured":"Joan Bruna Wojciech Zaremba Arthur Szlam and Yann LeCun. 2014. Spectral Networks and Locally Connected Networks on Graphs. arxiv:1312.6203\u00a0[cs.LG] Joan Bruna Wojciech Zaremba Arthur Szlam and Yann LeCun. 2014. Spectral Networks and Locally Connected Networks on Graphs. arxiv:1312.6203\u00a0[cs.LG]"},{"key":"e_1_3_2_1_8_1","unstructured":"Chen Cai and Yusu Wang. 2020. A Note on Over-Smoothing for Graph Neural Networks. arxiv:2006.13318\u00a0[cs.LG] Chen Cai and Yusu Wang. 2020. A Note on Over-Smoothing for Graph Neural Networks. arxiv:2006.13318\u00a0[cs.LG]"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5747"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5747"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480103438589"},{"key":"e_1_3_2_1_12_1","unstructured":"Jie Chen Tengfei Ma and Cao Xiao. 2018. FastGCN: Fast Learning with Graph Convolutional Networks via Importance Sampling. arxiv:1801.10247\u00a0[cs.LG] Jie Chen Tengfei Ma and Cao Xiao. 2018. FastGCN: Fast Learning with Graph Convolutional Networks via Importance Sampling. arxiv:1801.10247\u00a0[cs.LG]"},{"key":"e_1_3_2_1_13_1","unstructured":"Jianfei Chen Jun Zhu and Le Song. 2018. Stochastic Training of Graph Convolutional Networks with Variance Reduction. arxiv:1710.10568\u00a0[stat.ML] Jianfei Chen Jun Zhu and Le Song. 2018. Stochastic Training of Graph Convolutional Networks with Variance Reduction. arxiv:1710.10568\u00a0[stat.ML]"},{"key":"e_1_3_2_1_14_1","volume-title":"International Conference on Machine Learning. PMLR, 1725\u20131735","author":"Chen Ming","year":"2020","unstructured":"Ming Chen , Zhewei Wei , Zengfeng Huang , Bolin Ding , and Yaliang Li . 2020 . Simple and deep graph convolutional networks . In International Conference on Machine Learning. PMLR, 1725\u20131735 . Ming Chen, Zhewei Wei, Zengfeng Huang, Bolin Ding, and Yaliang Li. 2020. Simple and deep graph convolutional networks. In International Conference on Machine Learning. PMLR, 1725\u20131735."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330925"},{"key":"e_1_3_2_1_16_1","unstructured":"Fan\u00a0RK Chung and Fan\u00a0Chung Graham. 1997. Spectral graph theory. Number\u00a092. American Mathematical Soc. Fan\u00a0RK Chung and Fan\u00a0Chung Graham. 1997. Spectral graph theory. Number\u00a092. American Mathematical Soc."},{"key":"e_1_3_2_1_17_1","unstructured":"Yarin Gal and Zoubin Ghahramani. 2015. Bayesian convolutional neural networks with Bernoulli approximate variational inference. arXiv preprint arXiv:1506.02158(2015). Yarin Gal and Zoubin Ghahramani. 2015. Bayesian convolutional neural networks with Bernoulli approximate variational inference. arXiv preprint arXiv:1506.02158(2015)."},{"key":"e_1_3_2_1_18_1","volume-title":"international conference on machine learning. PMLR, 1050\u20131059","author":"Gal Yarin","year":"2016","unstructured":"Yarin Gal and Zoubin Ghahramani . 2016 . Dropout as a bayesian approximation: Representing model uncertainty in deep learning . In international conference on machine learning. PMLR, 1050\u20131059 . Yarin Gal and Zoubin Ghahramani. 2016. Dropout as a bayesian approximation: Representing model uncertainty in deep learning. In international conference on machine learning. PMLR, 1050\u20131059."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449828"},{"key":"e_1_3_2_1_20_1","unstructured":"Golnaz Ghiasi Tsung-Yi Lin and Quoc\u00a0V. Le. 2018. DropBlock: A regularization method for convolutional networks. arxiv:1810.12890\u00a0[cs.CV] Golnaz Ghiasi Tsung-Yi Lin and Quoc\u00a0V. Le. 2018. DropBlock: A regularization method for convolutional networks. arxiv:1810.12890\u00a0[cs.CV]"},{"key":"e_1_3_2_1_21_1","volume-title":"Web Page Classification Based on Graph Neural Network. In International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing. Springer, 188\u2013198","author":"Guo Tao","year":"2021","unstructured":"Tao Guo and Baojiang Cui . 2021 . Web Page Classification Based on Graph Neural Network. In International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing. Springer, 188\u2013198 . Tao Guo and Baojiang Cui. 2021. Web Page Classification Based on Graph Neural Network. In International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing. Springer, 188\u2013198."},{"key":"e_1_3_2_1_22_1","volume-title":"Proceedings of the 31st International Conference on Neural Information Processing Systems. 1025\u20131035","author":"Hamilton L","year":"2017","unstructured":"William\u00a0 L Hamilton , Rex Ying , and Jure Leskovec . 2017 . Inductive representation learning on large graphs . In Proceedings of the 31st International Conference on Neural Information Processing Systems. 1025\u20131035 . William\u00a0L Hamilton, Rex Ying, and Jure Leskovec. 2017. Inductive representation learning on large graphs. In Proceedings of the 31st International Conference on Neural Information Processing Systems. 1025\u20131035."},{"key":"e_1_3_2_1_23_1","unstructured":"Geoffrey\u00a0E. Hinton Nitish Srivastava Alex Krizhevsky Ilya Sutskever and Ruslan\u00a0R. Salakhutdinov. 2012. Improving neural networks by preventing co-adaptation of feature detectors. arxiv:1207.0580\u00a0[cs.NE] Geoffrey\u00a0E. Hinton Nitish Srivastava Alex Krizhevsky Ilya Sutskever and Ruslan\u00a0R. Salakhutdinov. 2012. Improving neural networks by preventing co-adaptation of feature detectors. arxiv:1207.0580\u00a0[cs.NE]"},{"key":"e_1_3_2_1_24_1","unstructured":"Wenbing Huang Tong Zhang Yu Rong and Junzhou Huang. 2018. Adaptive sampling towards fast graph representation learning. arXiv preprint arXiv:1809.05343(2018). Wenbing Huang Tong Zhang Yu Rong and Junzhou Huang. 2018. Adaptive sampling towards fast graph representation learning. arXiv preprint arXiv:1809.05343(2018)."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cnsns.2013.04.030"},{"key":"e_1_3_2_1_26_1","unstructured":"Thomas\u00a0N Kipf and Max Welling. 2016. Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907(2016). Thomas\u00a0N Kipf and Max Welling. 2016. Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907(2016)."},{"key":"e_1_3_2_1_27_1","unstructured":"Balaji Lakshminarayanan Alexander Pritzel and Charles Blundell. 2016. Simple and scalable predictive uncertainty estimation using deep ensembles. arXiv preprint arXiv:1612.01474(2016). Balaji Lakshminarayanan Alexander Pritzel and Charles Blundell. 2016. Simple and scalable predictive uncertainty estimation using deep ensembles. arXiv preprint arXiv:1612.01474(2016)."},{"key":"e_1_3_2_1_28_1","unstructured":"Balaji Lakshminarayanan Alexander Pritzel and Charles Blundell. 2017. Simple and Scalable Predictive Uncertainty Estimation using Deep Ensembles. arxiv:1612.01474\u00a0[stat.ML] Balaji Lakshminarayanan Alexander Pritzel and Charles Blundell. 2017. Simple and Scalable Predictive Uncertainty Estimation using Deep Ensembles. arxiv:1612.01474\u00a0[stat.ML]"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00926"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46448-0_8"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(89)90029-4"},{"key":"e_1_3_2_1_32_1","unstructured":"Will Norcliffe-Brown Efstathios Vafeias and Sarah Parisot. 2018. Learning Conditioned Graph Structures for Interpretable Visual Question Answering. arxiv:1806.07243\u00a0[cs.CV] Will Norcliffe-Brown Efstathios Vafeias and Sarah Parisot. 2018. Learning Conditioned Graph Structures for Interpretable Visual Question Answering. arxiv:1806.07243\u00a0[cs.CV]"},{"key":"e_1_3_2_1_33_1","unstructured":"Kenta Oono and Taiji Suzuki. 2019. Graph neural networks exponentially lose expressive power for node classification. arXiv preprint arXiv:1905.10947(2019). Kenta Oono and Taiji Suzuki. 2019. Graph neural networks exponentially lose expressive power for node classification. arXiv preprint arXiv:1905.10947(2019)."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/1953048.2078195"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220077"},{"key":"e_1_3_2_1_36_1","volume-title":"Practical High-Quality Electrostatic Potential Surfaces for Drug Discovery Using a Graph-Convolutional Deep Neural Network. Journal of Medicinal Chemistry (09","author":"Rathi Prakash","year":"2019","unstructured":"Prakash Rathi , Fred Ludlow , and Marcel Verdonk . 2019. Practical High-Quality Electrostatic Potential Surfaces for Drug Discovery Using a Graph-Convolutional Deep Neural Network. Journal of Medicinal Chemistry (09 2019 ). https:\/\/doi.org\/10.1021\/acs.jmedchem.9b01129 10.1021\/acs.jmedchem.9b01129 Prakash Rathi, Fred Ludlow, and Marcel Verdonk. 2019. Practical High-Quality Electrostatic Potential Surfaces for Drug Discovery Using a Graph-Convolutional Deep Neural Network. Journal of Medicinal Chemistry (09 2019). https:\/\/doi.org\/10.1021\/acs.jmedchem.9b01129"},{"key":"e_1_3_2_1_37_1","volume-title":"Dropedge: Towards deep graph convolutional networks on node classification. arXiv preprint arXiv:1907.10903(2019).","author":"Rong Yu","year":"2019","unstructured":"Yu Rong , Wenbing Huang , Tingyang Xu , and Junzhou Huang . 2019 . Dropedge: Towards deep graph convolutional networks on node classification. arXiv preprint arXiv:1907.10903(2019). Yu Rong, Wenbing Huang, Tingyang Xu, and Junzhou Huang. 2019. Dropedge: Towards deep graph convolutional networks on node classification. arXiv preprint arXiv:1907.10903(2019)."},{"key":"e_1_3_2_1_38_1","volume-title":"Robustness of network controllability under edge removal","author":"Ruths Justin","unstructured":"Justin Ruths and Derek Ruths . 2013. Robustness of network controllability under edge removal . In Complex Networks IV. Springer , 185\u2013193. Justin Ruths and Derek Ruths. 2013. Robustness of network controllability under edge removal. In Complex Networks IV. Springer, 185\u2013193."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2008.2005605"},{"key":"e_1_3_2_1_40_1","volume-title":"Ivan Titov, and Max Welling.","author":"Schlichtkrull Michael","year":"2018","unstructured":"Michael Schlichtkrull , Thomas\u00a0 N Kipf , Peter Bloem , Rianne Van Den\u00a0Berg , Ivan Titov, and Max Welling. 2018 . Modeling relational data with graph convolutional networks. In European semantic web conference. Springer , 593\u2013607. Michael Schlichtkrull, Thomas\u00a0N Kipf, Peter Bloem, Rianne Van Den\u00a0Berg, Ivan Titov, and Max Welling. 2018. Modeling relational data with graph convolutional networks. In European semantic web conference. Springer, 593\u2013607."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v29i3.2157"},{"key":"e_1_3_2_1_42_1","volume-title":"Dropout: a simple way to prevent neural networks from overfitting. The journal of machine learning research 15, 1","author":"Srivastava Nitish","year":"2014","unstructured":"Nitish Srivastava , Geoffrey Hinton , Alex Krizhevsky , Ilya Sutskever , and Ruslan Salakhutdinov . 2014. Dropout: a simple way to prevent neural networks from overfitting. The journal of machine learning research 15, 1 ( 2014 ), 1929\u20131958. Nitish Srivastava, Geoffrey Hinton, Alex Krizhevsky, Ilya Sutskever, and Ruslan Salakhutdinov. 2014. Dropout: a simple way to prevent neural networks from overfitting. The journal of machine learning research 15, 1 (2014), 1929\u20131958."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298664"},{"key":"e_1_3_2_1_44_1","unstructured":"Petar Veli\u010dkovi\u0107 Guillem Cucurull Arantxa Casanova Adriana Romero Pietro Li\u00f2 and Yoshua Bengio. 2018. Graph Attention Networks. arxiv:1710.10903\u00a0[stat.ML] Petar Veli\u010dkovi\u0107 Guillem Cucurull Arantxa Casanova Adriana Romero Pietro Li\u00f2 and Yoshua Bengio. 2018. Graph Attention Networks. arxiv:1710.10903\u00a0[stat.ML]"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3450133"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-26532-2_6"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"crossref","unstructured":"Yongji Wu Defu Lian Shuowei Jin and Enhong Chen. 2019. Graph Convolutional Networks on User Mobility Heterogeneous Graphs for Social Relationship Inference.. In IJCAI. 3898\u20133904. Yongji Wu Defu Lian Shuowei Jin and Enhong Chen. 2019. Graph Convolutional Networks on User Mobility Heterogeneous Graphs for Social Relationship Inference.. In IJCAI. 3898\u20133904.","DOI":"10.24963\/ijcai.2019\/541"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN52387.2021.9533748"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219890"},{"key":"e_1_3_2_1_50_1","unstructured":"Jason Yosinski Jeff Clune Yoshua Bengio and Hod Lipson. 2014. How transferable are features in deep neural networks?arXiv preprint arXiv:1411.1792(2014). Jason Yosinski Jeff Clune Yoshua Bengio and Hod Lipson. 2014. How transferable are features in deep neural networks?arXiv preprint arXiv:1411.1792(2014)."},{"key":"e_1_3_2_1_51_1","volume-title":"Graphsaint: Graph sampling based inductive learning method. arXiv preprint arXiv:1907.04931(2019).","author":"Zeng Hanqing","year":"2019","unstructured":"Hanqing Zeng , Hongkuan Zhou , Ajitesh Srivastava , Rajgopal Kannan , and Viktor Prasanna . 2019 . Graphsaint: Graph sampling based inductive learning method. arXiv preprint arXiv:1907.04931(2019). Hanqing Zeng, Hongkuan Zhou, Ajitesh Srivastava, Rajgopal Kannan, and Viktor Prasanna. 2019. Graphsaint: Graph sampling based inductive learning method. arXiv preprint arXiv:1907.04931(2019)."},{"key":"e_1_3_2_1_52_1","unstructured":"Lingxiao Zhao and Leman Akoglu. 2020. PairNorm: Tackling Oversmoothing in GNNs. arxiv:1909.12223\u00a0[cs.LG] Lingxiao Zhao and Leman Akoglu. 2020. PairNorm: Tackling Oversmoothing in GNNs. arxiv:1909.12223\u00a0[cs.LG]"},{"key":"e_1_3_2_1_53_1","unstructured":"Kaixiong Zhou Xiao Huang Yuening Li Daochen Zha Rui Chen and Xia Hu. 2020. Towards deeper graph neural networks with differentiable group normalization. arXiv preprint arXiv:2006.06972(2020). Kaixiong Zhou Xiao Huang Yuening Li Daochen Zha Rui Chen and Xia Hu. 2020. Towards deeper graph neural networks with differentiable group normalization. arXiv preprint arXiv:2006.06972(2020)."},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btx252"}],"event":{"name":"WWW '22: The ACM Web Conference 2022","location":"Virtual Event, Lyon France","acronym":"WWW '22","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Companion Proceedings of the Web Conference 2022"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3487553.3524725","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3487553.3524725","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:30:23Z","timestamp":1750188623000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3487553.3524725"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,25]]},"references-count":54,"alternative-id":["10.1145\/3487553.3524725","10.1145\/3487553"],"URL":"https:\/\/doi.org\/10.1145\/3487553.3524725","relation":{},"subject":[],"published":{"date-parts":[[2022,4,25]]},"assertion":[{"value":"2022-08-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}