Pith. sign in

REVIEW 1 cited by

Optimizing Pipelined Computation and Communication for Latency-Constrained Edge Learning

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 1906.04488 v2 pith:FGPAJMEP submitted 2019-06-11 cs.LG cs.DCcs.ITcs.NImath.ITstat.ML

classification cs.LGcs.DCcs.ITcs.NImath.ITstat.ML
keywords communicationdatalearningcomputationedgeprocessorbiasdevice
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Consider a device that is connected to an edge processor via a communication channel. The device holds local data that is to be offloaded to the edge processor so as to train a machine learning model, e.g., for regression or classification. Transmission of the data to the learning processor, as well as training based on Stochastic Gradient Descent (SGD), must be both completed within a time limit. Assuming that communication and computation can be pipelined, this letter investigates the optimal choice for the packet payload size, given the overhead of each data packet transmission and the ratio between the computation and the communication rates. This amounts to a tradeoff between bias and variance, since communicating the entire data set first reduces the bias of the training process but it may not leave sufficient time for learning. Analytical bounds on the expected optimality gap are derived so as to enable an effective optimization, which is validated in numerical results.

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. On Analog Gradient Descent Learning over Multiple Access Fading Channels

    cs.LG 2019-08 conditional novelty 6.0 of 10

    The GBMA algorithm lets distributed nodes transmit analog gradients over a fading multiple access channel without power control, and provably approaches centralized gradient descent convergence as the number of nodes grows.

Pith tools