arXiv:1510.06688
Partitioning Data on Features or Samples in Communication-Efficient Distributed Optimization?
원문 초록
In this paper we study the effect of the way that the data is partitioned in distributed optimization. The original DiSCO algorithm [Communication-Efficient Distributed Optimization of Self-Concordant Empirical Loss, Yuchen Zhang and Lin Xiao, 2015] partitions the input data based on samples. We describe how the original algorithm has to be modified to allow partitioning on features and show its efficiency both in theory and also in practice.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
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
토론
이 논문과 연결된 포럼 글이 아직 없습니다.