{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T10:06:54Z","timestamp":1774951614757,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":53,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,8,14]],"date-time":"2021-08-14T00:00:00Z","timestamp":1628899200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Army Research Office (ARO)","award":["W911NF-21-1-0198"],"award-info":[{"award-number":["W911NF-21-1-0198"]}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1909702, IIS1955851"],"award-info":[{"award-number":["IIS-1909702, IIS1955851"]}],"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,8,14]]},"DOI":"10.1145\/3447548.3467451","type":"proceedings-article","created":{"date-parts":[[2021,8,12]],"date-time":"2021-08-12T06:12:08Z","timestamp":1628748728000},"page":"1894-1903","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":49,"title":["Learning How to Propagate Messages in Graph Neural Networks"],"prefix":"10.1145","author":[{"given":"Teng","family":"Xiao","sequence":"first","affiliation":[{"name":"Westlake University & The Pennsylvania State University, Hangzhou, China"}]},{"given":"Zhengyu","family":"Chen","sequence":"additional","affiliation":[{"name":"Westlake University & Zhejiang University, Hangzhou, China"}]},{"given":"Donglin","family":"Wang","sequence":"additional","affiliation":[{"name":"Westlake University, Hangzhou, China"}]},{"given":"Suhang","family":"Wang","sequence":"additional","affiliation":[{"name":"The Pennsylvania State University, State College, PA, USA"}]}],"member":"320","published-online":{"date-parts":[[2021,8,14]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Mark Schmidt, and Frank Wood.","author":"Baydin Atilim Gunes","year":"2018","unstructured":"Atilim Gunes Baydin , Robert Cornish , David Martinez Rubio , Mark Schmidt, and Frank Wood. 2018 a. Online Learning Rate Adaptation with Hypergradient Descent. In ICLR. Atilim Gunes Baydin, Robert Cornish, David Martinez Rubio, Mark Schmidt, and Frank Wood. 2018a. Online Learning Rate Adaptation with Hypergradient Descent. In ICLR."},{"key":"e_1_3_2_1_2_1","volume-title":"Alexey Andreyevich Radul, and Jeffrey Mark Siskind","author":"Baydin Atilim Gunes","year":"2018","unstructured":"Atilim Gunes Baydin , Barak A Pearlmutter , Alexey Andreyevich Radul, and Jeffrey Mark Siskind . 2018 b. Automatic differentiation in machine learning: a survey. JMLR ( 2018). Atilim Gunes Baydin, Barak A Pearlmutter, Alexey Andreyevich Radul, and Jeffrey Mark Siskind. 2018b. Automatic differentiation in machine learning: a survey. JMLR (2018)."},{"key":"e_1_3_2_1_3_1","volume-title":"Variational inference: A review for statisticians. Journal of the American statistical Association","author":"Blei David M","year":"2017","unstructured":"David M Blei , Alp Kucukelbir , and Jon D McAuliffe . 2017. Variational inference: A review for statisticians. Journal of the American statistical Association ( 2017 ). David M Blei, Alp Kucukelbir, and Jon D McAuliffe. 2017. Variational inference: A review for statisticians. Journal of the American statistical Association (2017)."},{"key":"e_1_3_2_1_4_1","unstructured":"Joan Bruna Wojciech Zaremba Arthur Szlam and Yann LeCun. 2014. Spectral networks and deep locally connected networks on graphs. In ICLR.  Joan Bruna Wojciech Zaremba Arthur Szlam and Yann LeCun. 2014. Spectral networks and deep locally connected networks on graphs. In ICLR."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Deli Chen Yankai Lin Wei Li Peng Li Jie Zhou and Xu Sun. 2020 a. Measuring and relieving the over-smoothing problem for graph neural networks from the topological view. In AAAI.  Deli Chen Yankai Lin Wei Li Peng Li Jie Zhou and Xu Sun. 2020 a. Measuring and relieving the over-smoothing problem for graph neural networks from the topological view. In AAAI.","DOI":"10.1609\/aaai.v34i04.5747"},{"key":"e_1_3_2_1_6_1","unstructured":"Jie Chen Tengfei Ma and Cao Xiao. 2018. FastGCN: Fast Learning with Graph Convolutional Networks via Importance Sampling. In ICLR.  Jie Chen Tengfei Ma and Cao Xiao. 2018. FastGCN: Fast Learning with Graph Convolutional Networks via Importance Sampling. In ICLR."},{"key":"e_1_3_2_1_7_1","unstructured":"Ming Chen Zhewei Wei Zengfeng Huang Bolin Ding and Yaliang Li. 2020 b. Simple and deep graph convolutional networks. In ICML.  Ming Chen Zhewei Wei Zengfeng Huang Bolin Ding and Yaliang Li. 2020 b. Simple and deep graph convolutional networks. In ICML."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Zhengyu Chen JiXie Ge Heshen Zhan Siteng Huang and Donglin Wang. 2021 a. Pareto Self-Supervised Training for Few-Shot Learning. In CVPR.  Zhengyu Chen JiXie Ge Heshen Zhan Siteng Huang and Donglin Wang. 2021 a. Pareto Self-Supervised Training for Few-Shot Learning. In CVPR.","DOI":"10.1109\/CVPR46437.2021.01345"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Zhengyu Chen and Donglin Wang. 2021. Multi-Initialization Meta-Learning with Domain Adaptation. In ICASSP.  Zhengyu Chen and Donglin Wang. 2021. Multi-Initialization Meta-Learning with Domain Adaptation. In ICASSP.","DOI":"10.1109\/ICASSP39728.2021.9414554"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Zhengyu Chen Ziqing Xu and Donglin Wang. 2021 b. Deep transfer tensor decomposition with orthogonal constraint for recommender systems. In AAAI.  Zhengyu Chen Ziqing Xu and Donglin Wang. 2021 b. Deep transfer tensor decomposition with orthogonal constraint for recommender systems. In AAAI.","DOI":"10.1609\/aaai.v35i5.16521"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Enyan Dai and Suhang Wang. 2021. Say No to the Discrimination: Learning Fair Graph Neural Networks with Limited Sensitive Attribute Information. In WSDM.  Enyan Dai and Suhang Wang. 2021. Say No to the Discrimination: Learning Fair Graph Neural Networks with Limited Sensitive Attribute Information. In WSDM.","DOI":"10.1145\/3437963.3441752"},{"key":"e_1_3_2_1_12_1","unstructured":"Micha\u00ebl Defferrard Xavier Bresson and Pierre Vandergheynst. 2016. Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering. In NIPS.  Micha\u00ebl Defferrard Xavier Bresson and Pierre Vandergheynst. 2016. Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering. In NIPS."},{"key":"e_1_3_2_1_13_1","volume-title":"NeurIPS","volume":"33","author":"Feng Wenzheng","year":"2020","unstructured":"Wenzheng Feng , Jie Zhang , Yuxiao Dong , Yu Han , Huanbo Luan , Qian Xu , Qiang Yang , Evgeny Kharlamov , and Jie Tang . 2020 . Graph Random Neural Networks for Semi-Supervised Learning on Graphs . NeurIPS , Vol. 33 (2020). Wenzheng Feng, Jie Zhang, Yuxiao Dong, Yu Han, Huanbo Luan, Qian Xu, Qiang Yang, Evgeny Kharlamov, and Jie Tang. 2020. Graph Random Neural Networks for Semi-Supervised Learning on Graphs. NeurIPS, Vol. 33 (2020)."},{"key":"e_1_3_2_1_14_1","unstructured":"Chelsea Finn Pieter Abbeel and Sergey Levine. 2017. Model-agnostic meta-learning for fast adaptation of deep networks. In ICML.  Chelsea Finn Pieter Abbeel and Sergey Levine. 2017. Model-agnostic meta-learning for fast adaptation of deep networks. In ICML."},{"key":"e_1_3_2_1_15_1","unstructured":"Luca Franceschi Paolo Frasconi Saverio Salzo Riccardo Grazzi and Massimiliano Pontil. 2018. Bilevel programming for hyperparameter optimization and meta-learning. In ICML.  Luca Franceschi Paolo Frasconi Saverio Salzo Riccardo Grazzi and Massimiliano Pontil. 2018. Bilevel programming for hyperparameter optimization and meta-learning. In ICML."},{"key":"e_1_3_2_1_16_1","unstructured":"Luca Franceschi Mathias Niepert Massimiliano Pontil and Xiao He. 2019. Learning discrete structures for graph neural networks. In ICML.  Luca Franceschi Mathias Niepert Massimiliano Pontil and Xiao He. 2019. Learning discrete structures for graph neural networks. In ICML."},{"key":"e_1_3_2_1_17_1","volume-title":"Graphnas: Graph neural architecture search with reinforcement learning. arXiv","author":"Gao Yang","year":"2019","unstructured":"Yang Gao , Hong Yang , Peng Zhang , Chuan Zhou , and Yue Hu . 2019 . Graphnas: Graph neural architecture search with reinforcement learning. arXiv (2019). Yang Gao, Hong Yang, Peng Zhang, Chuan Zhou, and Yue Hu. 2019. Graphnas: Graph neural architecture search with reinforcement learning. arXiv (2019)."},{"key":"e_1_3_2_1_18_1","unstructured":"William L Hamilton Rex Ying and Jure Leskovec. 2017. Inductive representation learning on large graphs. In NeurIPS.  William L Hamilton Rex Ying and Jure Leskovec. 2017. Inductive representation learning on large graphs. In NeurIPS."},{"key":"e_1_3_2_1_19_1","volume-title":"The\" wake-sleep\" algorithm for unsupervised neural networks. Science","author":"Hinton Geoffrey E","year":"1995","unstructured":"Geoffrey E Hinton , Peter Dayan , Brendan J Frey , and Radford M Neal . 1995. The\" wake-sleep\" algorithm for unsupervised neural networks. Science ( 1995 ). Geoffrey E Hinton, Peter Dayan, Brendan J Frey, and Radford M Neal. 1995. The\" wake-sleep\" algorithm for unsupervised neural networks. Science (1995)."},{"key":"e_1_3_2_1_20_1","volume":"202","author":"Hwang Dasol","unstructured":"Dasol Hwang , Jinyoung Park , Sunyoung Kwon , KyungMin Kim , Jung-Woo Ha , and Hyunwoo J Kim. 202 0. Self-supervised Auxiliary Learning with Meta-paths for Heterogeneous Graphs. In NeurIPS. 10294--10305. Dasol Hwang, Jinyoung Park, Sunyoung Kwon, KyungMin Kim, Jung-Woo Ha, and Hyunwoo J Kim. 2020. Self-supervised Auxiliary Learning with Meta-paths for Heterogeneous Graphs. In NeurIPS. 10294--10305.","journal-title":"Hyunwoo J Kim."},{"key":"e_1_3_2_1_21_1","volume-title":"Categorical reparameterization with gumbel-softmax. arXiv","author":"Jang Eric","year":"2016","unstructured":"Eric Jang , Shixiang Gu , and Ben Poole . 2016. Categorical reparameterization with gumbel-softmax. arXiv ( 2016 ). Eric Jang, Shixiang Gu, and Ben Poole. 2016. Categorical reparameterization with gumbel-softmax. arXiv (2016)."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Wei Jin Tyler Derr Yiqi Wang Yao Ma Zitao Liu and Jiliang Tang. 2021. Node Similarity Preserving Graph Convolutional Networks. In WSDM.  Wei Jin Tyler Derr Yiqi Wang Yao Ma Zitao Liu and Jiliang Tang. 2021. Node Similarity Preserving Graph Convolutional Networks. In WSDM.","DOI":"10.1145\/3437963.3441735"},{"key":"e_1_3_2_1_23_1","unstructured":"Mohammad Khan Shakir Mohamed Benjamin Marlin and Kevin Murphy. 2012. A stick-breaking likelihood for categorical data analysis with latent Gaussian models. In AISTATS.  Mohammad Khan Shakir Mohamed Benjamin Marlin and Kevin Murphy. 2012. A stick-breaking likelihood for categorical data analysis with latent Gaussian models. In AISTATS."},{"key":"e_1_3_2_1_24_1","volume-title":"Auto-encoding variational bayes. arXiv","author":"Kingma Diederik P","year":"2013","unstructured":"Diederik P Kingma and Max Welling . 2013. Auto-encoding variational bayes. arXiv ( 2013 ). Diederik P Kingma and Max Welling. 2013. Auto-encoding variational bayes. arXiv (2013)."},{"key":"e_1_3_2_1_25_1","unstructured":"Thomas N. Kipf and Max Welling. [n.d.]. Semi-Supervised Classification with Graph Convolutional Networks. In ICLR.  Thomas N. Kipf and Max Welling. [n.d.]. Semi-Supervised Classification with Graph Convolutional Networks. In ICLR."},{"key":"e_1_3_2_1_26_1","unstructured":"Johannes Klicpera Aleksandar Bojchevski and Stephan G\u00fc nnemann. 2019. Predict then Propagate: Graph Neural Networks meet Personalized PageRank. In ICLR.  Johannes Klicpera Aleksandar Bojchevski and Stephan G\u00fc nnemann. 2019. Predict then Propagate: Graph Neural Networks meet Personalized PageRank. In ICLR."},{"key":"e_1_3_2_1_27_1","volume-title":"Deepgcns: Can gcns go as deep as cnns?. In ICCV.","author":"Li Guohao","year":"2019","unstructured":"Guohao Li , Matthias Muller , Ali Thabet , and Bernard Ghanem . 2019 . Deepgcns: Can gcns go as deep as cnns?. In ICCV. Guohao Li, Matthias Muller, Ali Thabet, and Bernard Ghanem. 2019. Deepgcns: Can gcns go as deep as cnns?. In ICCV."},{"key":"e_1_3_2_1_28_1","unstructured":"Qimai Li Zhichao Han and Xiao-Ming Wu. 2018. Deeper insights into graph convolutional networks for semi-supervised learning. In AAAI.  Qimai Li Zhichao Han and Xiao-Ming Wu. 2018. Deeper insights into graph convolutional networks for semi-supervised learning. In AAAI."},{"key":"e_1_3_2_1_29_1","volume-title":"Darts: Differentiable architecture search. arXiv preprint arXiv:1806.09055","author":"Liu Hanxiao","year":"2018","unstructured":"Hanxiao Liu , Karen Simonyan , and Yiming Yang . 2018 . Darts: Differentiable architecture search. arXiv preprint arXiv:1806.09055 (2018). Hanxiao Liu, Karen Simonyan, and Yiming Yang. 2018. Darts: Differentiable architecture search. arXiv preprint arXiv:1806.09055 (2018)."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","unstructured":"Zemin Liu Wentao Zhang Yuan Fang Xinming Zhang and Steven CH Hoi. 2020. Towards locality-aware meta-learning of tail node embeddings on networks. In CIKM.  Zemin Liu Wentao Zhang Yuan Fang Xinming Zhang and Steven CH Hoi. 2020. Towards locality-aware meta-learning of tail node embeddings on networks. In CIKM.","DOI":"10.1145\/3340531.3411910"},{"key":"e_1_3_2_1_31_1","unstructured":"Dougal Maclaurin David Duvenaud and Ryan Adams. 2015. Gradient-based hyperparameter optimization through reversible learning. In ICML.  Dougal Maclaurin David Duvenaud and Ryan Adams. 2015. Gradient-based hyperparameter optimization through reversible learning. In ICML."},{"key":"e_1_3_2_1_32_1","volume-title":"The concrete distribution: A continuous relaxation of discrete random variables. arXiv","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 ( 2016 ). Chris J Maddison, Andriy Mnih, and Yee Whye Teh. 2016. The concrete distribution: A continuous relaxation of discrete random variables. arXiv (2016)."},{"key":"e_1_3_2_1_33_1","volume":"201","author":"Mohamed Shakir","unstructured":"Shakir Mohamed and Danilo J Rezende. 201 5. Variational information maximisation for intrinsically motivated reinforcement learning. In NIPS. Shakir Mohamed and Danilo J Rezende. 2015. Variational information maximisation for intrinsically motivated reinforcement learning. In NIPS.","journal-title":"Danilo J Rezende."},{"key":"e_1_3_2_1_34_1","volume-title":"Assortative mixing in networks. Physical review letters","author":"Newman Mark EJ","year":"2002","unstructured":"Mark EJ Newman . 2002. Assortative mixing in networks. Physical review letters ( 2002 ). Mark EJ Newman. 2002. Assortative mixing in networks. Physical review letters (2002)."},{"key":"e_1_3_2_1_35_1","unstructured":"Kenta Oono and Taiji Suzuki. 2019. Graph Neural Networks Exponentially Lose Expressive Power for Node Classification. In ICLR.  Kenta Oono and Taiji Suzuki. 2019. Graph Neural Networks Exponentially Lose Expressive Power for Node Classification. In ICLR."},{"key":"e_1_3_2_1_36_1","volume-title":"Yu Lei, and Bo Yang.","author":"Pei Hongbin","year":"2019","unstructured":"Hongbin Pei , Bingzhe Wei , Kevin Chen-Chuan Chang , Yu Lei, and Bo Yang. 2019 . Geom-GCN: Geometric Graph Convolutional Networks. In ICLR. Hongbin Pei, Bingzhe Wei, Kevin Chen-Chuan Chang, Yu Lei, and Bo Yang. 2019. Geom-GCN: Geometric Graph Convolutional Networks. In ICLR."},{"key":"e_1_3_2_1_37_1","unstructured":"Yu Rong Wenbing Huang Tingyang Xu and Junzhou Huang. 2020. DropEdge: Towards Deep Graph Convolutional Networks on Node Classification. In ICLR.  Yu Rong Wenbing Huang Tingyang Xu and Junzhou Huang. 2020. DropEdge: Towards Deep Graph Convolutional Networks on Node Classification. In ICLR."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"crossref","unstructured":"Xianfeng Tang Huaxiu Yao Yiwei Sun Yiqi Wang Jiliang Tang Charu C. Aggarwal Prasenjit Mitra and Suhang Wang. 2020. Investigating and Mitigating Degree-Related Biases in Graph Convoltuional Networks. In CIKM.  Xianfeng Tang Huaxiu Yao Yiwei Sun Yiqi Wang Jiliang Tang Charu C. Aggarwal Prasenjit Mitra and Suhang Wang. 2020. Investigating and Mitigating Degree-Related Biases in Graph Convoltuional Networks. In CIKM.","DOI":"10.1145\/3340531.3411872"},{"key":"e_1_3_2_1_39_1","unstructured":"Petar Velickovic Guillem Cucurull Arantxa Casanova Adriana Romero Pietro Li\u00f2 and Yoshua Bengio. 2018. Graph Attention Networks. In ICLR.  Petar Velickovic Guillem Cucurull Arantxa Casanova Adriana Romero Pietro Li\u00f2 and Yoshua Bengio. 2018. Graph Attention Networks. In ICLR."},{"key":"e_1_3_2_1_40_1","unstructured":"Felix Wu Amauri Souza Tianyi Zhang Christopher Fifty Tao Yu and Kilian Weinberger. 2019. Simplifying graph convolutional networks. In ICML.  Felix Wu Amauri Souza Tianyi Zhang Christopher Fifty Tao Yu and Kilian Weinberger. 2019. Simplifying graph convolutional networks. In ICML."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"crossref","unstructured":"Teng Xiao Shangsong Liang and Zaiqiao Meng. 2019 a. Hierarchical neural variational model for personalized sequential recommendation. In WWW.  Teng Xiao Shangsong Liang and Zaiqiao Meng. 2019 a. Hierarchical neural variational model for personalized sequential recommendation. In WWW.","DOI":"10.1145\/3308558.3313603"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"crossref","unstructured":"Teng Xiao Shangsong Liang Weizhou Shen and Zaiqiao Meng. 2019 b. Bayesian deep collaborative matrix factorization. In AAAI.  Teng Xiao Shangsong Liang Weizhou Shen and Zaiqiao Meng. 2019 b. Bayesian deep collaborative matrix factorization. In AAAI.","DOI":"10.1609\/aaai.v33i01.33015474"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"crossref","unstructured":"Teng Xiao and Donglin Wang. 2021. A general offline reinforcement learning framework for interactive recommendation. In AAAI.  Teng Xiao and Donglin Wang. 2021. A general offline reinforcement learning framework for interactive recommendation. In AAAI.","DOI":"10.1609\/aaai.v35i5.16579"},{"key":"e_1_3_2_1_45_1","unstructured":"Keyulu Xu Chengtao Li Yonglong Tian Tomohiro Sonobe Ken-ichi Kawarabayashi and Stefanie Jegelka. 2018. Representation learning on graphs with jumping knowledge networks. In ICML.  Keyulu Xu Chengtao Li Yonglong Tian Tomohiro Sonobe Ken-ichi Kawarabayashi and Stefanie Jegelka. 2018. Representation learning on graphs with jumping knowledge networks. In ICML."},{"key":"e_1_3_2_1_46_1","unstructured":"Zhilin Yang William Cohen and Ruslan Salakhudinov. 2016. Revisiting semi-supervised learning with graph embeddings. In ICML.  Zhilin Yang William Cohen and Ruslan Salakhudinov. 2016. Revisiting semi-supervised learning with graph embeddings. In ICML."},{"key":"e_1_3_2_1_47_1","unstructured":"Lingxiao Zhao and Leman Akoglu. 2019. PairNorm: Tackling Oversmoothing in GNNs. In ICLR.  Lingxiao Zhao and Leman Akoglu. 2019. PairNorm: Tackling Oversmoothing in GNNs. In ICLR."},{"key":"e_1_3_2_1_48_1","unstructured":"Tianxiang Zhao Xiang Zhang and Suhang Wang. 2021. GraphSMOTE: Imbalanced Node Classification on Graphs with Graph Neural Networks. In WSDM.  Tianxiang Zhao Xiang Zhang and Suhang Wang. 2021. GraphSMOTE: Imbalanced Node Classification on Graphs with Graph Neural Networks. In WSDM."},{"key":"e_1_3_2_1_49_1","volume-title":"On Learning Intrinsic Rewards for Policy Gradient Methods. NIPS","author":"Zheng Zeyu","year":"2018","unstructured":"Zeyu Zheng , Junhyuk Oh , and Satinder Singh . 2018. On Learning Intrinsic Rewards for Policy Gradient Methods. NIPS ( 2018 ). Zeyu Zheng, Junhyuk Oh, and Satinder Singh. 2018. On Learning Intrinsic Rewards for Policy Gradient Methods. NIPS (2018)."},{"key":"e_1_3_2_1_50_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. In NeurIPS.  Kaixiong Zhou Xiao Huang Yuening Li Daochen Zha Rui Chen and Xia Hu. 2020. Towards Deeper Graph Neural Networks with Differentiable Group Normalization. In NeurIPS."},{"key":"e_1_3_2_1_51_1","volume-title":"Auto-gnn: Neural architecture search of graph neural networks. arXiv preprint arXiv:1909.03184","author":"Zhou Kaixiong","year":"2019","unstructured":"Kaixiong Zhou , Qingquan Song , Xiao Huang , and Xia Hu . 2019 . Auto-gnn: Neural architecture search of graph neural networks. arXiv preprint arXiv:1909.03184 (2019). Kaixiong Zhou, Qingquan Song, Xiao Huang, and Xia Hu. 2019. Auto-gnn: Neural architecture search of graph neural networks. arXiv preprint arXiv:1909.03184 (2019)."},{"key":"e_1_3_2_1_52_1","volume-title":"Beyond Homophily in Graph Neural Networks: Current Limitations and Effective Designs. NeurIPS","author":"Zhu Jiong","year":"2020","unstructured":"Jiong Zhu , Yujun Yan , Lingxiao Zhao , Mark Heimann , Leman Akoglu , and Danai Koutra . 2020. Beyond Homophily in Graph Neural Networks: Current Limitations and Effective Designs. NeurIPS ( 2020 ). Jiong Zhu, Yujun Yan, Lingxiao Zhao, Mark Heimann, Leman Akoglu, and Danai Koutra. 2020. Beyond Homophily in Graph Neural Networks: Current Limitations and Effective Designs. NeurIPS (2020)."},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"crossref","unstructured":"Daniel Z\u00fcgner and Stephan G\u00fcnnemann. 2018. Adversarial Attacks on Graph Neural Networks via Meta Learning. In ICLR.  Daniel Z\u00fcgner and Stephan G\u00fcnnemann. 2018. Adversarial Attacks on Graph Neural Networks via Meta Learning. In ICLR.","DOI":"10.24963\/ijcai.2019\/872"}],"event":{"name":"KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Virtual Event Singapore","acronym":"KDD '21","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3447548.3467451","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3447548.3467451","content-type":"text\/html","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3447548.3467451","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3447548.3467451","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:18:37Z","timestamp":1750191517000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3447548.3467451"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,14]]},"references-count":53,"alternative-id":["10.1145\/3447548.3467451","10.1145\/3447548"],"URL":"https:\/\/doi.org\/10.1145\/3447548.3467451","relation":{},"subject":[],"published":{"date-parts":[[2021,8,14]]},"assertion":[{"value":"2021-08-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}