Decentralized Online Regularized Learning Over Random Time-Varying Graphs

by   Xiwei Zhang, et al.

We study the decentralized online regularized linear regression algorithm over random time-varying graphs. At each time step, every node runs an online estimation algorithm consisting of an innovation term processing its own new measurement, a consensus term taking a weighted sum of estimations of its own and its neighbors with additive and multiplicative communication noises and a regularization term preventing over-fitting. It is not required that the regression matrices and graphs satisfy special statistical assumptions such as mutual independence, spatio-temporal independence or stationarity. We develop the nonnegative supermartingale inequality of the estimation error, and prove that the estimations of all nodes converge to the unknown true parameter vector almost surely if the algorithm gains, graphs and regression matrices jointly satisfy the sample path spatio-temporal persistence of excitation condition. Especially, this condition holds by choosing appropriate algorithm gains if the graphs are uniformly conditionally jointly connected and conditionally balanced, and the regression models of all nodes are uniformly conditionally spatio-temporally jointly observable, under which the algorithm converges in mean square and almost surely. In addition, we prove that the regret upper bound 𝒪(T^1-τln T), where τ∈ (0.5,1) is a constant depending on the algorithm gains.

∙ 08/22/2019

Distributed Cooperative Online Estimation With Random Observation Matrices, Communication Graphs and Time-Delays

We analyze convergence of distributed cooperative online estimation algo...
∙ 03/20/2023

Random Inverse Problems Over Graphs: Decentralized Online Learning

We establish a framework of random inverse problems with real-time obser...
∙ 05/24/2023

On the Minimax Regret for Online Learning with Feedback Graphs

In this work, we improve on the upper and lower bounds for the regret of...
∙ 09/02/2022

Spatio-Temporal Attack Course-of-Action (COA) Search Learning for Scalable and Time-Varying Networks

One of the key topics in network security research is the autonomous COA...
∙ 10/04/2022

Improved High-Probability Regret for Adversarial Bandits with Time-Varying Feedback Graphs

We study high-probability regret bounds for adversarial K-armed bandits ...
∙ 11/13/2018

Quickest Detection of Time-Varying False Data Injection Attacks in Dynamic Linear Regression Models

Motivated by the sequential detection of false data injection attacks (F...

Please sign up or login with your details

Forgot password? Click here to reset