Pith. sign in

REVIEW 1 cited by

Federated Learning at the Network Edge: When Not All Nodes are Created Equal

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 2101.01995 v2 pith:UWBOAZPU submitted 2021-01-06 cs.NI

Federated Learning at the Network Edge: When Not All Nodes are Created Equal

classification cs.NI
keywords learningnodesapproachesdecisionsedgefederatedperformanceserver
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Under the federated learning paradigm, a set of nodes can cooperatively train a machine learning model with the help of a centralized server. Such a server is also tasked with assigning a weight to the information received from each node, and often also to drop too-slow nodes from the learning process. Both decisions have major impact on the resulting learning performance, and can interfere with each other in counterintuitive ways. In this paper, we focus on edge networking scenarios and investigate existing and novel approaches to such model-weighting and node-dropping decisions. Leveraging a set of real-world experiments, we find that popular, straightforward decision-making approaches may yield poor performance, and that considering the quality of data in addition to its quantity can substantially improve learning.

discussion (0)

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

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. DFCA: Decentralized Federated Clustering Algorithm

    cs.LG 2025-10 conditional novelty 5.0

    DFCA decentralizes IFCA-style clustered federated learning: clients keep one model per cluster, train their assigned model locally, and exchange only that model with neighbors via a running average, matching centraliz...