{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T06:10:54Z","timestamp":1769753454605,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":52,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,5,13]],"date-time":"2024-05-13T00:00:00Z","timestamp":1715558400000},"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":[[2024,5,13]]},"DOI":"10.1145\/3589334.3645583","type":"proceedings-article","created":{"date-parts":[[2024,5,8]],"date-time":"2024-05-08T07:08:13Z","timestamp":1715152093000},"page":"803-814","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Cross-Space Adaptive Filter: Integrating Graph Topology and Node Attributes for Alleviating the Over-smoothing Problem"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3542-7085","authenticated-orcid":false,"given":"Chen","family":"Huang","sequence":"first","affiliation":[{"name":"Sichuan University, Chengdu, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3544-5563","authenticated-orcid":false,"given":"Haoyang","family":"Li","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5719-772X","authenticated-orcid":false,"given":"Yifan","family":"Zhang","sequence":"additional","affiliation":[{"name":"Vanderbilt University, Nashville, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6540-0601","authenticated-orcid":false,"given":"Wenqiang","family":"Lei","sequence":"additional","affiliation":[{"name":"Sichuan University, Chengdu, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6551-3884","authenticated-orcid":false,"given":"Jiancheng","family":"Lv","sequence":"additional","affiliation":[{"name":"Sichuan University, Chengdu, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,5,13]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"Muhammet Balcilar Renton Guillaume Pierre H\u00e9roux Benoit Ga\u00fcz\u00e8re S\u00e9bastien Adam and Paul Honeine. 2021. Analyzing the Expressive Power of Graph Neural Networks in a Spectral Perspective. In ICLR."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i5.16514"},{"key":"e_1_3_2_2_3_1","volume-title":"International Conference on Machine Learning. PMLR, 884--893","author":"Cutajar Kurt","year":"2017","unstructured":"Kurt Cutajar, Edwin V Bonilla, Pietro Michiardi, and Maurizio Filippone. 2017. Random feature expansions for deep Gaussian processes. In International Conference on Machine Learning. PMLR, 884--893."},{"key":"e_1_3_2_2_4_1","volume-title":"Methods for the combination of kernel matrices within a support vector framework. Machine learning","author":"de Diego Isaac Mart'in","year":"2010","unstructured":"Isaac Mart'in de Diego, Alberto Munoz, and Javier M Moguerza. 2010. Methods for the combination of kernel matrices within a support vector framework. Machine learning, Vol. 78, 1 (2010), 137--174."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-25966-4_10"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482226"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0912671107"},{"key":"e_1_3_2_2_8_1","volume-title":"Shrinkage estimation","author":"Fourdrinier Dominique","unstructured":"Dominique Fourdrinier, William E Strawderman, and Martin T Wells. 2018. Shrinkage estimation. Springer."},{"key":"e_1_3_2_2_9_1","unstructured":"Jerome Friedman Trevor Hastie Robert Tibshirani et al. 2001. The elements of statistical learning. Vol. 1. Springer series in statistics New York."},{"key":"e_1_3_2_2_10_1","volume-title":"Proceedings of the 39th International Conference on Machine Learning (Proceedings of Machine Learning Research","volume":"6917","author":"Fu Guoji","year":"2022","unstructured":"Guoji Fu, Peilin Zhao, and Yatao Bian. 2022. p-Laplacian Based Graph Neural Networks. In Proceedings of the 39th International Conference on Machine Learning (Proceedings of Machine Learning Research, Vol. 162), Kamalika Chaudhuri, Stefanie Jegelka, Le Song, Csaba Szepesvari, Gang Niu, and Sivan Sabato (Eds.). PMLR, 6878--6917. https:\/\/proceedings.mlr.press\/v162\/fu22e.html"},{"key":"e_1_3_2_2_11_1","volume-title":"ICML (Proceedings of Machine Learning Research","volume":"792","author":"Fujiwara Yasuhiro","year":"2014","unstructured":"Yasuhiro Fujiwara and Go Irie. 2014. Efficient Label Propagation. In ICML (Proceedings of Machine Learning Research, Vol. 32). PMLR, Bejing, China, 784--792."},{"key":"e_1_3_2_2_12_1","volume-title":"Message Passing in Graph Convolution Networks via Adaptive Filter Banks. arXiv preprint arXiv:2106.09910","author":"Gao Xing","year":"2021","unstructured":"Xing Gao, Wenrui Dai, Chenglin Li, Junni Zou, Hongkai Xiong, and Pascal Frossard. 2021. Message Passing in Graph Convolution Networks via Adaptive Filter Banks. arXiv preprint arXiv:2106.09910 (2021)."},{"key":"e_1_3_2_2_13_1","unstructured":"Johannes Gasteiger Aleksandar Bojchevski and Stephan G\u00fcnnemann. 2018. Predict then Propagate: Graph Neural Networks meet Personalized PageRank. In ICLR."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1953048.2021071"},{"key":"e_1_3_2_2_15_1","unstructured":"William L. Hamilton Rex Ying and Jure Leskovec. 2017. Inductive Representation Learning on Large Graphs. In NIPS."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2018.2796860"},{"key":"e_1_3_2_2_17_1","volume-title":"Why Do Deep Residual Networks Generalize Better than Deep Feedforward Networks?--A Neural Tangent Kernel Perspective. Advances in neural information processing systems","author":"Huang Kaixuan","year":"2020","unstructured":"Kaixuan Huang, Yuqing Wang, Molei Tao, and Tuo Zhao. 2020. Why Do Deep Residual Networks Generalize Better than Deep Feedforward Networks?--A Neural Tangent Kernel Perspective. Advances in neural information processing systems , Vol. 33 (2020), 2698--2709."},{"key":"e_1_3_2_2_18_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. 148--156.","DOI":"10.1145\/3437963.3441735"},{"key":"e_1_3_2_2_19_1","volume-title":"Adaptive Kernel Graph Neural Network. AAAI","author":"Ju Mingxuan","year":"2022","unstructured":"Mingxuan Ju, Shifu Hou, Yujie Fan, Jianan Zhao, Liang Zhao, and Yanfang Ye. 2022. Adaptive Kernel Graph Neural Network. AAAI (2022)."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"crossref","unstructured":"Jian Kang Qinghai Zhou and Hanghang Tong. 2022. JuryGCN: Quantifying Jackknife Uncertainty on Graph Convolutional Networks. In KDD. 742--752.","DOI":"10.1145\/3534678.3539286"},{"key":"e_1_3_2_2_21_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. 2016. Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907 (2016)."},{"key":"e_1_3_2_2_22_1","volume-title":"Kipf and Max Welling","author":"Thomas","year":"2017","unstructured":"Thomas N. Kipf and Max Welling. 2017. Semi-Supervised Classification with Graph Convolutional Networks. In ICLR."},{"key":"e_1_3_2_2_23_1","volume-title":"AISTATS. JMLR Workshop and Conference Proceedings, 421--428","author":"Kveton Branislav","year":"2010","unstructured":"Branislav Kveton, Michal Valko, Ali Rahimi, and Ling Huang. 2010. Semi-supervised learning with max-margin graph cuts. In AISTATS. JMLR Workshop and Conference Proceedings, 421--428."},{"key":"e_1_3_2_2_24_1","unstructured":"Mingjie Li Xiaojun Guo Yifei Wang Yisen Wang and Zhouchen Lin. 2022. G2CN: Graph Gaussian Convolution Networks with Concentrated Graph Filters. In ICML. PMLR 12782--12796."},{"key":"e_1_3_2_2_25_1","unstructured":"Qimai Li Xiao-Ming Wu Han Liu Xiaotong Zhang and Zhichao Guan. 2019. Label efficient semi-supervised learning via graph filtering. In CVPR. 9582--9591."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"crossref","unstructured":"Hongrui Liu Binbin Hu Xiao Wang Chuan Shi Zhiqiang Zhang and Jun Zhou. 2022. Confidence May Cheat: Self-Training on Graph Neural Networks under Distribution Shift. In WWW. 1248--1258.","DOI":"10.1145\/3485447.3512172"},{"key":"e_1_3_2_2_27_1","first-page":"1","article-title":"Large scale online kernel learning","volume":"17","author":"Lu Jing","year":"2016","unstructured":"Jing Lu, Steven CH Hoi, Jialei Wang, Peilin Zhao, and Zhi-Yong Liu. 2016. Large scale online kernel learning. Journal of Machine Learning Research, Vol. 17, 47 (2016), 1.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_2_28_1","volume-title":"NeurIPS","volume":"33","author":"Min Yimeng","year":"2020","unstructured":"Yimeng Min, Frederik Wenkel, and Guy Wolf. 2020. Scattering GCN: Overcoming Oversmoothness in Graph Convolutional Networks. NeurIPS , Vol. 33 (2020)."},{"key":"e_1_3_2_2_29_1","unstructured":"Krikamol Muandet Kenji Fukumizu Bharath Sriperumbudur Arthur Gretton and Bernhard Sch\u00f6lkopf. 2014a. Kernel mean estimation and Stein effect. In ICML. PMLR 10--18."},{"key":"e_1_3_2_2_30_1","volume-title":"NeurIPS","volume":"27","author":"Muandet Krikamol","year":"2014","unstructured":"Krikamol Muandet, Bharath Sriperumbudur, and Bernhard Sch\u00f6lkopf. 2014b. Kernel mean estimation via spectral filtering. NeurIPS , Vol. 27 (2014)."},{"key":"e_1_3_2_2_31_1","volume-title":"Random features for large-scale kernel machines. Advances in neural information processing systems","author":"Rahimi Ali","year":"2007","unstructured":"Ali Rahimi and Benjamin Recht. 2007. Random features for large-scale kernel machines. Advances in neural information processing systems , Vol. 20 (2007)."},{"key":"e_1_3_2_2_32_1","volume-title":"A survey on oversmoothing in graph neural networks. arXiv preprint arXiv:2303.10993","author":"Rusch T Konstantin","year":"2023","unstructured":"T Konstantin Rusch, Michael M Bronstein, and Siddhartha Mishra. 2023. A survey on oversmoothing in graph neural networks. arXiv preprint arXiv:2303.10993 (2023)."},{"key":"e_1_3_2_2_33_1","volume-title":"A generalized representer theorem","author":"Sch\u00f6lkopf Bernhard","unstructured":"Bernhard Sch\u00f6lkopf, Ralf Herbrich, and Alex J Smola. 2001. A generalized representer theorem. In COLT. Springer, 416--426."},{"key":"e_1_3_2_2_34_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."},{"key":"e_1_3_2_2_35_1","volume-title":"The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains","author":"Shuman David I","year":"2013","unstructured":"David I Shuman, Sunil K Narang, Pascal Frossard, Antonio Ortega, and Pierre Vandergheynst. 2013. The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains. IEEE signal processing magazine, Vol. 30, 3 (2013), 83--98."},{"key":"e_1_3_2_2_36_1","volume-title":"Learning theory and kernel machines","author":"Smola Alexander J","unstructured":"Alexander J Smola and Risi Kondor. 2003. Kernels and regularization on graphs. In Learning theory and kernel machines. Springer, 144--158."},{"key":"e_1_3_2_2_37_1","unstructured":"Hyeongseok Son Junyong Lee Sunghyun Cho and Seungyong Lee. 2021. Single image defocus deblurring using kernel-sharing parallel atrous convolutions. In ICCV. 2642--2650."},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557108"},{"key":"e_1_3_2_2_39_1","unstructured":"Petar Velivc kovi\u0107 Guillem Cucurull Arantxa Casanova Adriana Romero Pietro Li\u00f2 and Yoshua Bengio. 2018. Graph Attention Networks. In ICLR."},{"key":"e_1_3_2_2_40_1","first-page":"23768","article-title":"Be confident! towards trustworthy graph neural networks via confidence calibration","volume":"34","author":"Wang Xiao","year":"2021","unstructured":"Xiao Wang, Hongrui Liu, Chuan Shi, and Cheng Yang. 2021. Be confident! towards trustworthy graph neural networks via confidence calibration. NeurIPS , Vol. 34 (2021), 23768--23779.","journal-title":"NeurIPS"},{"key":"e_1_3_2_2_41_1","volume-title":"Using the Nystr\u00f6m method to speed up kernel machines. Advances in neural information processing systems","author":"Williams Christopher","year":"2000","unstructured":"Christopher Williams and Matthias Seeger. 2000. Using the Nystr\u00f6m method to speed up kernel machines. Advances in neural information processing systems , Vol. 13 (2000)."},{"key":"e_1_3_2_2_42_1","unstructured":"Felix Wu Amauri Souza Tianyi Zhang Christopher Fifty Tao Yu and Kilian Weinberger. 2019. Simplifying graph convolutional networks. In ICML. PMLR 6861--6871."},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-022-03836--2"},{"key":"e_1_3_2_2_44_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. 5453--5462."},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"crossref","unstructured":"Carl Yang Jieyu Zhang Haonan Wang Sha Li Myungwan Kim Matt Walker Yiou Xiao and Jiawei Han. 2020. Relation learning on social networks with multi-modal graph edge variational autoencoders. In WSDM. 699--707.","DOI":"10.1145\/3336191.3371829"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512069"},{"key":"e_1_3_2_2_47_1","first-page":"17009","article-title":"Design space for graph neural networks","volume":"33","author":"You Jiaxuan","year":"2020","unstructured":"Jiaxuan You, Zhitao Ying, and Jure Leskovec. 2020. Design space for graph neural networks. NeurIPS , Vol. 33 (2020), 17009--17021.","journal-title":"NeurIPS"},{"key":"e_1_3_2_2_48_1","volume-title":"PairNorm: Tackling Oversmoothing in GNNs. In International Conference on Learning Representations.","author":"Zhao Lingxiao","year":"2019","unstructured":"Lingxiao Zhao and Leman Akoglu. 2019. PairNorm: Tackling Oversmoothing in GNNs. In International Conference on Learning Representations."},{"key":"e_1_3_2_2_49_1","volume-title":"NeurIPS","volume":"16","author":"Zhou Dengyong","year":"2003","unstructured":"Dengyong Zhou, Olivier Bousquet, Thomas Lal, Jason Weston, and Bernhard Sch\u00f6lkopf. 2003. Learning with local and global consistency. NeurIPS , Vol. 16 (2003)."},{"key":"e_1_3_2_2_50_1","unstructured":"Hao Zhu and Piotr Koniusz. 2020. Simple spectral graph convolution. In ICLR."},{"key":"e_1_3_2_2_51_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)."},{"key":"e_1_3_2_2_52_1","volume-title":"A Survey on Graph Structure Learning: Progress and Opportunities. arXiv e-prints","author":"Zhu Yanqiao","year":"2021","unstructured":"Yanqiao Zhu, Weizhi Xu, Jinghao Zhang, Yuanqi Du, Jieyu Zhang, Qiang Liu, Carl Yang, and Shu Wu. 2021. A Survey on Graph Structure Learning: Progress and Opportunities. arXiv e-prints (2021), arXiv--2103."}],"event":{"name":"WWW '24: The ACM Web Conference 2024","location":"Singapore Singapore","acronym":"WWW '24","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the ACM Web Conference 2024"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3589334.3645583","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3589334.3645583","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T00:25:14Z","timestamp":1755822314000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3589334.3645583"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,13]]},"references-count":52,"alternative-id":["10.1145\/3589334.3645583","10.1145\/3589334"],"URL":"https:\/\/doi.org\/10.1145\/3589334.3645583","relation":{},"subject":[],"published":{"date-parts":[[2024,5,13]]},"assertion":[{"value":"2024-05-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}