Asymptotic Network Independence in Distributed Stochastic Optimization for Machine Learning
원문 초록
We provide a discussion of several recent results which, in certain scenarios, are able to overcome a barrier in distributed stochastic optimization for machine learning. Our focus is the so-called asymptotic network independence property, which is achieved whenever a distributed method executed over a network of n nodes asymptotically converges to the optimal solution at a comparable rate to a centralized method with the same computational power as the entire network. We explain this property through an example involving the training of ML models and sketch a short mathematical analysis for comparing the performance of distributed stochastic gradient descent (DSGD) with centralized stochastic gradient decent (SGD).
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Online distributed optimization for spatio-temporally constrained real-time peer-to-peer energy trading
Fundamental Bias in Inverting Random Sampling Matrices with Application to Sub-sampled Newton
Problem-dependent convergence bounds for randomized linear gradient compression
DPLib: A Standard Benchmark Library for Distributed Power System Analysis and Optimization
Adaptive Semantic Token Communication for Transformer-based Edge Inference
Efficient Optimization with Orthogonality Constraint: a Randomized Riemannian Submanifold Method
토론
이 논문과 연결된 포럼 글이 아직 없습니다.