The DOI matches its Crossref record; 61 of the 61 references it cites were found in a registry or an index.
Graph Neural Networks with Convolutional ARMA Filters
Open accessAbstract
Popular graph neural networks implement convolution operations on graphs based on polynomial spectral filters. In this paper, we propose a novel graph convolutional layer inspired by the auto-regressive moving average (ARMA) filter that, compared to polynomial ones, provides a more flexible frequency response, is more robust to noise, and better captures the global graph structure. We propose a graph neural network implementation of the ARMA filter with a recursive and distributed formulation, obtaining a convolutional layer that is efficient to train, localized in the node space, and can be transferred to new graphs at test time. We perform a spectral analysis to study the filtering effect of the proposed ARMA layer and report experiments on four downstream tasks: semi-supervised node classification, graph signal classification, graph classification, and graph regression. Results show that the proposed ARMA layer brings significant improvements over graph neural networks based on polynomial filters.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
Efficient Estimation of Word Representations in Vector Space
Mikolov, T., Chen, K., Corrado, G., & Dean, J. (2013) · arXiv · doi:10.48550/arxiv.1301.3781 · Cited by 26,568
(1999) · Cited by 12,854
Discrete-Time Signal Processing
Oppenheim, A. V., & Schafer, R. W. (1989) · Cited by 12,572
Veličković, P., Cucurull, G., Casanova, A., Romero, A., Liò, P., & Bengio, Y. (2017) · arXiv · doi:10.48550/arxiv.1710.10903 · Cited by 12,107
Inductive Representation Learning on Large Graphs
Hamilton, W. L., Ying, R., & Leskovec, J. (2017) · arXiv · doi:10.48550/arxiv.1706.02216 · Cited by 10,639
DeepWalk: online learning of social representations
Perozzi, B., Al-Rfou, R., & Skiena, S. (2014) · Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2623330.2623732 · Cited by 10,123
The graph neural network model
Scarselli, F., Gori, M., Tsoi, A. C., Hagenbuchner, M., & Monfardini, G. (2009) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2008.2005605 · Cited by 9,582
Veličković, P., Casanova, A., Liò, P., Cucurull, G., Romero, A., & Bengio, Y. (2017) · arXiv (Cornell University) · doi:10.17863/cam.48429 · Cited by 8,657
Google's Neural Machine Translation System: Bridging the Gap between Human and Machine Translation
Wu, Y., Schuster, M., Chen, Z., Le, Q. V., Norouzi, M., Macherey, W., Krikun, M., Cao, Y., Gao, Q., Macherey, K., et al. (2016) · arXiv · doi:10.48550/arxiv.1609.08144 · Cited by 5,319
Targeted Branching for the Maximum Independent Set Problem Using Graph Neural Networks
Silva, G., Rodrigues, M., Teixeira, A., & Amorim, M. (2024) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.sea.2024.20 · Cited by 5,183
Advances In Deep Learning On Graphs (Gsp'18 Workshop)
Defferrard, M. (2016) · Figshare · doi:10.5281/zenodo.1286817 · Cited by 4,613
Spectral Networks and Locally Connected Networks on Graphs
Bruna, J., Zaremba, W., Szlam, A., & LeCun, Y. (2013) · arXiv · doi:10.48550/arxiv.1312.6203 · Cited by 3,983
Learning with Local and Global Consistency
Zhou, D., Bousquet, O., Lal, T. N., Weston, J., & Schölkopf, B. (2003) · MPG.PuRe (Max Planck Society) · Cited by 3,864
Geometric Deep Learning: Going beyond Euclidean data
Bronstein, M. M., Bruna, J., LeCun, Y., Szlam, A., & Vandergheynst, P. (2017) · IEEE Signal Processing Magazine · doi:10.1109/msp.2017.2693418 · Cited by 3,661
Formal Semantics for Kolmogorov-Arnold Network Representations of Operational Games
Zhukov, G. A. (2025) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.15206559 · Cited by 3,212
Reservoir computing approaches to recurrent neural network training
Lukoševičius, M., & Jaeger, H. (2009) · Computer Science Review · doi:10.1016/j.cosrev.2009.03.005 · Cited by 2,956
Deeper Insights Into Graph Convolutional Networks for Semi-Supervised Learning
Li, Q., Han, Z., & Wu, X.-M. (2018) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v32i1.11604 · Cited by 2,872
Quantum chemistry structures and properties of 134 kilo molecules
Ramakrishnan, R., Dral, P. O., Rupp, M., & von Lilienfeld, O. A. (2014) · Scientific Data · doi:10.1038/sdata.2014.22 · Cited by 1,966
Geometric Deep Learning on Graphs and Manifolds Using Mixture Model CNNs
Monti, F., Boscaini, D., Masci, J., Rodola, E., Svoboda, J., & Bronstein, M. M. (2017) · 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2017.576 · Cited by 1,820
Weisfeiler-Lehman Graph Kernels
Shervashidze, N., Schweitzer, P., van Leeuwen, E. J., Mehlhorn, K., & Borgwardt, K. M. (2010) · Max Planck Digital Library · Cited by 1,644
Identifying Resilient Communities in Road Networks: A Path-Based Embedding Approach
Wagner, C., Dodge, S., & Alizadeh, D. (2025) · Leibniz international proceedings in informatics · doi:10.4230/lipics.giscience.2025.9 · Cited by 1,543
An End-to-End Deep Learning Architecture for Graph Classification
Zhang, M., Cui, Z., Neumann, M., & Chen, Y. (2018) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v32i1.11782 · Cited by 1,461
Deep Convolutional Networks on Graph-Structured Data
Henaff, M., Bruna, J., & LeCun, Y. (2015) · arXiv · doi:10.48550/arxiv.1506.05163 · Cited by 1,255
Kernel k-means: spectral clustering and normalized cuts
Dhillon, I. S., Guan, Y., & Kulis, B. (2004) · Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1014052.1014118 · Cited by 1,193
Simplifying Graph Convolutional Networks
Wu, F., Zhang, T., Junior, A. H. D. S., Fifty, C., Yu, T., & Weinberger, K. Q. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1902.07153 · Cited by 1,165
Fast Graph Representation Learning with PyTorch Geometric
Fey, M., & Lenssen, J. E. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1903.02428 · Cited by 1,132
Weighted Graph Cuts without Eigenvectors A Multilevel Approach
Dhillon, I. S., Guan, Y., & Kulis, B. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.1115 · Cited by 1,003
Diffusion-Convolutional Neural Networks
Atwood, J. R., & Towsley, D. (2016) · neural information processing systems · Cited by 925
Representation Learning on Graphs with Jumping Knowledge Networks
Xu, K., Li, C., Tian, Y., Sonobe, T., Kawarabayashi, K., & Jegelka, S. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1806.03536 · Cited by 891
Hierarchical Graph Representation Learning with Differentiable Pooling
Ying, R., You, J., Morris, C., Ren, X., Hamilton, W. L., & Leskovec, J. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1806.08804 · Cited by 798
Learning Convolutional Neural Networks for Graphs
Niepert, M., Ahmed, M. M., & Kutzkov, K. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1605.05273 · Cited by 775
Predict then Propagate: Graph Neural Networks meet Personalized PageRankPreprint
Klicpera, J., Bojchevski, A., & Günnemann, S. (2018) · arXiv (Cornell University) · Cited by 756
Modern temporal network theory: a colloquium
Holme, P. (2015) · The European Physical Journal B · doi:10.1140/epjb/e2015-60657-4 · Cited by 734
CayleyNets: Graph Convolutional Neural Networks With Complex Rational Spectral Filters
Levie, R., Monti, F., Bresson, X., & Bronstein, M. M. (2019) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2018.2879624 · Cited by 685
Neural Network for Graphs: A Contextual Constructive Approach
Micheli, A. (2009) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2008.2010350 · Cited by 639
Discrete-Time Signal Processing
Jenkins, W. K., Jones, D. L., & Hunsinger, B. J. (2002) · Reference Data for Engineers · doi:10.1016/b978-075067291-7/50030-3 · Cited by 536
Predict then Propagate: Graph Neural Networks meet Personalized PageRank
Gasteiger, J., Bojchevski, A., & Günnemann, S. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1810.05997 · Cited by 409
Recurrent Neural Networks for Short-Term Load Forecasting: An Overview and Comparative Analysis
Bianchi, F. M., Maiorino, E., Kampffmeyer, M. C., Rizzi, A., & Jenssen, R. (2017) · SpringerBriefs in Computer Science · doi:10.1007/978-3-319-70338-1 · Cited by 280
Self-citationAutoregressive Moving Average Graph Filtering
Isufi, E., Loukas, A., Simonetto, A., & Leus, G. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2614793 · Cited by 264
Signal processing techniques for interpolation in graph structured data
Narang, S. K., Gadde, A., & Ortega, A. (2013) · 2013 IEEE International Conference on Acoustics, Speech and Signal Processing · doi:10.1109/icassp.2013.6638704 · Cited by 229
Revisiting Graph Neural Networks: All We Have is Low-Pass Filters
Nt, H., & Maehara, T. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1905.09550 · Cited by 221
Gallicchio, C., & Micheli, A. (2010) · The 2010 International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.2010.5596796 · Cited by 210
Graph Neural Networks in TensorFlow and Keras with Spektral [Application Notes]
Grattarola, D., & Alippi, C. (2021) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2020.3039072 · Cited by 205
Self-citationAn overview and comparative analysis of Recurrent Neural Networks for Short Term Load Forecasting
Bianchi, F. M., Maiorino, E., Kampffmeyer, M., Rizzi, A., & Jenssen, R. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1705.04378 · Cited by 182
Self-citationA Multiscale Pyramid Transform for Graph Signals
Shuman, D. I., Faraji, M. J., & Vandergheynst, P. (2016) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2512529 · Cited by 159
Chebyshev polynomial approximation for distributed signal processing
Shuman, D. I., Vandergheynst, P., & Frossard, P. (2011) · International Conference on Distributed Computing in Smart Systems and the Internet of Things (DCOSS-IoT) · doi:10.1109/dcoss.2011.5982158 · Cited by 158
LanczosNet: Multi-Scale Deep Graph Convolutional Networks
Liao, R., Zhao, Z., Urtasun, R., & Zemel, R. S. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1901.01484 · Cited by 158
Distributed Autoregressive Moving Average Graph Filters
Loukas, A., Simonetto, A., & Leus, G. J. T. (2015) · IEEE Signal Processing Letters · doi:10.1109/lsp.2015.2448655 · Cited by 120
Design of Graph Filters and Filterbanks
Tremblay, N., Gonçalvès, P., & Borgnat, P. (2018) · Elsevier eBooks · doi:10.1016/b978-0-12-813677-5.00011-0 · Cited by 114
Graph convolutional neural networks via scattering
Zou, D., & Lerman, G. (2019) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2019.06.003 · Cited by 96
Accelerated filtering on graphs using Lanczos methodPreprint
Šušnjara, A., Perraudin, N., Kreßner, D., & Vandergheynst, P. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1509.04537 · Cited by 70
On the Transferability of Spectral Graph Filters
Levie, R., Isufi, E., & Gitta Kutyniok, B. (2019) · International Conference on Sampling Theory and Applications · doi:10.1109/sampta45681.2019.9030932 · Cited by 62
Fast and Deep Graph Neural Networks
Gallicchio, C., & Micheli, A. (2020) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v34i04.5803 · Cited by 60
Stability of Graph Scattering TransformsPreprint
Gama, F., Bruna, J., & Ribeiro, A. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1906.04784 · Cited by 59
Change Detection in Graph Streams by Learning Graph Embeddings on Constant-Curvature Manifolds
Grattarola, D., Zambon, D., Livi, L., & Alippi, C. (2019) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2019.2927301 · Cited by 57
Self-citationDynamical Systems as Temporal Feature SpacesPreprint
Peter Tiňo, B. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1907.06382 · Cited by 18
Column Networks for Collective Classification
Pham, T., Tran, T., Phung, D., & Venkatesh, S. (2017) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v31i1.10851 · Cited by 3
MATHICSE Technical Report : Accelerated filtering on graphs using Lanczos method
Šušnjara, A., Perraudin, N., Kreßner, D., & Vandergheynst, P. (2019) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · doi:10.5075/epfl-mathicse-272825 · Cited by 1
Chen, T., Wang, Z., Li, L., Li, D., Li, Z., Chang, X., Bian, P., Liang, G., Wang, Q., & Xie, T. (2025) · Schloss Dagstuhl – Leibniz-Zentrum für Informatik · doi:10.4230/lipics.ecoop.2025.6
Cited by
Fast Graph Representation Learning with PyTorch Geometric
Fey, M., & Lenssen, J. E. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1903.02428 · Cited by 1,132
Chen, D., Lin, Y., Li, W., Li, P., Zhou, J., & Sun, X. (2020) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v34i04.5747 · Cited by 1,043
Graph Information Aggregation Cross-Domain Few-Shot Learning for Hyperspectral Image Classification
Zhang, Y., Li, W., Zhang, M., Wang, S., Tao, R., & Du, Q. (2024) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2022.3185795 · Cited by 340
Metadata
- Authors
- Bianchi, F. M., Grattarola, D., Livi, L., & Alippi, C.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2021
- Volume
- 44
- Issue
- 7
- Pages
- 1-1
- ISSN
- 0162-8828 (ISSN-L)
- 2160-9292
- 1939-3539
- OpenAlex
- W2912636151
- Cited by
- 426
- References
- 61
- FWCI
- 25.94
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.