Geometrically Convergent Distributed Optimization with Uncoordinated Step-Sizes
A recent algorithmic family for distributed optimization, DIGing's, have been shown to have geometric convergence over time-varying undirected/directed graphs. Nevertheless, an identical step-size for all agents is needed. In this paper, we study the convergence rates of the Adapt-Then-Combine (ATC) variation of the DIGing algorithm under uncoordinated step-sizes. We show that the ATC variation of DIGing algorithm converges geometrically fast even if the step-sizes are different among the agents. In addition, our analysis implies that the ATC structure can accelerate convergence compared to the distributed gradient descent (DGD) structure which has been used in the original DIGing algorithm.
Code (0)
등록된 구현이 없습니다.
Tasks
Distributed OptimizationSimilar Papers 제목 키워드 기반
Distributed Subgradient Algorithm for Multi-Agent Optimization With Dynamic Stepsize
In this paper, we consider distributed convex optimization problems on multi-agent networks. We develop and analyze the distributed gradient method which allows each agent to compute its dynamic stepsize by utilizing the…
Convergence of Communications, Control, and Machine Learning for Secure and Autonomous Vehicle Navigation
Connected and autonomous vehicles (CAVs) can reduce human errors in traffic accidents, increase road efficiency, and execute various tasks ranging from delivery to smart city surveillance. Reaping these benefits requires…
Autonomous NavigationAutonomous VehiclesDecision MakingIntrusion Detection+1Deep Reinforcement Learning for Distributed and Uncoordinated Cognitive Radios Resource Allocation
This paper presents a novel deep reinforcement learning-based resource allocation technique for the multi-agent environment presented by a cognitive radio network where the interactions of the agents during learning may …
Deep Reinforcement LearningQ-Learningreinforcement-learningReinforcement Learning+1Distributed Policy Iteration for Scalable Approximation of Cooperative Multi-Agent Policies
Decision making in multi-agent systems (MAS) is a great challenge due to enormous state and joint action spaces as well as uncertainty, making centralized control generally infeasible. Decentralized control offers better…
Decision MakingMulti-agent Reinforcement LearningReinforcement LearningUncoordinated and Decentralized Processing in Extra-Large MIMO Arrays
We propose a decentralized receiver for extra-large multiple-input multiple-output (XL-MIMO) arrays. Our method operates with no central processing unit (CPU) and all the signal detection tasks are done in distributed no…
CPU