{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T16:17:54Z","timestamp":1779380274757,"version":"3.53.1"},"reference-count":63,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62001295"],"award-info":[{"award-number":["62001295"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Shanghai Sailing Program","award":["20YF1430800"],"award-info":[{"award-number":["20YF1430800"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE J. Sel. Top. Signal Process."],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1109\/jstsp.2024.3485892","type":"journal-article","created":{"date-parts":[[2024,10,24]],"date-time":"2024-10-24T17:26:41Z","timestamp":1729790801000},"page":"181-194","source":"Crossref","is-referenced-by-count":2,"title":["Graph Neural Networks With Adaptive Structures"],"prefix":"10.1109","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5994-5848","authenticated-orcid":false,"given":"Zepeng","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Information Science and Technology, ShanghaiTech University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9256-9648","authenticated-orcid":false,"given":"Songtao","family":"Lu","sequence":"additional","affiliation":[{"name":"IBM Thomas J. Watson Research Center, Yorktown Heights, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2671-7483","authenticated-orcid":false,"given":"Zengfeng","family":"Huang","sequence":"additional","affiliation":[{"name":"School of Data Science, Fudan University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8668-6263","authenticated-orcid":false,"given":"Ziping","family":"Zhao","sequence":"additional","affiliation":[{"name":"School of Information Science and Technology, ShanghaiTech University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780198805090.001.0001"},{"key":"ref2","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kipf","year":"2017"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2017.2693418"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-16-6054-2"},{"key":"ref6","article-title":"Graph attention networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Velikovi","year":"2018"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3201243"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3447556.3447566"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-16-6054-2_8"},{"key":"ref10","first-page":"30306","article-title":"GSLB: The graph structure learning benchmark","volume-title":"Proc. Annu. Conf. Neural Inf. Process. Syst.","volume":"36","author":"Li","year":"2024"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/APSIPAASC63619.2025.10849018"},{"key":"ref12","first-page":"1115","article-title":"Adversarial attack on graph structured data","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Dai","year":"2018"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220078"},{"key":"ref14","article-title":"Adversarial attacks on graph neural networks via meta learning","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Zgner","year":"2019"},{"key":"ref15","first-page":"9263","article-title":"GNNGuard: Defending graph neural networks against adversarial attacks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Zhang"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/669"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3336191.3371789"},{"key":"ref18","article-title":"A general unified graph neural network framework against adversarial attacks","author":"Gu","year":"2021"},{"key":"ref19","article-title":"A survey on graph structure learning: Progress and opportunities","author":"Zhu","year":"2022"},{"key":"ref20","first-page":"1972","article-title":"Learning discrete structures for graph neural networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Franceschi","year":"2019"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403049"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3437963.3441734"},{"key":"ref23","first-page":"19314","article-title":"Iterative deep graph learning for graph neural networks: Better and robust node embeddings","volume-title":"Proc. Annu. Conf. Neural Inf. Process. Syst.","volume":"33","author":"Chen"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-67664-3_23"},{"key":"ref25","first-page":"13272","article-title":"Reliable graph neural networks via robust aggregation","volume-title":"Proc. Annu. Conf. Neural Inf. Process. Syst.","volume":"33","author":"Geisler"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM50108.2020.00071"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3411983"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330851"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3336191.3371851"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449953"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482225"},{"key":"ref32","article-title":"Towards understanding graph neural networks: An algorithm unrolling perspective","author":"Zhang","year":"2022"},{"key":"ref33","first-page":"11773","article-title":"Graph neural networks inspired by classical iterative algorithms","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Yang","year":"2021"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2024.110597"},{"key":"ref35","article-title":"Predict then propagate: Graph neural networks meet personalized pagerank","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Klicpera","year":"2019"},{"key":"ref36","first-page":"920","article-title":"How to learn a graph from smooth signals","volume-title":"Proc. Artif. Intell. Statist.","author":"Kalofolias","year":"2016"},{"key":"ref37","first-page":"4249","article-title":"Learning to learn graph topologies","volume-title":"Proc. Annu. Conf. Neural Inf. Process. Syst.","volume":"34","author":"Pu","year":"2021"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2018.2820126"},{"key":"ref39","first-page":"641","article-title":"Learning social infectivity in sparse low-rank networks using multi-dimensional hawkes processes","volume-title":"Proc. Artif. Intell. Statist.","author":"Zhou","year":"2013"},{"issue":"22","key":"ref40","first-page":"1","article-title":"A unified framework for structured graph learning via spectral constraints","volume":"21","author":"Kumar","year":"2020","journal-title":"J. Mach. Learn. Res."},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2017.2726975"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2018.2887284"},{"key":"ref43","first-page":"1","article-title":"Garnet: Reduced-rank topology learning for robust and scalable graph neural networks","volume-title":"Proc. Learn. Graphs Conf.","author":"Deng","year":"2022"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/3326362"},{"key":"ref45","article-title":"Linked dynamic graph CNN: Learning on point cloud via linking hierarchical features","author":"Zhang","year":"2019"},{"key":"ref46","first-page":"20745","article-title":"Object DGCNN: 3D object detection using dynamic graphs","volume-title":"Proc. Annu. Conf. Neural Inf. Process. Syst.","volume":"34","author":"Wang"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1561\/2400000003"},{"key":"ref48","first-page":"6861","article-title":"Simplifying graph convolutional networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Wu","year":"2019"},{"key":"ref49","first-page":"3419","article-title":"Generalization and representational limits of graph neural networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Garg","year":"2020"},{"key":"ref50","article-title":"A PAC-Bayesian approach to generalization bounds for graph neural networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Liao","year":"2021"},{"key":"ref51","first-page":"9936","article-title":"On provable benefits of depth in training graph convolutional networks","volume-title":"Proc. Annu. Conf. Neural Inf. Process. Syst.","volume":"34","author":"Cong"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-013-0701-9"},{"key":"ref53","article-title":"Alternating proximal gradient descent for nonconvex regularised problems with multiconvex coupling terms","author":"Nikolova","year":"2017","journal-title":"HAL-01492846"},{"key":"ref54","first-page":"6837","article-title":"Elastic graph neural networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Liu","year":"2021"},{"key":"ref55","first-page":"4694","article-title":"Evennet: Ignoring odd-hop neighbors improves robustness of graph neural networks","volume-title":"Proc. Annu. Conf. Neural Inf. Process. Syst.","volume":"35","author":"Lei"},{"key":"ref56","first-page":"9720","article-title":"Graph neural networks with adaptive residual","volume-title":"Proc. Annu. Conf. Neural Inf. Process. Syst.","volume":"34","author":"Liu"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v29i3.2157"},{"key":"ref58","article-title":"Deep Gaussian embedding of graphs: Unsupervised inductive learning via ranking","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Bojchevski","year":"2018"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313562"},{"key":"ref60","article-title":"Fast graph representation learning with PyTorch geometric","volume-title":"Proc. ICLR Workshop Representation Learn. Graphs Manifolds","author":"Fey","year":"2019"},{"key":"ref61","article-title":"DeepRobust: A pytorch library for adversarial attacks and defenses","author":"Li","year":"2020"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3354206"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1090\/cbms\/092"}],"container-title":["IEEE Journal of Selected Topics in Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/4200690\/10906680\/10733992.pdf?arnumber=10733992","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T17:44:22Z","timestamp":1749663862000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10733992\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1]]},"references-count":63,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/jstsp.2024.3485892","relation":{},"ISSN":["1932-4553","1941-0484"],"issn-type":[{"value":"1932-4553","type":"print"},{"value":"1941-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1]]}}}