Pith. sign in

REVIEW 1 cited by

Gradient Coding

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 1612.03301 v2 pith:ZAJCWFKD submitted 2016-12-10 stat.ML cs.DCcs.ITcs.LGmath.ITstat.CO

Rashish Tandon , Qi Lei , Alexandros G. Dimakis , Nikos Karampatziakis This is my paper · ORCID
classification stat.MLcs.DCcs.ITcs.LGmath.ITstat.CO
keywords codinggradientstragglersacrossamazonapproachesbaselineblocks
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We propose a novel coding theoretic framework for mitigating stragglers in distributed learning. We show how carefully replicating data blocks and coding across gradients can provide tolerance to failures and stragglers for Synchronous Gradient Descent. We implement our schemes in python (using MPI) to run on Amazon EC2, and show how we compare against baseline approaches in running time and generalization error.

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. Cooperative Gradient Coding

    cs.DC 2025-07 reject novelty 5.0 of 10

    A gradient coding scheme for federated learning that avoids dataset duplication and adds a fallback decoder that recovers the model from incomplete messages.

Pith tools