Online Learning of Time-Varying Signals and Graphs
Lists
Only you see this
Abstract
The aim of this paper is to propose a method for online learning of time-varying graphs from noisy observations of smooth graph signals collected over the vertices. Starting from an initial graph, and assuming that the topology can undergo the perturbation of a small percentage of edges over time, the method is able to track the graph evolution by exploiting a small perturbation analysis of the Laplacian matrix eigendecomposition, while assuming that the graph signal is bandlimited. The proposed method alternates between estimating the time-varying graph signal and recovering the dynamic graph topology. Numerical results corroborate the effectiveness of the proposed learning strategy in the joint online recovery of graph signal and topology.
BibTeX
@inproceedings{sardellitti2021online,
author = {Stefania Sardellitti and Sergio Barbarossa and Paolo Di Lorenzo},
title = {{Online Learning of Time-Varying Signals and Graphs}},
booktitle = {IEEE International Conference on Acoustics, Speech and Signal Processing},
year = {2021},
url = {https://openreview.net/forum?id=dKy0WksACW},
}Loading related content...