Distributed Mirror Descent with Integral Feedback: Asymptotic Convergence Analysis of Continuous-time Dynamics
This work addresses distributed optimization, where a network of agents wants to minimize a global strongly convex objective function. The global function can be written as a sum of local convex functions, each of which is associated with an agent. We propose a continuous-time distributed mirror descent algorithm that uses purely local information to converge to the global optimum. Unlike previous work on distributed mirror descent, we incorporate an integral feedback in the update, allowing the algorithm to converge with a constant step-size when discretized. We establish the asymptotic convergence of the algorithm using Lyapunov stability analysis. We further illustrate numerical experiments that verify the advantage of adopting integral feedback for improving the convergence rate of distributed mirror descent.
Code (0)
등록된 구현이 없습니다.
Tasks
Distributed OptimizationSimilar Papers 제목 키워드 기반
Linear Convergence of Distributed Mirror Descent with Integral Feedback for Strongly Convex Problems
Distributed optimization often requires finding the minimum of a global objective function written as a sum of local functions. A group of agents work collectively to minimize the global function. We study a continuous-t…
Distributed OptimizationMulti-agent online learning in time-varying games
We examine the long-run behavior of multi-agent online learning in games that evolve over time. Specifically, we focus on a wide class of policies based on mirror descent, and we show that the induced sequence of play (a…
Learning Positive Functions with Pseudo Mirror Descent
The nonparametric learning of positive-valued functions appears widely in machine learning, especially in the context of estimating intensity functions of point processes. Yet, existing approaches either require computin…
Computational EfficiencyPoint ProcessesA Distributed Training Algorithm of Generative Adversarial Networks with Quantized Gradients
Training generative adversarial networks (GAN) in a distributed fashion is a promising technology since it is contributed to training GAN on a massive of data efficiently in real-world applications. However, GAN is known…
Cooperative Global $\mathcal{K}$-exponential Tracking Control of Multiple Mobile Robots -- Extended Version
This paper studies the cooperative tracking control problem for multiple mobile robots over a directed communication network. First, it is shown that the closed-loop system is uniformly globally asymptotically stable und…