On the convergence of decentralized gradient descent with diminishing stepsize, revisited

preprint2022arXivOpen access

Abstract

Distributed optimization has received a lot of interest in recent years due to its wide applications in various fields. In this work, we revisit the convergence property of the decentralized gradient descent [A. Nedi{ć}-A.Ozdaglar (2009)] on the whole space given by xi(t+1)=∑j=1mwijxj(t)−α(t)∇fi(xi(t)), x_i(t+1) = \sum^m_{j=1}w_{ij}x_j(t) - α(t) \nabla f_i(x_i(t)), where the stepsize is given as α(t)=a(t+w)pα(t) = \frac{a}{(t+w)^p} with 0<p≤10< p\leq 1. Under the strongly convexity assumption on the total cost function ff with local cost functions fif_i not necessarily being convex, we show that the sequence converges to the optimizer with rate O(t−p)O(t^{-p}) when the values of a>0a>0 and w>0w>0 are suitably chosen.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.