{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T00:55:53Z","timestamp":1768092953140,"version":"3.49.0"},"reference-count":53,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"PRIN 2017 Project RexLearn"},{"name":"University and Research","award":["2017TWNMH2"],"award-info":[{"award-number":["2017TWNMH2"]}]},{"name":"Research Foundation - Flanders and the KU Leuven Research Fund"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2022,2,1]]},"DOI":"10.1109\/tpami.2021.3073504","type":"journal-article","created":{"date-parts":[[2021,4,16]],"date-time":"2021-04-16T13:58:23Z","timestamp":1618581503000},"page":"727-739","source":"Crossref","is-referenced-by-count":12,"title":["Deep Constraint-Based Propagation in Graph Neural Networks"],"prefix":"10.1109","volume":"44","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9133-8669","authenticated-orcid":false,"given":"Matteo","family":"Tiezzi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5940-9562","authenticated-orcid":false,"given":"Giuseppe","family":"Marra","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0415-0888","authenticated-orcid":false,"given":"Stefano","family":"Melacci","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6428-1265","authenticated-orcid":false,"given":"Marco","family":"Maggini","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1989.1.2.270"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1997.9.8.1735"},{"key":"ref3","article-title":"Convolutional networks for images, speech, and time-series","volume-title":"The Handbook of Brain Theory and Neural Networks","author":"LeCun and","year":"1995"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICNN.1996.548916"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/72.712151"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2008.2005605"},{"key":"ref7","first-page":"10","article-title":"Distributed optimization of deeply nested systems","volume-title":"Proc. Artif. Intell. Statist.","author":"Carreira-Perpinan and"},{"key":"ref8","first-page":"2722","article-title":"Training neural networks without gradients: A scalable ADMM approach","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Taylor"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"ref10","first-page":"612","article-title":"Constrained differential optimization","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Platt"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2017.2693418"},{"key":"ref12","first-page":"1149","article-title":"Laplacian Support Vector Machines Trained in the Primal","volume":"12","author":"Melacci","year":"2011","journal-title":"J. Mach. Learn. Res."},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/72.572108"},{"key":"ref14","article-title":"Gated graph sequence neural networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Li"},{"key":"ref15","first-page":"1114","article-title":"Learning steady-states of iterative algorithms over graphs","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Dai"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2020.06.006"},{"key":"ref17","article-title":"What graph neural networks cannot learn: depth vs width","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Loukas"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11604"},{"key":"ref19","article-title":"Benchmarking graph neural networks","volume":"abs\/2003.00982","author":"Dwivedi","year":"2020","journal-title":"CoRR"},{"key":"ref20","article-title":"Spectral networks and locally connected networks on graphs","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Bruna"},{"key":"ref21","article-title":"Deep convolutional networks on graph-structured data","volume":"abs\/1506.05163","author":"Henaff","year":"2015","journal-title":"CoRR"},{"key":"ref22","first-page":"3837","article-title":"Convolutional neural networks on graphs with fast localized spectral filtering","volume-title":"Proc. Advances Neural Inf. Process. Syst.","author":"Defferrard"},{"key":"ref23","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kipf"},{"key":"ref24","first-page":"1993","article-title":"Diffusion-convolutional neural networks","volume-title":"Proc. Advances Neural Inf. Process. Syst.","author":"Atwood"},{"key":"ref25","first-page":"1025","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. Advances Neural Inf. Process. Syst.","author":"Hamilton"},{"key":"ref26","first-page":"2014","article-title":"Learning convolutional neural networks for graphs","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Niepert"},{"key":"ref27","first-page":"2224","article-title":"Convolutional networks on graphs for learning molecular fingerprints","volume-title":"Proc. Advances Neural Inf. Process. Syst.","author":"Duvenaud"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11782"},{"key":"ref29","first-page":"2186","article-title":"Anonymous walk embeddings","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Ivanov"},{"key":"ref30","article-title":"Machine learning on graphs: A model and comprehensive taxonomy","volume":"abs\/2005.03675","author":"Chami","year":"2020","journal-title":"CoRR"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2887403"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2955832"},{"key":"ref33","first-page":"1263","article-title":"Neural message passing for Quantum Chemistry","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Gilmer"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-40245-7_10"},{"key":"ref35","article-title":"Graph attention networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Veli\u010dkovi\u0107"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.576"},{"key":"ref37","article-title":"Residual gated graph convnets","volume":"abs\/1711.07553","author":"Bresson","year":"2017","journal-title":"CoRR"},{"key":"ref38","article-title":"How powerful are graph neural networks?","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Xu"},{"issue":"9","key":"ref39","first-page":"12","article-title":"A reduction of a graph to a canonical form and an algebra arising during this reduction","volume":"2","author":"Weisfeiler","year":"1968","journal-title":"Nauchno-Technicheskaya Informatsia"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33014602"},{"key":"ref41","article-title":"Invariant and equivariant graph networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Maron"},{"key":"ref42","first-page":"13260","article-title":"Principal neighbourhood aggregation for graph nets","volume-title":"Proc. Advances Neural Inf. Process. Syst.","volume":"33","author":"Corso"},{"key":"ref43","first-page":"21","article-title":"A theoretical framework for back-propagation","volume-title":"Connectionist Models Summer School","volume":"1","author":"LeCun","year":"1988"},{"key":"ref44","first-page":"1","article-title":"Decoupling backpropagation using constrained optimization methods","volume-title":"Proc. Workshop Efficient Credit Assignment Deep Learn. Deep Reinforcement Learn. Int. Conf. Mach. Learn.","author":"Gotmare"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN48605.2020.9207043"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-89629-8_2"},{"key":"ref47","article-title":"Adam: A method for stochastic optimization","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kingma"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1086\/jar.33.4.3629752"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2005.1555942"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783417"},{"key":"ref51","first-page":"4663","article-title":"Relational pooling for graph representations","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Murphy"},{"key":"ref52","article-title":"Pitfalls of graph neural network evaluation","volume":"abs\/1811.05868","author":"Shchur","year":"2018","journal-title":"CoRR"},{"key":"ref53","article-title":"A fair comparison of graph neural networks for graph classification","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Errica"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/34\/9674188\/09405452.pdf?arnumber=9405452","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,9]],"date-time":"2024-01-09T23:39:05Z","timestamp":1704843545000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9405452\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,1]]},"references-count":53,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tpami.2021.3073504","relation":{},"ISSN":["0162-8828","2160-9292","1939-3539"],"issn-type":[{"value":"0162-8828","type":"print"},{"value":"2160-9292","type":"electronic"},{"value":"1939-3539","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2,1]]}}}