Pith. sign in

REVIEW 1 cited by

Analysis and Evaluation of Synchronous and Asynchronous FLchain

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 2112.07938 v3 pith:DDJ74PH4 submitted 2021-12-15 cs.LG cs.DCcs.NI

classification cs.LGcs.DCcs.NI
keywords asynchronousoptimizationsynchronousfederatedbc-enabledclientsheterogeneoushigher
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Motivated by the heterogeneous nature of devices participating in large-scale Federated Learning (FL) optimization, we focus on an asynchronous server-less FL solution empowered by blockchain technology. In contrast to mostly adopted FL approaches, which assume synchronous operation, we advocate an asynchronous method whereby model aggregation is done as clients submit their local updates. The asynchronous setting fits well with the federated optimization idea in practical large-scale settings with heterogeneous clients. Thus, it potentially leads to higher efficiency in terms of communication overhead and idle periods. To evaluate the learning completion delay of BC-enabled FL, we provide an analytical model based on batch service queue theory. Furthermore, we provide simulation results to assess the performance of both synchronous and asynchronous mechanisms. Important aspects involved in the BC-enabled FL optimization, such as the network size, link capacity, or user requirements, are put together and analyzed. As our results show, the synchronous setting leads to higher prediction accuracy than the asynchronous case. Nevertheless, asynchronous federated optimization provides much lower latency in many cases, thus becoming an appealing solution for FL when dealing with large datasets, tough timing constraints (e.g., near-real-time applications), or highly varying training data.

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. FedCostAware: Enabling Cost-Aware Federated Learning on the Cloud

    cs.DC 2025-05 conditional novelty 6.0 of 10

    FedCostAware reports cutting cloud costs for synchronous federated learning by up to 72 percent using smarter spot-instance lifecycle management.

Pith tools