Geometric Scattering on Measure Spaces

Abstract

The scattering transform is a multilayered, wavelet-based transform initially introduced as a model of convolutional neural networks (CNNs) that has played a foundational role in our understanding of these networks' stability and invariance properties. Subsequently, there has been widespread interest in extending the success of CNNs to data sets with non-Euclidean structure, such as graphs and manifolds, leading to the emerging field of geometric deep learning. In order to improve our understanding of the architectures used in this new field, several papers have proposed generalizations of the scattering transform for non-Euclidean data structures such as undirected graphs and compact Riemannian manifolds without boundary. In this paper, we introduce a general, unified model for geometric scattering on measure spaces. Our proposed framework includes previous work on geometric scattering as special cases but also applies to more general settings such as directed graphs, signed graphs, and manifolds with boundary. We propose a new criterion that identifies to which groups a useful representation should be invariant and show that this criterion is sufficient to guarantee that the scattering transform has desirable stability and invariance properties. Additionally, we consider finite measure spaces that are obtained from randomly sampling an unknown manifold. We propose two methods for constructing a data-driven graph on which the associated graph scattering transform approximates the scattering transform on the underlying manifold. Moreover, we use a diffusion-maps based approach to prove quantitative estimates on the rate of convergence of one of these approximations as the number of sample points tends to infinity. Lastly, we showcase the utility of our method on spherical images, directed graphs, and on high-dimensional single-cell data.

References in corpus (13)

• The Emerging Field of Signal Processing on Graphs: Extending High-Dimensional Data Analysis to Networks and Other Irregular Domains
• Geometric deep learning: going beyond Euclidean data
• Signal Processing on Higher-Order Networks: Livin' on the Edge ... and Beyond
• Graph Convolutional Neural Networks via Scattering
• Magnetic eigenmaps for community detection in directed networks
• Analysis of time-frequency scattering transforms
• Path-Based Spectral Clustering: Guarantees, Robustness to Outliers, and Fast Algorithms
• Magnetic Eigenmaps for the Visualization of Directed Networks
• Eigen-convergence of Gaussian kernelized graph Laplacian by manifold heat interpolation
• Characterization and comparison of large directed graphs through the spectra of the magnetic Laplacian
• Regularized spectral methods for clustering signed networks
• Generalization Analysis of Message Passing Neural Networks on Large Random Graphs
• Can Hybrid Geometric Scattering Networks Help Solve the Maximum Clique Problem?

Cited by in corpus (1)

• Energy Propagation in Scattering Convolution Networks Can Be Arbitrarily Slow