REVIEW 2 cited by
Linearly Convergent Asynchronous Distributed ADMM via Markov Sampling
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
Linearly Convergent Asynchronous Distributed ADMM via Markov Sampling
read the original abstract
We consider the consensual distributed optimization problem and propose an asynchronous version of the Alternating Direction Method of Multipliers (ADMM) algorithm to solve it. The `asynchronous' part here refers to the fact that only one node/processor is updated (i.e. performs a minimization step) at each iteration of the algorithm. The selection of the node to be updated is decided by simulating a Markov chain. The proposed algorithm is shown to have a linear convergence property in expectation for the class of functions which are strongly convex and continuously differentiable.
Forward citations
Cited by 2 Pith papers
-
Stability and Generalization for Decentralized Markov SGD
Decentralized SGD and SGDA under Markovian sampling admit non-asymptotic generalization bounds that incorporate network topology, Markov mixing rates, and primal-dual dynamics.
-
Decentralized Federated Averaging via Random Walk
DFedRW runs parallel random walk model updates with decentralized averaging and reports accuracy gains of up to 38 percentage points over FedAvg and DFedAvg under high heterogeneity.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.