Efficient and Stable Graph Scattering Transforms via Pruning

    •  Ioannidis, V.N., Chen, S., Giannakis, G.B., "Efficient and Stable Graph Scattering Transforms via Pruning", IEEE Transactions on Pattern Analysis and Machine Intelligence, DOI: 10.1109/​TPAMI.2020.3025258, September 2020.
      BibTeX TR2021-018 PDF
      • @article{Ioannidis2021mar,
      • author = {Ioannidis, Vassilis N. and Chen, Siheng and Giannakis, Georgios B.},
      • title = {Efficient and Stable Graph Scattering Transforms via Pruning},
      • journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence},
      • year = 2020,
      • month = sep,
      • doi = {10.1109/TPAMI.2020.3025258},
      • url = {}
      • }
  • Research Area:

    Signal Processing


Graph convolutional networks (GCNs) have well-documented performance in various graph learning tasks, but their analysis is still at its infancy. Graph scattering transforms (GSTs) offer training-free deep GCN models that extract features from graph data, and are amenable to generalization and stability analyses. The price paid by GSTs is exponential complexity in space and time that increases with the number of layers. This discourages deployment of GSTs when a deep architecture is needed. The present work addresses the complexity limitation of GSTs by introducing an efficient so-termed pruned (p)GST approach. The resultant pruning algorithm is guided by a graph-spectruminspired criterion, and retains informative scattering features on-thefly while bypassing the exponential complexity associated with GSTs. Stability of the novel pGSTs is also established when the input graph data or the network structure are perturbed. Furthermore, the sensitivity of pGST to random and localized signal perturbations is investigated analytically and experimentally. Numerical tests showcase that pGST performs comparably to the baseline GST at considerable computational savings. Furthermore, pGST achieves comparable performance to stateof-the-art GCNs in graph and 3D point cloud classification tasks. Upon analyzing the pGST pruning patterns, it is shown that graph data in different domains call for different network architectures, and that the pruning algorithm may be employed to guide the design choices for contemporary GCNs.