Pith. sign in

REVIEW 1 cited by

Efficient Client Selection in Federated 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 2502.00036 v1 pith:L5RWMFNS submitted 2025-01-25 cs.LG cs.AIcs.DC

classification cs.LGcs.AIcs.DC
keywords clientlearningprivacyselectionfaultfederatedperformancetolerance
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Federated Learning (FL) enables decentralized machine learning while preserving data privacy. This paper proposes a novel client selection framework that integrates differential privacy and fault tolerance. The adaptive client selection adjusts the number of clients based on performance and system constraints, with noise added to protect privacy. Evaluated on the UNSW-NB15 and ROAD datasets for network anomaly detection, the method improves accuracy by 7% and reduces training time by 25% compared to baselines. Fault tolerance enhances robustness with minimal performance trade-offs.

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. Overcoming Challenges of Partial Client Participation in Federated Learning : A Comprehensive Review

    cs.LG 2025-06 conditional novelty 4.0 of 10

    A survey categorizing and comparing twelve federated learning methods for partial client participation, weakened by several citation mismatches and unsourced benchmark numbers.

Pith tools