Sampling and Recovery of Graph Signals based on Graph Neural Networks
arXiv:2011.01412
Abstract
We propose interpretable graph neural networks for sampling and recovery of graph signals, respectively. To take informative measurements, we propose a new graph neural sampling module, which aims to select those vertices that maximally express their corresponding neighborhoods. Such expressiveness can be quantified by the mutual information between vertices' features and neighborhoods' features, which are estimated via a graph neural network. To reconstruct an original graph signal from the sampled measurements, we propose a graph neural recovery module based on the algorithm-unrolling technique. Compared to previous analytical sampling and recovery, the proposed methods are able to flexibly learn a variety of graph signal models from data by leveraging the learning ability of neural networks; compared to previous neural-network-based sampling and recovery, the proposed methods are designed through exploiting specific graph properties and provide interpretability. We further design a new multiscale graph neural network, which is a trainable multiscale graph filter bank and can handle various graph-related learning tasks. The multiscale network leverages the proposed graph neural sampling and recovery modules to achieve multiscale representations of a graph. In the experiments, we illustrate the effects of the proposed graph neural sampling and recovery modules and find that the modules can flexibly adapt to various graph structures and graph signals. In the task of active-sampling-based semi-supervised learning, the graph neural sampling module improves the classification accuracy over 10% in Cora dataset. We further validate the proposed multiscale graph neural network on several standard datasets for both vertex and graph classification. The results show that our method consistently improves the classification accuracies.
References in corpus (20)
- The Emerging Field of Signal Processing on Graphs: Extending High-Dimensional Data Analysis to Networks and Other Irregular Domains
- Inductive Representation Learning on Large Graphs
- Neural Message Passing for Quantum Chemistry
- Geometric deep learning: going beyond Euclidean data
- Learning deep representations by mutual information estimation and maximization
- Discrete Signal Processing on Graphs
- Discrete Signal Processing on Graphs: Sampling Theory
- Learning graphs from data: A signal representation perspective
- Perfect Reconstruction Two-Channel Wavelet Filter-Banks for Graph Structured Data
- Efficient Sampling Set Selection for Bandlimited Graph Signals Using Graph Spectral Proxies
- Convolutional Neural Network Architectures for Signals Supported on Graphs
- Signal Recovery on Graphs: Variation Minimization
- Sampling of graph signals with successive local aggregations
- Adaptive Sampling Towards Fast Graph Representation Learning
- Fast Resampling of 3D Point Clouds via Graphs
- Two-Channel Critically-Sampled Graph Filter Banks With Spectral Domain Sampling
- Fast Graph Sampling Set Selection Using Gershgorin Disc Alignment
- Generalized Sampling on Graphs With Subspace and Smoothness Priors
- Stability of Graph Scattering Transforms
- Random sampling of bandlimited signals on graphs