Pith. sign in

REVIEW 1 cited by

Communication-Efficient Distributed Learning with Local Immediate Error Compensation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2402.11857 v1 pith:YG5Z3VVT submitted 2024-02-19 cs.LG cs.DC

classification cs.LGcs.DC
keywords compressionerrorbidirectionalcommunicationcompensationliec-sgdcostlocal
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Gradient compression with error compensation has attracted significant attention with the target of reducing the heavy communication overhead in distributed learning. However, existing compression methods either perform only unidirectional compression in one iteration with higher communication cost, or bidirectional compression with slower convergence rate. In this work, we propose the Local Immediate Error Compensated SGD (LIEC-SGD) optimization algorithm to break the above bottlenecks based on bidirectional compression and carefully designed compensation approaches. Specifically, the bidirectional compression technique is to reduce the communication cost, and the compensation technique compensates the local compression error to the model update immediately while only maintaining the global error variable on the server throughout the iterations to boost its efficacy. Theoretically, we prove that LIEC-SGD is superior to previous works in either the convergence rate or the communication cost, which indicates that LIEC-SGD could inherit the dual advantages from unidirectional compression and bidirectional compression. Finally, experiments of training deep neural networks validate the effectiveness of the proposed LIEC-SGD algorithm.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. BICompFL: Stochastic Federated Learning with Bi-Directional Compression

    cs.LG 2025-01 conditional novelty 7.0 of 10

    BICompFL applies minimal random coding to both uplink and downlink in stochastic federated learning, cutting measured communication cost by 5-32x on MNIST, Fashion-MNIST, and CIFAR-10.

Pith tools