Technical Program

Paper Detail

Paper Title Distributed Stochastic Gradient Descent Using LDGM Codes
Paper IdentifierWE1.R2.1
Authors Shunsuke Horii, Waseda University, Japan; Takahiro Yoshida, Yokohama College of Commerce, Japan; Manabu Kobayashi, Toshiyasu Matsushima, Waseda University, Japan
Session Coded Computing I
Location Saint Germain, Level 3
Session Time Wednesday, 10 July, 09:50 - 11:10
Presentation Time Wednesday, 10 July, 09:50 - 10:10
Manuscript  Click here to download the manuscript
Abstract We consider a distributed learning problem in which the computation is carried out on a system consisting of a master node and multiple worker nodes. In such systems, the existence of slow-running machines called stragglers will cause a significant decrease in performance. Recently, coding theoretic framework, which is named Gradient Coding (GC), for mitigating stragglers in distributed learning has been established by Tandon et al. Most studies on GC are aiming at recovering the gradient information completely assuming that the Gradient Descent (GD) algorithm is used as a learning algorithm. On the other hand, if the Stochastic Gradient Descent (SGD) algorithm is used, it is not necessary to completely recover the gradient information, and its unbiased estimator is sufficient for the learning. In this paper, we propose a distributed SGD scheme using Low-Density Generator Matrix (LDGM) codes. In the proposed system, it may take longer time than existing GC methods to recover the gradient information completely, however, it enables the master node to obtain a high-quality unbiased estimator of the gradient at low computational cost and it leads to overall performance improvement.