Communication-Computation Efficient Gradient Coding
Min Ye · Emmanuel Abbe
Fri Jul 13 09:15 AM -- 12:00 PM (PDT) @ Hall B #126
This paper develops coding techniques to reduce the running time of distributed learning tasks. It characterizes the fundamental tradeoff to compute gradients in terms of three parameters: computation load, straggler tolerance and communication cost. It further gives an explicit coding scheme that achieves the optimal tradeoff based on recursive polynomial constructions, coding both across data subsets and vector components. As a result, the proposed scheme allows to minimize the running time for gradient computations. Implementations are made on Amazon EC2 clusters using Python with mpi4py package. Results show that the proposed scheme maintains the same generalization error while reducing the running time by $32\%$ compared to uncoded schemes and $23\%$ compared to prior coded schemes focusing only on stragglers (Tandon et al., ICML 2017).
Min Ye (Princeton University)
Related Events (a corresponding poster, oral, or spotlight)
2018 Oral: Communication-Computation Efficient Gradient Coding »
Fri Jul 13th 02:50 -- 03:00 PM Room A3