Asynchronous Distributed Semi-Stochastic Gradient Optimization
원문 초록
With the recent proliferation of large-scale learning problems,there have been a lot of interest on distributed machine learning algorithms, particularly those that are based on stochastic gradient descent (SGD) and its variants. However, existing algorithms either suffer from slow convergence due to the inherent variance of stochastic gradients, or have a fast linear convergence rate but at the expense of poorer solution quality. In this paper, we combine their merits by proposing a fast distributed asynchronous SGD-based algorithm with variance reduction. A constant learning rate can be used, and it is also guaranteed to converge linearly to the optimal solution. Experiments on the Google Cloud Computing Platform demonstrate that the proposed algorithm outperforms state-of-the-art distributed asynchronous algorithms in terms of both wall clock time and solution quality.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
GATES: Cost-aware Dynamic Workflow Scheduling via Graph Attention Networks and Evolution Strategy
Enhanced Outsourced and Secure Inference for Tall Sparse Decision Trees
InTec: integrated things-edge computing: a framework for distributing machine learning pipelines in edge AI systems
Persistence of Backdoor-based Watermarks for Neural Networks: A Comprehensive Evaluation
Toward Intelligent and Secure Cloud: Large Language Model Empowered Proactive Defense
All-in-one foundational models learning across quantum chemical levels
토론
이 논문과 연결된 포럼 글이 아직 없습니다.