Pith. sign in

REVIEW 1 cited by

Online-Score-Aided Federated Learning for Resource-Constrained Wireless Clients with Continual Data Arrival

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 2408.05886 v5 pith:CRTBBRZ3 submitted 2024-08-12 cs.LG cs.DCcs.NIcs.SYeess.SY

classification cs.LGcs.DCcs.NIcs.SYeess.SY
keywords datalearningclientscontinualfederatedwirelessacrossalgorithm
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Heterogeneous system configurations of distributed clients connected to the central server (CS) via a time-varying wireless network pose significant challenges for popular distributed machine learning (ML) algorithms such as federated learning (FL). Although the limited (radio and computational) resources are widely acknowledged, two critical yet often ignored aspects are (a) client devices can only dedicate a small chunk of their limited storage for the FL task and (b) new training samples may arrive continually in many practical wireless applications. Therefore, we propose a new FL algorithm, online-score-aided federated learning (OSAFL), specifically designed for tasks with continual data arrival in resource-constrained environments. We first theoretically show how the convergence bound is affected by continual data distribution shifts, uncertain client participation, gradient quantization errors, and noise from stochastic gradients and statistical data heterogeneity across clients. We then show how to (sub-optimally) minimize these errors by choosing appropriate aggregation weights at the CS during global update. Our extensive simulation results across three popular image classification datasets and three ML models with different numbers of trainable parameters validate the effectiveness of the proposed OSAFL algorithm compared to (modified) state-of-the art FL baselines.

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. Computation- and Communication-Efficient Online FL for Resource-Constrained Aerial Vehicles

    cs.LG 2025-06 reject novelty 5.0 of 10

    An online aerial federated learning algorithm that combines model pruning, probabilistic gradient quantization, and trajectory planning reaches similar simulated accuracy to costly baselines with lower resource use.

Pith tools