# Communication-Efficient Approximate Gradient Coding for Distributed Learning in Heterogeneous Systems

Source: [Communication-Efficient Approximate Gradient Coding for Distributed Learning in Heterogeneous Systems](<https://www.sota2.com/research/paper/6a0a9ceddbc836b87d82b306>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2026-05-19T05:00:05.916Z

Authors: Heekang Song, Wan Choi

Published: 2026-05-15T12:21:17.000Z

## Abstract

We propose a communication-efficient optimally structured gradient coding scheme to jointly address straggler resilience and communication efficiency in heterogeneous distributed learning. By establishing a unified framework that simultaneously optimizes gradient coding and quantization, we formulate an optimization problem to minimize residual error subject to an unbiasedness constraint. We rigorously establish the joint global optimum by deriving a closed-form code structure coupled with an optimal bit allocation strategy, while simultaneously proposing a low-complexity bit allocation algorithm that efficiently yields near-optimal performance. We provide rigorous convergence analysis for convex and smooth functions. Experiments on the COCO dataset demonstrate that our joint design significantly accelerates convergence and enhances communication efficiency compared to existing baselines.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2605.15890>)

[PDF](<https://arxiv.org/pdf/2605.15890.pdf>)