Pith. sign in

REVIEW

Fast Algorithms for Distributed Optimization and Hypothesis Testing: A Tutorial

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 1609.03961 v3 pith:QKRSQQST submitted 2016-09-13 math.OC

Fast Algorithms for Distributed Optimization and Hypothesis Testing: A Tutorial

Alex Olshevsky This is my paper
classification math.OC
keywords distributedhypothesisoptimizationproblemstestingalgorithmalgorithmsaverage
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We consider several problems in the field of distributed optimization and hypothesis testing. We show how to obtain convergence times for these problems that scale linearly with the total number of nodes in the network by using a recent linear-time algorithm for the average consensus problem.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.