REVIEW 9 cited by
FedCM: Federated Learning with Client-level Momentum
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
read the original abstract
Federated Learning is a distributed machine learning approach which enables model training without data sharing. In this paper, we propose a new federated learning algorithm, Federated Averaging with Client-level Momentum (FedCM), to tackle problems of partial participation and client heterogeneity in real-world federated learning applications. FedCM aggregates global gradient information in previous communication rounds and modifies client gradient descent with a momentum-like term, which can effectively correct the bias and improve the stability of local SGD. We provide theoretical analysis to highlight the benefits of FedCM. We also perform extensive empirical studies and demonstrate that FedCM achieves superior performance in various tasks and is robust to different levels of client numbers, participation rate and client heterogeneity.
Forward citations
Cited by 9 Pith papers
-
SpecGradFilter: A Spectral Gradient Filtering Framework for Taming Federated Heterogeneity
Inter-client gradient divergence in federated learning concentrates in low-frequency components; suppressing them via spectral or spatial high-pass filtering reduces client drift and raises accuracy under non-IID data.
-
FedFFT: Taming Client Drift in Federated SAM via Spectral Perturbation Filtering
Low-frequency components of client-side SAM perturbations carry most inter-client disagreement; high-pass filtering them yields more consistent federated updates and higher accuracy under non-IID data.
-
FedACT: Federated Adaptive Coordinate Trust Modulation for Robust Transformer Training under Data Heterogeneity
Global-aware coordinate trust modulation after corrected AdamW updates improves federated Transformer and LLM training under data heterogeneity over strong adaptive baselines.
-
FedWCM: Unleashing the Potential of Momentum-based Federated Learning in Long-Tailed Scenarios
FedWCM uses per-client data-distribution scores to adapt momentum and aggregation weights in federated learning, showing empirical gains over FedAvg and FedCM on long-tailed non-IID datasets, but its convergence proof...
-
Hybrid Batch Normalisation: Resolving the Dilemma of Batch Normalisation in Federated Learning
Hybrid Batch Normalisation improves federated learning accuracy by combining local batch statistics with global statistics, and derives those global statistics from the pre-update global model.
-
FedWSQ: Efficient Federated Learning with Weight Standardization and Distribution-Aware Non-Uniform Quantization
FedWSQ applies weight standardization in federated learning and uses Gaussian-optimal non-uniform quantization with a shared global scaling vector, improving accuracy at very low bit rates.
-
Generalizable Federated Learning using Client Adaptive Focal Modulation
The abstract describes AdaptFED, a claimed federated learning method, but the full text is an unrelated graph theory paper, so the claimed results are absent from the submission.
-
pFedSOP : Accelerating Training Of Personalized Federated Learning Using Second-Order Optimization
pFedSOP combines Gompertz-weighted local/global gradients with a rank-one Fisher Information Matrix update to speed up personalized federated learning, but the convergence proof is invalid and the update reduces to no...
-
Strategies for Improving Communication Efficiency in Distributed and Federated Learning: Compression, Local Training, and Personalization
A PhD dissertation showing unified compression theory, personalized accelerated local training, and pruning methods that reduce communication costs in federated learning and maintain accuracy in LLM pruning.
Discussion (0). Continue with ORCID to comment.