Pith. sign in

REVIEW 3 cited by

First Analysis of Local GD on Heterogeneous Data

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 1909.04715 v2 pith:JIDWTWUV submitted 2019-09-10 cs.LG cs.DCcs.NAmath.NAmath.OCstat.ML

classification cs.LGcs.DCcs.NAmath.NAmath.OCstat.ML
keywords datadescentgradientlocalanalysisfirstheterogeneousmethod
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We provide the first convergence analysis of local gradient descent for minimizing the average of smooth and convex but otherwise arbitrary functions. Problems of this form and local gradient descent as a solution method are of importance in federated learning, where each function is based on private data stored by a user on a mobile device, and the data of different users can be arbitrarily heterogeneous. We show that in a low accuracy regime, the method has the same communication complexity as gradient descent.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. OpenAlex reports about 67 citations worldwide. Full citation record

  1. FedWSQ: Efficient Federated Learning with Weight Standardization and Distribution-Aware Non-Uniform Quantization

    cs.LG 2025-06 conditional novelty 5.0 of 10

    FedWSQ applies weight standardization in federated learning and uses Gaussian-optimal non-uniform quantization with a shared global scaling vector, improving accuracy at very low bit rates.

  2. Optimization Methods and Software for Federated Learning

    cs.LG 2025-09 conditional novelty 4.0 of 10

    A thesis that packages the author's published federated learning work, whose main new theoretical result is an improved complexity bound for error-feedback compression.

  3. Strategies for Improving Communication Efficiency in Distributed and Federated Learning: Compression, Local Training, and Personalization

    cs.LG 2025-09 conditional novelty 3.0 of 10

    A PhD dissertation showing unified compression theory, personalized accelerated local training, and pruning methods that reduce communication costs in federated learning and maintain accuracy in LLM pruning.

Pith tools