Online Graph Learning under Smoothness Priors

03/05/2021
by   Seyed Saman Saboksayr, et al.
0

The growing success of graph signal processing (GSP) approaches relies heavily on prior identification of a graph over which network data admit certain regularity. However, adaptation to increasingly dynamic environments as well as demands for real-time processing of streaming data pose major challenges to this end. In this context, we develop novel algorithms for online network topology inference given streaming observations assumed to be smooth on the sought graph. Unlike existing batch algorithms, our goal is to track the (possibly) time-varying network topology while maintaining the memory and computational costs in check by processing graph signals sequentially-in-time. To recover the graph in an online fashion, we leverage proximal gradient (PG) methods to solve a judicious smoothness-regularized, time-varying optimization problem. Under mild technical conditions, we establish that the online graph learning algorithm converges to within a neighborhood of (i.e., it tracks) the optimal time-varying batch solution. Computer simulations using both synthetic and real financial market data illustrate the effectiveness of the proposed algorithm in adapting to streaming signals to track slowly-varying network connectivity.

READ FULL TEXT

page 1

page 2

page 3

page 4

page 5

research
10/22/2020

Online Time-Varying Topology Identification via Prediction-Correction Algorithms

Signal processing and machine learning algorithms for data supported ove...
research
10/17/2019

Optimization and Learning with Information Streams: Time-varying Algorithms and Applications

There is a growing cross-disciplinary effort in the broad domain of opti...
research
10/19/2021

Accelerated Graph Learning from Smooth Signals

We consider network topology identification subject to a signal smoothne...
research
07/17/2018

An Acceleration Scheme for Memory Limited, Streaming PCA

In this paper, we propose an acceleration scheme for online memory-limit...
research
10/21/2021

Learning Time-Varying Graphs from Online Data

This work proposes an algorithmic framework to learn time-varying graphs...
research
09/23/2013

Efficient Sampling from Time-Varying Log-Concave Distributions

We propose a computationally efficient random walk on a convex body whic...
research
03/10/2020

Methods of Adaptive Signal Processing on Graphs Using Vertex-Time Autoregressive Models

The concept of a random process has been recently extended to graph sign...

Please sign up or login with your details

Forgot password? Click here to reset