Dynamic Average Diffusion with randomized Coordinate Updates

10/21/2018
by   Bicheng Ying, et al.
0

This work derives and analyzes an online learning strategy for tracking the average of time-varying distributed signals by relying on randomized coordinate-descent updates. During each iteration, each agent selects or observes a random entry of the observation vector, and different agents may select different entries of their observations before engaging in a consultation step. Careful coordination of the interactions among agents is necessary to avoid bias and ensure convergence. We provide a convergence analysis for the proposed methods, and illustrate the results by means of simulations.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/05/2018

Accelerated Randomized Coordinate Descent Methods for Stochastic Optimization and Online Learning

We propose accelerated randomized coordinate descent algorithms for stoc...
research
09/18/2016

On Randomized Distributed Coordinate Descent with Quantized Updates

In this paper, we study the randomized distributed coordinate descent al...
research
09/09/2018

SEGA: Variance Reduction via Gradient Sketching

We propose a randomized first order optimization method--SEGA (SkEtched ...
research
10/01/2014

Risk Dynamics in Trade Networks

We introduce a new framework to model interactions among agents which se...
research
09/29/2021

Random coordinate descent algorithm for open multi-agent systems with complete topology and homogeneous agents

We study the convergence in expectation of the Random Coordinate Descent...
research
06/02/2023

Linearly convergent adjoint free solution of least squares problems by random descent

We consider the problem of solving linear least squares problems in a fr...

Please sign up or login with your details

Forgot password? Click here to reset