Fetching the paper…
Reading the bibliography…
Graph neural networks (GNNs) have emerged as a powerful tool for nonlinear processing of graph signals, exhibiting success in recommender systems, power outage prediction, and motion planning, among others.
I. Daubechies, Ten Lectures on Wavelets , ser. CBMS-NSF Regional Conf. Series Appl. Math. Philadelphia, PA: SIAM, 1992, vol. 61
1992
Earlier work this paper cites.
2001
Earlier work this paper cites.
2003
Earlier work this paper cites.
R. R. Coifman and S. Lafon, “Diffusion maps,” Appl. Comput. Harmonic Anal. , vol. 21, no. 1, pp. 5–30, July 2006
2006
Earlier work this paper cites.
R. R. Coifman and M. Maggioni, “Diffusion wavelets,” Appl. Comput. Harmonic Anal. , vol. 21, no. 1, pp. 53–94, July 2006
2006
Earlier work this paper cites.
D. K. Hammond, P. Vandergheynst, and R. Gribonval, “Wavelets on graphs via spectral graph theory,” Appl. Comput. Harmonic Anal. , vol. 30, no. 2, pp. 129–150, March 2011
2011
Earlier work this paper cites.
S. Mallat, “Group invariant scattering,” Commun. Pure, Appl. Math. , vol. 65, no. 10, pp. 1331–1398, Oct. 2012
2012
Earlier work this paper cites.
J. Bruna and S. Mallat, “Invariant scattering convolution networks,” IEEE Trans. Pattern Anal. Mach. Intell. , vol. 35, no. 8, pp. 1872–1886, Aug. 2013
2013
Earlier work this paper cites.
D. I. Shuman, S. K. Narang, P. Frossard, A. Ortega, and P. Vandergheynst, “The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains,” IEEE Signal Process. Mag. , vol. 30, no. 3, pp. 83–98, May 2013
2013
Earlier work this paper cites.
A. Sandyhaila and J. M. F. Moura, “Discrete signal processing on graphs: Frequency analysis,” IEEE Trans. Signal Process. , vol. 62, no. 12, pp. 3042–3054, June 2014
2014
Earlier work this paper cites.
J. Bruna, W. Zaremba, A. Szlam, and Y. LeCun, “Spectral networks and deep locally connected networks on graphs,” in 2nd Int. Conf. Learning Representations , Banff, AB, 14-16 Apr. 2014, pp. 1–14
2014
Earlier work this paper cites.
Y. LeCun, Y. Bengio, and G. Hinton, “Deep learning,” Nature , vol. 521, no. 7553, pp. 85–117, 2015
2015
Earlier work this paper cites.
D. I. Shuman, C. Wiesmeyr, N. Holighaus, and P. Vandergheynst, “Spectrum-adapted tight graph wavelet and vertex-frequency frames,” IEEE Trans. Signal Process. , vol. 63, no. 16, pp. 4223–4235, Aug. 2015
2015
Earlier work this paper cites.
I. Goodfellow, Y. Bengio, and A. Courville, Deep Learning , ser. The Adaptive Computation and Machine Learning Series. Cambridge, MA: The MIT Press, 2016
2016
Cited alongside, same era.
M. Defferrard, X. Bresson, and P. Vandergheynst, “Convolutional neural networks on graphs with fast localized spectral filtering,” in 30th Conf. Neural Inform. Process. Syst. Barcelona, Spain: Neural Inform. Process. Found., 5-10 Dec. 2016, pp. 3844–3858
2016
Cited alongside, same era.
F. M. Harper and J. A. Konstan, “The MovieLens datasets: History and context,” ACM Trans. Interactive Intell. Syst. , vol. 5, no. 4, pp. 19:(1–19), Jan. 2016
2016
Cited alongside, same era.
S. Segarra, A. G. Marques, and A. Ribeiro, “Optimal graph-filter design and applications to distributed linear network operators,” IEEE Trans. Signal Process. , vol. 65, no. 15, pp. 4117–4131, Aug. 2017
2017
Cited alongside, same era.
E. Tolstaya, F. Gama, J. Paulos, G. Pappas, V. Kumar, and A. Ribeiro, “Learning decentralized controllers for robot swarms with graph neural networks,” in Conf. Robot Learning 2019 , vol. 100. Osaka, Japan: Proc. Mach. Learning Res., 30 Oct.-1 Nov. 2019, pp. 671–682
2019
Closest in time.
F. Gama, A. Ribeiro, and J. Bruna, “Diffusion scattering transforms on graphs,” in 7th Int. Conf. Learning Representations , New Orleans, LA, 6-9 May 2019, pp. 1–12
2019
Closest in time.
R. Levie, E. Isufi, and G. Kutyniok, “On the transferability of spectral graph filters,” in 13th Int. Conf. Sampling Theory Applications . Bordeaux, France: IEEE, 8-12 July 2019, pp. 1–5
2019
Closest in time.
K. Xu, W. Hu, J. Leskovec, and S. Jegelka, “How powerful are graph neural networks?” in 7th Int. Conf. Learning Representations , New Orleans, LA, 6-9 May 2019, pp. 1–17
2019
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
T. N. Kipf and M. Welling, “Semi-supervised classification with graph convolutional networks,” in 5th Int. Conf. Learning Representations , Toulon, France, 24-26 Apr. 2017
2017
Cited alongside, same era.
2017
Cited alongside, same era.
R. Ying, R. He, K. Chen, P. Eksombatchai, W. Hamilton, and J. Leskovec, “Graph convolutional neural networks for web-scale recommender systems,” in 24th ACM SIGKDD Int. Conf. Knowledge Discovery & Data Mining . London, United Kingdom: Assoc. Comput. Mach., 19-23 Aug. 2018, pp. 974–983
2018
Cited alongside, same era.
D. Owerko, F. Gama, and A. Ribeiro, “Predicting power outages using graph neural networks,” in IEEE Global Conf. Signal and Inform. Process. 2018 . Anaheim, CA: IEEE, 26-29 Nov. 2018, pp. 743–747
2018
Cited alongside, same era.
D. Zügner, A. Akbarnejad, and S. Günnemann, “Adversarial attacks on neural networks for graph data,” in 24th ACM SIGKDD Int. Conf. Knowledge Discovery & Data Mining . London, United Kingdom: Assoc. Comput. Mach., 19-23 Aug. 2018, pp. 2847–2856
2018
Cited alongside, same era.
J. Dai, J. Li, T. Tian, X. Huang, X. Wang, J. Zu, and L. Song, “Adversarial attack on graph structured data,” in 35th Int. Conf. Mach. Learning . Stockholm, Sweden: Proc. Mach. Learning Res., 10-15 July 2018, pp. 1115–1124
2018
Cited alongside, same era.
W. Huang, A. G. Marques, and A. Ribeiro, “Rating prediction via graph signal processing,” IEEE Trans. Signal Process. , vol. 66, no. 19, pp. 5066–5081, Oct. 2018
2018
Cited alongside, same era.
D. Yin, R. G. Lopes, J. Shlens, E. D. Cubuk, and J. Gilmer, “A fourier perspective on model robustness in computer vision,” in 33rd Conf. Neural Inform. Process. Syst. Vancouver, BC: Neural Inform. Process. Syst. Found., 8-14 Dec. 2019, pp. 13 276–13 286
2019
Cited alongside, same era.
H. Maron, H. Ben-Hamu, N. Shamir, and Y. Lipman, “Invariant and equivariant graph networks,” in 7th Int. Conf. Learning Representations , New Orleans, LA, 6-9 May 2019, pp. 1–14
2019
Closest in time.
N. Keriven and G. Peyré, “Universal invariant and equivariant graph neural networks,” in 33rd Conf. Neural Inform. Process. Syst. Vancouver, BC: Neural Inform. Process. Syst. Found., 8-14 Dec. 2019, pp. 7092–7101
2019
Closest in time.
A. Bojchevski and S. Günnemann, “Certifiable robustness to graph perturbations,” in 33rd Conf. Neural Inform. Process. Syst. Vancouver, BC: Neural Inform. Process. Syst. Found., 8-14 Dec. 2019, pp. 8319–8330
2019
Closest in time.
D. Zügner and S. Günnemann, “Certifiable robustness and robust training for graph convolutional networks,” in 25th ACM SIGKDD Int. Conf. Knowledge Discovery & Data Mining . Anchorage, AK: Assoc. Comput. Mach., 4-8 Aug. 2019, pp. 246–256
2019
Closest in time.
F. Gama, A. G. Marques, G. Leus, and A. Ribeiro, “Convolutional graph neural networks,” in 53rd Asilomar Conf. Signals, Systems and Comput. Pacific Grove, CA: IEEE, 3-6 Nov. 2019
2019
Closest in time.
H. Wang, X. Wu, Z. Huang, and E. P. Xing, “High-frequency component helps explain the generalization of convolutional neural networks,” in 2020 Conf. Comput. Vision and Pattern Recognition . Comput. Vision Found., 14-19 June 2020, pp. 8684–8694
2020
Closest in time.
——, “Optimal power flow using graph neural networks,” in 45th IEEE Int. Conf. Acoust., Speech and Signal Process. Barcelona, Spain: IEEE, 4-8 May 2020
2020
Closest in time.
Q. Li, F. Gama, A. Ribeiro, and A. Prorok, “Graph neural networks for decentralized multi-robot path planning,” in 19th Int. Conf. Autonomous Agents and Multi-Agent Syst. Auckland, New Zealand: IFAAMAS, 9-13 May 2020
2020
Closest in time.
D. Zou and G. Lerman, “Graph convolutional neural networks via scattering,” Appl. Comput. Harmonic Anal. , vol. 49, no. 3, pp. 1046–1074, Nov. 2020
2020
Closest in time.