{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T06:01:30Z","timestamp":1777615290974,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":56,"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:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,5,13]]},"DOI":"10.1145\/3589334.3645705","type":"proceedings-article","created":{"date-parts":[[2024,5,8]],"date-time":"2024-05-08T07:08:13Z","timestamp":1715152093000},"page":"1057-1068","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Optimizing Polynomial Graph Filters: A Novel Adaptive Krylov Subspace Approach"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2190-7114","authenticated-orcid":false,"given":"Keke","family":"Huang","sequence":"first","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-7796-8227","authenticated-orcid":false,"given":"Wencai","family":"Cao","sequence":"additional","affiliation":[{"name":"Micro Connect Technology, Shenzhen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-0808-6466","authenticated-orcid":false,"given":"Hoang","family":"Ta","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0914-4580","authenticated-orcid":false,"given":"Xiaokui","family":"Xiao","sequence":"additional","affiliation":[{"name":"National University of Singapore & CNRS@CREATE, Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0540-5053","authenticated-orcid":false,"given":"Pietro","family":"Li\u00f2","sequence":"additional","affiliation":[{"name":"University of Cambridge, Cambridge, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,5,13]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"crossref","unstructured":"Richard Askey. 1974. Positive Jacobi Polynomial Sums III. In Linear Operators and Approximation II. 305--312.","DOI":"10.1007\/978-3-0348-5991-2_22"},{"key":"e_1_3_2_2_2_1","volume-title":"Bridging the gap between spectral and spatial domains in graph neural networks. arXiv preprint arXiv:2003.11702","author":"Balcilar Muhammet","year":"2020","unstructured":"Muhammet Balcilar, Guillaume Renton, Pierre H\u00e9roux, Benoit Gauzere, Sebastien Adam, and Paul Honeine. 2020. Bridging the gap between spectral and spatial domains in graph neural networks. arXiv preprint arXiv:2003.11702 (2020)."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3054830"},{"key":"e_1_3_2_2_4_1","volume-title":"Convex optimization","author":"Boyd Stephen","unstructured":"Stephen Boyd, Stephen P Boyd, and Lieven Vandenberghe. 2004. Convex optimization. Cambridge university press."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2017.2693418"},{"key":"e_1_3_2_2_6_1","unstructured":"Sudhanshu Chanpuriya and Cameron Musco. 2022. Simplified Graph Convolution with Heterophily. In NeurIPS."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"crossref","unstructured":"Yunpeng Chen Haoqi Fan Bing Xu Zhicheng Yan Yannis Kalantidis Marcus Rohrbach Shuicheng Yan and Jiashi Feng. 2019. Drop an Octave: Reducing Spatial Redundancy in Convolutional Neural Networks With Octave Convolution. In ICCV. 3434--3443.","DOI":"10.1109\/ICCV.2019.00353"},{"key":"e_1_3_2_2_8_1","unstructured":"Eli Chien Jianhao Peng Pan Li and Olgica Milenkovic. 2021. Adaptive Universal Generalized PageRank Graph Neural Network. In ICLR."},{"key":"e_1_3_2_2_9_1","unstructured":"Fan RK Chung and Fan Chung Graham. 1997. Spectral graph theory. Number 92. American Mathematical Soc."},{"key":"e_1_3_2_2_10_1","unstructured":"Micha\u00eb l Defferrard Xavier Bresson and Pierre Vandergheynst. 2016. Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering. In NIPS. 3837--3845."},{"key":"e_1_3_2_2_11_1","volume-title":"Jiliang Tang, and Dawei Yin.","author":"Fan Wenqi","year":"2019","unstructured":"Wenqi Fan, Yao Ma, Qing Li, Yuan He, Yihong Eric Zhao, Jiliang Tang, and Dawei Yin. 2019. Graph Neural Networks for Social Recommendation. In WWW. 417--426."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cagd.2012.03.001"},{"key":"e_1_3_2_2_13_1","volume-title":"Matrix theory","author":"Franklin Joel N","unstructured":"Joel N Franklin. 2012. Matrix theory. Courier Corporation."},{"key":"e_1_3_2_2_14_1","volume-title":"Sign: Scalable inception graph neural networks. arXiv preprint arXiv:2004.11198","author":"Frasca Fabrizio","year":"2020","unstructured":"Fabrizio Frasca, Emanuele Rossi, Davide Eynard, Ben Chamberlain, Michael Bronstein, and Federico Monti. 2020. Sign: Scalable inception graph neural networks. arXiv preprint arXiv:2004.11198 (2020)."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"crossref","unstructured":"Walter Gautschi. 2004. Orthogonal polynomials: computation and approximation. OUP Oxford.","DOI":"10.1093\/oso\/9780198506720.001.0001"},{"key":"e_1_3_2_2_16_1","volume-title":"IMIS","volume":"279","author":"Guo Tao","year":"2021","unstructured":"Tao Guo and Baojiang Cui. 2021. Web Page Classification Based on Graph Neural Network. In IMIS, Vol. 279. Springer, 188--198."},{"key":"e_1_3_2_2_17_1","unstructured":"Yuhe Guo and Zhewei Wei. 2023. Graph Neural Networks with Learnable and Optimal Polynomial Bases. In ICML. 12077--12097."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"crossref","unstructured":"Martin H Gutknecht. 2007. A brief introduction to Krylov space methods for solving linear systems. In ISFCS. 53--62.","DOI":"10.1007\/978-3-540-46375-7_5"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2010.04.005"},{"key":"e_1_3_2_2_20_1","unstructured":"Mingguo He Zhewei Wei and Ji-Rong Wen. 2022. Convolutional Neural Networks on Graphs with Chebyshev Approximation Revisited. In NeurIPS."},{"key":"e_1_3_2_2_21_1","unstructured":"Mingguo He Zhewei Wei Hongteng Xu et al. 2021. BernNet: Learning Arbitrary Graph Spectral Filters via Bernstein Approximation. In NeurIPS. 14239--14251."},{"key":"e_1_3_2_2_22_1","volume-title":"Open graph benchmark: Datasets for machine learning on graphs. arXiv preprint arXiv:2005.00687","author":"Hu Weihua","year":"2020","unstructured":"Weihua Hu, Matthias Fey, Marinka Zitnik, Yuxiao Dong, Hongyu Ren, Bowen Liu, Michele Catasta, and Jure Leskovec. 2020. Open graph benchmark: Datasets for machine learning on graphs. arXiv preprint arXiv:2005.00687 (2020)."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"crossref","unstructured":"Keke Huang Jing Tang Juncheng Liu Renchi Yang and Xiaokui Xiao. 2023. Node-wise Diffusion for Scalable Graph Learning. In WWW. 1723--1733.","DOI":"10.1145\/3543507.3583408"},{"key":"e_1_3_2_2_24_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_25_1","unstructured":"Johannes Klicpera Aleksandar Bojchevski and Stephan G\u00fc nnemann. 2019a. Predict then Propagate: Graph Neural Networks meet Personalized PageRank. In ICLR."},{"key":"e_1_3_2_2_26_1","unstructured":"Johannes Klicpera Stefan Wei\u00dfenberger and Stephan G\u00fc nnemann. 2019b. Diffusion Improves Graph Learning. In NeurIPS. 13333--13345."},{"key":"e_1_3_2_2_27_1","unstructured":"Runlin Lei Zhen Wang Yaliang Li Bolin Ding and Zhewei Wei. 2022. EvenNet: Ignoring Odd-Hop Neighbors Improves Robustness of Graph Neural Networks. In NeurIPS."},{"key":"e_1_3_2_2_28_1","volume-title":"Markov chains and mixing times","author":"Levin David A","unstructured":"David A Levin and Yuval Peres. 2017. Markov chains and mixing times. Vol. 107. American Mathematical Soc."},{"key":"e_1_3_2_2_29_1","unstructured":"Chang Li and Dan Goldwasser. 2019. Encoding Social Information with Graph Convolutional Networks for political Perspective Detection in News Media. In ACL. 2594--2604."},{"key":"e_1_3_2_2_30_1","first-page":"12782","article-title":"G(^mbox2 )CN: Graph Gaussian Convolution Networks with Concentrated Graph Filters","volume":"162","author":"Li Mingjie","year":"2022","unstructured":"Mingjie Li, Xiaojun Guo, Yifei Wang, Yisen Wang, and Zhouchen Lin. 2022. G(^mbox2 )CN: Graph Gaussian Convolution Networks with Concentrated Graph Filters. In ICML, Vol. 162. 12782--12796.","journal-title":"ICML"},{"key":"e_1_3_2_2_31_1","volume-title":"Krylov subspace methods: principles and analysis","author":"Liesen J\u00f6rg","unstructured":"J\u00f6rg Liesen and Zdenek Strakos. 2013. Krylov subspace methods: principles and analysis. Oxford University Press."},{"key":"e_1_3_2_2_32_1","volume-title":"Vaishnavi Gupta, Omkar Bhalerao, and Ser-Nam Lim.","author":"Lim Derek","year":"2021","unstructured":"Derek Lim, Felix Hohne, Xiuyu Li, Sijia Linda Huang, Vaishnavi Gupta, Omkar Bhalerao, and Ser-Nam Lim. 2021. Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methods. In NeurIPS. 20887--20902."},{"key":"e_1_3_2_2_33_1","volume-title":"Chebyshev polynomials","author":"Mason John C","unstructured":"John C Mason and David C Handscomb. 2002. Chebyshev polynomials. Chapman and Hall\/CRC."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"crossref","unstructured":"Sunil K. Narang Akshay Gadde and Antonio Ortega. 2013. Signal processing techniques for interpolation in graph structured data. In ICASSP. 5445--5449.","DOI":"10.1109\/ICASSP.2013.6638704"},{"key":"e_1_3_2_2_35_1","unstructured":"Dianne P O'Leary. 1998. Conjugate gradients and related KMP algorithms: the beginnings. Technical Report."},{"key":"e_1_3_2_2_36_1","unstructured":"Lawrence Page Sergey Brin Rajeev Motwani and Terry Winograd. 1999. The PageRank citation ranking: Bringing order to the web. Technical Report. Stanford InfoLab."},{"key":"e_1_3_2_2_37_1","volume-title":"Yu Lei, and Bo Yang.","author":"Pei Hongbin","year":"2020","unstructured":"Hongbin Pei, Bingzhe Wei, Kevin Chen-Chuan Chang, Yu Lei, and Bo Yang. 2020. Geom-GCN: Geometric Graph Convolutional Networks. In ICLR."},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"crossref","unstructured":"Jiezhong Qiu Jian Tang Hao Ma Yuxiao Dong Kuansan Wang and Jie Tang. 2018. DeepInf: Social Influence Prediction with Deep Learning. In SIGKDD. 2110--2119.","DOI":"10.1145\/3219819.3220077"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCSE.2022.3214388"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"crossref","unstructured":"Aravind Sankar Yozen Liu Jun Yu and Neil Shah. 2021. Graph Neural Networks for Friend Ranking in Large-scale Social Platforms. In WWW. 2535--2546.","DOI":"10.1145\/3442381.3450120"},{"key":"e_1_3_2_2_41_1","volume-title":"Ah Chung Tsoi, and Markus Hagenbuchner","author":"Scarselli Franco","year":"2004","unstructured":"Franco Scarselli, Ah Chung Tsoi, and Markus Hagenbuchner. 2004. Computing personalized pageranks. In WWW. 382--383."},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.4064\/-25-1-147-162"},{"key":"e_1_3_2_2_43_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_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2020.3015024"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2012.2235192"},{"key":"e_1_3_2_2_46_1","volume-title":"Krylov Subspace Methods for Linear Systems: Principles of Algorithms","author":"Sogabe Tomohiro","unstructured":"Tomohiro Sogabe. 2023. Krylov Subspace Methods for Linear Systems: Principles of Algorithms. Vol. 60. Springer Nature."},{"key":"e_1_3_2_2_47_1","first-page":"23341","article-title":"How Powerful are Spectral Graph Neural Networks","volume":"162","author":"Wang Xiyuan","year":"2022","unstructured":"Xiyuan Wang and Muhan Zhang. 2022. How Powerful are Spectral Graph Neural Networks. In ICML, Vol. 162. 23341--23362.","journal-title":"ICML"},{"key":"e_1_3_2_2_48_1","unstructured":"Yifei Wang Yisen Wang Jiansheng Yang and Zhouchen Lin. 2021. Dissecting the Diffusion Process in Linear Graph Convolutional Networks. In NeurIPS. 5758--5769."},{"key":"e_1_3_2_2_49_1","first-page":"67","article-title":"Numerical optimization","volume":"35","author":"Wright Stephen","year":"1999","unstructured":"Stephen Wright, Jorge Nocedal, et al. 1999. Numerical optimization. Springer Science, Vol. 35, 67--68 (1999), 7.","journal-title":"Springer Science"},{"key":"e_1_3_2_2_50_1","first-page":"6861","article-title":"Simplifying Graph Convolutional Networks","volume":"97","author":"Wu Felix","year":"2019","unstructured":"Felix Wu, Amauri H. Souza Jr., Tianyi Zhang, Christopher Fifty, Tao Yu, and Kilian Q. Weinberger. 2019a. Simplifying Graph Convolutional Networks. In ICML, Vol. 97. 6861--6871.","journal-title":"ICML"},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"crossref","unstructured":"Qitian Wu Hengrui Zhang Xiaofeng Gao Peng He Paul Weng Han Gao and Guihai Chen. 2019b. Dual Graph Attention Networks for Deep Latent Representation of Multifaceted Social Effects in Recommender Systems. In WWW. 2091--2102.","DOI":"10.1145\/3308558.3313442"},{"key":"e_1_3_2_2_52_1","first-page":"27387","article-title":"Nodeformer: A scalable graph structure learning transformer for node classification","volume":"35","author":"Wu Qitian","year":"2022","unstructured":"Qitian Wu, Wentao Zhao, Zenan Li, David P Wipf, and Junchi Yan. 2022. Nodeformer: A scalable graph structure learning transformer for node classification. NeurIPS , Vol. 35, 27387--27401.","journal-title":"NeurIPS"},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"crossref","unstructured":"Rex Ying Ruining He Kaifeng Chen Pong Eksombatchai William L. Hamilton and Jure Leskovec. 2018. Graph Convolutional Neural Networks for Web-Scale Recommender Systems. In SIGKDD. 974--983.","DOI":"10.1145\/3219819.3219890"},{"key":"e_1_3_2_2_54_1","doi-asserted-by":"crossref","unstructured":"Lulu Zhang Buqing Cao Mi Peng Yueying Qing Guosheng Kang Jianxun Liu and Kenneth K Fletcher. 2021. Bilinear Graph Neural Network-Enhanced Web Services Classification. In HPCC. 189--196.","DOI":"10.1109\/HPCC-DSS-SmartCity-DependSys53884.2021.00051"},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"crossref","unstructured":"Xin Zheng Miao Zhang Chunyang Chen Qin Zhang Chuan Zhou and Shirui Pan. 2023. Auto-HeG: Automated Graph Neural Network on Heterophilic Graphs. In WWW. 611--620.","DOI":"10.1145\/3543507.3583498"},{"key":"e_1_3_2_2_56_1","doi-asserted-by":"crossref","unstructured":"Meiqi Zhu Xiao Wang Chuan Shi Houye Ji and Peng Cui. 2021. Interpreting and Unifying Graph Neural Networks with An Optimization Framework. In WWW. 1215--1226.","DOI":"10.1145\/3442381.3449953"}],"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.3645705","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3589334.3645705","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T00:26:59Z","timestamp":1755822419000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3589334.3645705"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,13]]},"references-count":56,"alternative-id":["10.1145\/3589334.3645705","10.1145\/3589334"],"URL":"https:\/\/doi.org\/10.1145\/3589334.3645705","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"}}]}}