Distributed Online Optimization in Dynamic Environments Using Mirror Descent

09/09/2016
by   Shahin Shahrampour, et al.
0

This work addresses decentralized online optimization in non-stationary environments. A network of agents aim to track the minimizer of a global time-varying convex function. The minimizer evolves according to a known dynamics corrupted by an unknown, unstructured noise. At each time, the global function can be cast as a sum of a finite number of local functions, each of which is assigned to one agent in the network. Moreover, the local functions become available to agents sequentially, and agents do not have a prior knowledge of the future cost functions. Therefore, agents must communicate with each other to build an online approximation of the global function. We propose a decentralized variation of the celebrated Mirror Descent, developed by Nemirovksi and Yudin. Using the notion of Bregman divergence in lieu of Euclidean distance for projection, Mirror Descent has been shown to be a powerful tool in large-scale optimization. Our algorithm builds on Mirror Descent, while ensuring that agents perform a consensus step to follow the global function and take into account the dynamics of the global minimizer. To measure the performance of the proposed online algorithm, we compare it to its offline counterpart, where the global functions are available a priori. The gap between the two is called dynamic regret. We establish a regret bound that scales inversely in the spectral gap of the network, and more notably it represents the deviation of minimizer sequence with respect to the given dynamics. We then show that our results subsume a number of results in distributed optimization. We demonstrate the application of our method to decentralized tracking of dynamic parameters and verify the results via numerical experiments.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/21/2017

An Online Optimization Approach for Multi-Agent Tracking of Dynamic Parameters in the Presence of Adversarial Noise

This paper addresses tracking of a moving target in a multi-agent networ...
research
02/23/2023

Dynamic Regret Analysis of Safe Distributed Online Optimization for Convex and Non-convex Problems

This paper addresses safe distributed online optimization over an unknow...
research
12/07/2021

Improving Dynamic Regret in Distributed Online Mirror Descent Using Primal and Dual Information

We consider the problem of distributed online optimization, with a group...
research
09/25/2021

Distributed Online Optimization with Byzantine Adversarial Agents

We study the problem of non-constrained, discrete-time, online distribut...
research
11/12/2019

A Distributed Online Convex Optimization Algorithm with Improved Dynamic Regret

In this paper, we consider the problem of distributed online convex opti...
research
09/14/2020

Distributed Mirror Descent with Integral Feedback: Asymptotic Convergence Analysis of Continuous-time Dynamics

This work addresses distributed optimization, where a network of agents ...
research
05/01/2022

A Survey of Decentralized Online Learning

Decentralized online learning (DOL) has been increasingly researched in ...

Please sign up or login with your details

Forgot password? Click here to reset