Skip to main page content
U.S. flag

An official website of the United States government

Dot gov

The .gov means it’s official.
Federal government websites often end in .gov or .mil. Before sharing sensitive information, make sure you’re on a federal government site.

Https

The site is secure.
The https:// ensures that you are connecting to the official website and that any information you provide is encrypted and transmitted securely.

Access keys NCBI Homepage MyNCBI Homepage Main Content Main Navigation
. 2024:72:2939-2952.
doi: 10.1109/tsp.2024.3378001. Epub 2024 Mar 18.

Learnable Filters for Geometric Scattering Modules

Affiliations

Learnable Filters for Geometric Scattering Modules

Alexander Tong et al. IEEE Trans Signal Process. 2024.

Abstract

We propose a new graph neural network (GNN) module, based on relaxations of recently proposed geometric scattering transforms, which consist of a cascade of graph wavelet filters. Our learnable geometric scattering (LEGS) module enables adaptive tuning of the wavelets to encourage band-pass features to emerge in learned representations. The incorporation of our LEGS-module in GNNs enables the learning of longer-range graph relations compared to many popular GNNs, which often rely on encoding graph structure via smoothness or similarity between neighbors. Further, its wavelet priors result in simplified architectures with significantly fewer learned parameters compared to competing GNNs. We demonstrate the predictive performance of LEGS-based networks on graph classification benchmarks, as well as the descriptive quality of their learned features in biochemical graph data exploration tasks. Our results show that LEGS-based networks match or outperforms popular GNNs, as well as the original geometric scattering construction, on many datasets, in particular in biochemical domains, while retaining certain mathematical properties of handcrafted (non-learned) geometric scattering.

Keywords: Geometric Scattering; Graph Neural Networks; Graph Signal Processing.

PubMed Disclaimer

Figures

Fig. 4.
Fig. 4.
Two graphs with similar structure consisting of an 8-cycle. Each cycle has two nodes that are connected to another node, which (with respected to shortest-path distance) are 3 steps (a) and 4 steps (b) apart, respectively.
Fig. 1.
Fig. 1.
LEGS module learns to select the appropriate scattering scales from the data.
Fig. 2.
Fig. 2.
Enzyme class exchange preferences empirically observed in [32], and estimated from LEGS and GCN embeddings.
Fig. 3.
Fig. 3.
CASP dataset LEGS-FCN % decrease over GCN in MSE of GDT prediction vs. Average GDT score.

References

    1. Bronstein M, Bruna J, LeCun Y, Szlam A, and Vandergheynst P, “Geometric deep learning: Going beyond Euclidean data,” IEEE Signal Process. Mag, 2017.
    1. Bruna J, Zaremba W, Szlam A, and LeCun Y, “Spectral networks and locally connected networks on graphs,” in Proc. of ICLR, 2014.
    1. Defferrard M, Bresson X, and Vandergheynst P, “Convolutional neural networks on graphs with fast localized spectral filtering,” Adv. in NeurIPS 29, 2016.
    1. Kipf T and Welling M, “Semi-supervised classification with graph convolutional networks,” Proc. of ICLR, 2016.
    1. Hamilton W, Ying R, and Leskovec J, “Inductive representation learning on large graphs,” Adv. in NeurIPS 30, 2017.

LinkOut - more resources