FiGLearn: Filter and Graph Learning using Optimal Transport
- URL: http://arxiv.org/abs/2010.15457v1
- Date: Thu, 29 Oct 2020 10:00:42 GMT
- Title: FiGLearn: Filter and Graph Learning using Optimal Transport
- Authors: Matthias Minder and Zahra Farsijani and Dhruti Shah and Mireille El
Gheche and Pascal Frossard
- Abstract summary: We introduce a novel graph signal processing framework for learning the graph and its generating filter from signal observations.
We show how this framework can be used to infer missing values if only very little information is available.
- Score: 49.428169585114496
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: In many applications, a dataset can be considered as a set of observed
signals that live on an unknown underlying graph structure. Some of these
signals may be seen as white noise that has been filtered on the graph topology
by a graph filter. Hence, the knowledge of the filter and the graph provides
valuable information about the underlying data generation process and the
complex interactions that arise in the dataset. We hence introduce a novel
graph signal processing framework for jointly learning the graph and its
generating filter from signal observations. We cast a new optimisation problem
that minimises the Wasserstein distance between the distribution of the signal
observations and the filtered signal distribution model. Our proposed method
outperforms state-of-the-art graph learning frameworks on synthetic data. We
then apply our method to a temperature anomaly dataset, and further show how
this framework can be used to infer missing values if only very little
information is available.
Related papers
- Diffusion Maps for Signal Filtering in Graph Learning [0.0]
The paper showcases the effectiveness of this approach through examples involving synthetically generated and real-world temperature sensor data.
The results provide new approaches for the analysis and understanding of complex, non-Euclidean data structures.
arXiv Detail & Related papers (2023-12-22T15:17:44Z) - Graph Filters for Signal Processing and Machine Learning on Graphs [83.29608206147515]
We provide a comprehensive overview of graph filters, including the different filtering categories, design strategies for each type, and trade-offs between different types of graph filters.
We discuss how to extend graph filters into filter banks and graph neural networks to enhance the representational power.
Our aim is that this article provides a unifying framework for both beginner and experienced researchers, as well as a common understanding.
arXiv Detail & Related papers (2022-11-16T11:56:45Z) - Distributed Graph Learning with Smooth Data Priors [61.405131495287755]
We propose a novel distributed graph learning algorithm, which permits to infer a graph from signal observations on the nodes.
Our results show that the distributed approach has a lower communication cost than a centralised algorithm without compromising the accuracy in the inferred graph.
arXiv Detail & Related papers (2021-12-11T00:52:02Z) - Message Passing in Graph Convolution Networks via Adaptive Filter Banks [81.12823274576274]
We present a novel graph convolution operator, termed BankGCN.
It decomposes multi-channel signals on graphs into subspaces and handles particular information in each subspace with an adapted filter.
It achieves excellent performance in graph classification on a collection of benchmark graph datasets.
arXiv Detail & Related papers (2021-06-18T04:23:34Z) - Unrolling of Deep Graph Total Variation for Image Denoising [106.93258903150702]
In this paper, we combine classical graph signal filtering with deep feature learning into a competitive hybrid design.
We employ interpretable analytical low-pass graph filters and employ 80% fewer network parameters than state-of-the-art DL denoising scheme DnCNN.
arXiv Detail & Related papers (2020-10-21T20:04:22Z) - Graph Convolution with Low-rank Learnable Local Filters [32.00396411583352]
This paper introduces a new type of graph convolution with learnable low-rank local filters.
It is provably more expressive than previous spectral graph convolution methods.
The representation against input graph data is theoretically proved, making use of the graph filter locality and the local graph regularization.
arXiv Detail & Related papers (2020-08-04T20:34:59Z) - A User Guide to Low-Pass Graph Signal Processing and its Applications [31.90359683602266]
We show how to leverage properties of low-pass graph filters to learn the graph topology or identify its community structure.
We illustrate how to represent graph data through sampling, recover missing measurements, and de-noise graph data.
arXiv Detail & Related papers (2020-08-04T03:27:17Z) - Localized Spectral Graph Filter Frames: A Unifying Framework, Survey of
Design Considerations, and Numerical Comparison (Extended Cut) [1.52292571922932]
Representing data residing on a graph as a linear combination of building block signals can enable efficient and insightful visual or statistical analysis of the data.
We survey a particular class of dictionaries called localized spectral graph filter frames.
We emphasize computationally efficient methods that ensure the resulting transforms and their inverses can be applied to data residing on large, sparse graphs.
arXiv Detail & Related papers (2020-06-19T16:49:33Z) - Graph Pooling with Node Proximity for Hierarchical Representation
Learning [80.62181998314547]
We propose a novel graph pooling strategy that leverages node proximity to improve the hierarchical representation learning of graph data with their multi-hop topology.
Results show that the proposed graph pooling strategy is able to achieve state-of-the-art performance on a collection of public graph classification benchmark datasets.
arXiv Detail & Related papers (2020-06-19T13:09:44Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.