Leveraging partial stragglers within gradient coding
<|reference_start|>Leveraging partial stragglers within gradient coding: Within distributed learning, workers typically compute gradients on their assigned dataset chunks and send them to the parameter server (PS), which aggregates them to compute either an exact or approximate version of $\nabla L$ (gradient of the loss function $L$). However, in large-scale clusters, many workers are slower than their promised speed or even failure-prone. A gradient coding solution introduces redundancy within the assignment of chunks to the workers and uses coding theoretic ideas to allow the PS to recover $\nabla L$ (exactly or approximately), even in the presence of stragglers. Unfortunately, most existing gradient coding protocols are inefficient from a computation perspective as they coarsely classify workers as operational or failed; the potentially valuable work performed by slow workers (partial stragglers) is ignored. In this work, we present novel gradient coding protocols that judiciously leverage the work performed by partial stragglers. Our protocols are efficient from a computation and communication perspective and numerically stable. For an important class of chunk assignments, we present efficient algorithms for optimizing the relative ordering of chunks within the workers; this ordering affects the overall execution time. For exact gradient reconstruction, our protocol is around $2\times$ faster than the original class of protocols and for approximate gradient reconstruction, the mean-squared-error of our reconstructed gradient is several orders of magnitude better.<|reference_end|>
@article{ramamoorthy2024leveraging,
    title={Leveraging partial stragglers within gradient coding},
    author={Aditya Ramamoorthy, Ruoyu Meng and Vrinda S. Girimaji},
    journal={arXiv preprint arXiv:2405.19509},
    year={2024},
    archivePrefix={arXiv},
    eprint={2405.19509},
    primaryClass={cs.IT math.IT}
}