Online Distributed Learning over Graphs with Multitask Graph-Filter Models

Abstract

In this work, we are interested in adaptive and distributed estimation of graph filters from streaming data. We formulate this problem as a consensus estimation problem over graphs, which can be addressed with diffusion LMS strategies. Most popular graph-shift operators such as those based on the graph Laplacian matrix, or the adjacency matrix, are not energy preserving. This may result in an ill-conditioned estimation problem, and reduce the convergence speed of the distributed algorithms. To address this issue and improve the transient performance, we introduce a preconditioned graph diffusion LMS algorithm. We also propose a computationally efficient version of this algorithm by approximating the Hessian matrix with local information. Performance analyses in the mean and mean-square sense are provided. Finally, we consider a more general problem where the filter coefficients to estimate may vary over the graph. To avoid a large estimation bias, we introduce an unsupervised clustering method for splitting the global estimation problem into local ones. Numerical results show the effectiveness of the proposed algorithms and validate the theoretical results.

arXiv comment14 pages, 13 figures

References in corpus (21)

• The Emerging Field of Signal Processing on Graphs: Extending High-Dimensional Data Analysis to Networks and Other Irregular Domains
• Discrete Signal Processing on Graphs
• Discrete Signal Processing on Graphs: Sampling Theory
• Efficient Sampling Set Selection for Bandlimited Graph Signals Using Graph Spectral Proxies
• Signals on Graphs: Uncertainty Principle and Sampling
• Convolutional Neural Network Architectures for Signals Supported on Graphs
• GSPBOX: A toolbox for signal processing on graphs
• Autoregressive Moving Average Graph Filtering
• Diffusion LMS over Multitask Networks
• Signal Processing on Graphs: Causal Modeling of Unstructured Data
• Forecasting Time Series with VARMA Recursions on Graphs
• Distributed Clustering and Learning Over Networks
• Adaptive Graph Signal Processing: Algorithms and Optimal Sampling Strategies
• Advances in Distributed Graph Filtering
• Distributed Autoregressive Moving Average Graph Filters
• Filtering Random Graph Processes Over Random Time-Varying Graphs
• Proximal Multitask Learning over Networks with Sparsity-inducing Coregularization
• Distributed Adaptive Learning of Graph Signals
• Decentralized Online Learning with Kernels
• Decentralized Clustering and Linking by Networked Agents
• Observing and Tracking Bandlimited Graph Processes