Decentralized gradient methods: does topology matter?
원문 초록
Consensus-based distributed optimization methods have recently been advocated as alternatives to parameter server and ring all-reduce paradigms for large scale training of machine learning models. In this case, each worker maintains a local estimate of the optimal parameter vector and iteratively updates it by averaging the estimates obtained from its neighbors, and applying a correction on the basis of its local dataset. While theoretical results suggest that worker communication topology should have strong impact on the number of epochs needed to converge, previous experiments have shown the opposite conclusion. This paper sheds lights on this apparent contradiction and show how sparse topologies can lead to faster convergence even in the absence of communication delays.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
DPLib: A Standard Benchmark Library for Distributed Power System Analysis and Optimization
Opportunistic Routing in Wireless Communications via Learnable State-Augmented Policies
Optimization Algorithm Design via Electric Circuits
GNN-Empowered Effective Partial Observation MARL Method for AoI Management in Multi-UAV Network
Communication- and Computation-Efficient Distributed Submodular Optimization in Robot Mesh Networks
ACCO: Accumulate While You Communicate for Communication-Overlapped Sharded LLM Training
토론
이 논문과 연결된 포럼 글이 아직 없습니다.