Pith. sign in

REVIEW 1 cited by

Why Go Full? Elevating Federated Learning Through Partial Network Updates

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 2410.11559 v3 pith:3A6JQMMF submitted 2024-10-15 cs.LG

classification cs.LG
keywords layerlearningmodelfederatedfulllayersmethodmismatch
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Federated learning is a distributed machine learning paradigm designed to protect user data privacy, which has been successfully implemented across various scenarios. In traditional federated learning, the entire parameter set of local models is updated and averaged in each training round. Although this full network update method maximizes knowledge acquisition and sharing for each model layer, it prevents the layers of the global model from cooperating effectively to complete the tasks of each client, a challenge we refer to as layer mismatch. This mismatch problem recurs after every parameter averaging, consequently slowing down model convergence and degrading overall performance. To address the layer mismatch issue, we introduce the FedPart method, which restricts model updates to either a single layer or a few layers during each communication round. Furthermore, to maintain the efficiency of knowledge acquisition and sharing, we develop several strategies to select trainable layers in each round, including sequential updating and multi-round cycle training. Through both theoretical analysis and experiments, our findings demonstrate that the FedPart method significantly surpasses conventional full network update strategies in terms of convergence speed and accuracy, while also reducing communication and computational overheads.

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. Streaming DiLoCo with overlapping communication: Towards a Distributed Free Lunch

    cs.CL 2025-01 conditional novelty 6.0 of 10

    Streaming DiLoCo trains billion-parameter LLMs at data-parallel quality while cutting the inter-datacenter bandwidth by about two orders of magnitude via partial, overlapped, and 4-bit-quantized synchronization.

Pith tools