Robust Network Topology Inference and Processing of Graph Signals
Samuel Rey

TL;DR
This paper advances graph signal processing by developing robust algorithms that jointly address perturbations in both graph topology and signals, improving the reliability of processing large, complex systems.
Contribution
It introduces a novel framework for robust GSP that accounts for perturbations in graph support and signals, a relatively unexplored area in the field.
Findings
Analyzes the impact of perturbations on GSP tasks
Designs algorithms to mitigate perturbation effects
Demonstrates improved robustness in complex systems
Abstract
The abundance of large and heterogeneous systems is rendering contemporary data more pervasive, intricate, and with a non-regular structure. With classical techniques facing troubles to deal with the irregular (non-Euclidean) domain where the signals are defined, a popular approach at the heart of graph signal processing (GSP) is to: (i) represent the underlying support via a graph and (ii) exploit the topology of this graph to process the signals at hand. In addition to the irregular structure of the signals, another critical limitation is that the observed data is prone to the presence of perturbations, which, in the context of GSP, may affect not only the observed signals but also the topology of the supporting graph. Ignoring the presence of perturbations, along with the couplings between the errors in the signal and the errors in their support, can drastically hinder estimation…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks · Complex Network Analysis Techniques · Bioinformatics and Genomic Networks
MethodsNone
