Fast Decentralized Optimization over Networks

04/06/2018
by   Meng Ma, et al.
0

The present work introduces the hybrid consensus alternating direction method of multipliers (H-CADMM), a novel framework for optimization over networks which unifies existing distributed optimization approaches, including the centralized and the decentralized consensus ADMM. H-CADMM provides a flexible tool that leverages the underlying graph topology in order to achieve a desirable sweet-spot between node-to-node communication overhead and rate of convergence -- thereby alleviating known limitations of both C-CADMM and D-CADMM. A rigorous analysis of the novel method establishes linear convergence rate, and also guides the choice of parameters to optimize this rate. The novel hybrid update rules of H-CADMM lend themselves to "in-network acceleration" that is shown to effect considerable -- and essentially "free-of-charge" -- performance boost over the fully decentralized ADMM. Comprehensive numerical tests validate the analysis and showcase the potential of the method in tackling efficiently, widely useful learning tasks.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/09/2017

Adaptive Consensus ADMM for Distributed Optimization

The alternating direction method of multipliers (ADMM) is commonly used ...
research
05/24/2019

Tight Linear Convergence Rate of ADMM for Decentralized Optimization

The present paper considers leveraging network topology information to i...
research
11/04/2021

Finite-Time Consensus Learning for Decentralized Optimization with Nonlinear Gossiping

Distributed learning has become an integral tool for scaling up machine ...
research
05/08/2022

Learning Regionally Decentralized AC Optimal Power Flows with ADMM

One potential future for the next generation of smart grids is the use o...
research
02/17/2021

Communication-free Cohesive Flexible-Object Transport using Decentralized Robot Networks

Decentralized network theories focus on achieving consensus and in speed...
research
03/07/2015

Learning Scale-Free Networks by Dynamic Node-Specific Degree Prior

Learning the network structure underlying data is an important problem i...
research
03/30/2015

Decentralized learning for wireless communications and networking

This chapter deals with decentralized learning algorithms for in-network...

Please sign up or login with your details

Forgot password? Click here to reset