Asymptotic Network Independence and Step-Size for A Distributed Subgradient Method

25 Jul 2020 Olshevsky Alex

We consider whether distributed subgradient methods can achieve a linear speedup over a centralized subgradient method. While it might be hoped that distributed network of $n$ nodes that can compute $n$ times more subgradients in parallel compared to a single node might, as a result, be $n$ times faster, existing bounds for distributed optimization methods are often consistent with a slowdown rather than speedup compared to a single node... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • OPTIMIZATION AND CONTROL
  • SYSTEMS AND CONTROL
  • SYSTEMS AND CONTROL