Online Filtering over Expanding Graphs
Bishwadeep Das, Elvin Isufi

TL;DR
This paper introduces an online learning method for updating graph filters on expanding graphs, enabling efficient real-time processing without retraining from scratch, and demonstrates its effectiveness through experiments.
Contribution
It proposes a novel online gradient descent approach for adaptive graph filtering on growing graphs, with theoretical regret bounds and practical validation.
Findings
The online filter performs comparably to offline baselines.
It outperforms existing competitive methods.
The approach is effective for signal interpolation on evolving graphs.
Abstract
Data processing tasks over graphs couple the data residing over the nodes with the topology through graph signal processing tools. Graph filters are one such prominent tool, having been used in applications such as denoising, interpolation, and classification. However, they are mainly used on fixed graphs although many networks grow in practice, with nodes continually attaching to the topology. Re-training the filter every time a new node attaches is computationally demanding; hence an online learning solution that adapts to the evolving graph is needed. We propose an online update of the filter, based on the principles of online machine learning. To update the filter, we perform online gradient descent, which has a provable regret bound with respect to the filter computed offline. We show the performance of our method for signal interpolation at the incoming nodes. Numerical results on…
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 · Recommender Systems and Techniques
