Jul 2026· IEEE International Symposium on High-Performance Parallel Distributed Computing· pp. 751-759· 0 citations· 26 references
Computer Science
Abstract
Local SGD (FedAvg) reduces federated communication by running multiple local steps between server aggregations, but it suffers from “client drift” under non-IID data. Methods such as SCAFFOLD mitigate this drift by transmitting control variates, which roughly doubles the per-round payload. We propose Momentum-Buffered Local SGD (MB-LSGD), an algorithm that corrects client drift with no additional payload: each client maintains a local drift buffer updated from the standard model aggregate, and a half-step bias present in naive drift estimators is eliminated by an additive update rule. For smooth non-convex objectives, MB-LSGD attains an \(\mathcal {O}(1/\sqrt {M K R})\) convergence rate, matching centralized mini-batch SGD up to constants. The bound explicitly couples the buffer rate α with the participation rate p, providing concrete guidance for hyperparameter selection under partial client sampling. With 100 clients under Dir(0.1) partitioning, MB-LSGD reaches a peak accuracy of \(48.37\%\) on TinyImageNet, exceeding SCAFFOLD (\(47.49\%\)) at half the bandwidth, and a final accuracy of \(61.67\%\) on CIFAR-10, the highest among all stable baselines. MB-LSGD is also the only method whose final accuracy on CIFAR-10 matches its peak, indicating sustained convergence without late-stage degradation, and its halved per-round payload relative to SCAFFOLD translates to close to a 2 × reduction in end-to-end completion time in communication-bound deployments.
OrthoFL is proposed, an orthogonal calibration framework that decouples global and local learning progress to reduce interference and consistently outperforms state-of-the-art asynchronous baselines under various delay patterns and heterogeneity scenarios.
Jiayun Zhang, Shuheng Li, Haiyu Huang et al.· Proceedings of the 32nd ACM...· 0 citations
Local Inference Guided Aggregation for Heterogeneous Training Environments to Yield Enhancement Through Agreement and Regularization (LIGHTYEAR), a federated learning framework that performs update selection in function space using an NTK-based agreement score to characterize predictive behavior and determine a persona...
Mirko Konstantin, S. Zachow, Anirban Mukhopadhyay· 0 citations
Federated training of foundation models is constrained by client memory and communication costs. LoRA-based methods reduce these costs through low-rank adapters, but their fixed rank budget can limit adaptation. Gradient low-rank optimization offers greater flexibility, yet independently chosen client subspaces create...
Cross-silo federated reinforcement learning (FRL) trains a shared policy across silos that must simultaneously respect a per-round uplink budget and on-device privacy. Although differential privacy (DP) and gradient compression each have mature solutions in supervised federated learning, naively stacking them in the po...
Jian-Tao Xu· IEEE Transactions on Communi...· 0 citations
Federated Learning (FL) enables privacy-preserving fine-tuning of Large Language Models (LLMs), yet the massive communication overhead remains a critical bottleneck. Furthermore, applying Low-Rank Adaptation (LoRA) in FL faces a fundamental"aggregation dilemma"between the accurate Sum-of-Products (SoP) and the communic...
Han Zou, Chao Zhang, Yu-Zhi Yang et al.· 0 citations
The analysis isolates a testable trade-off: extending the prediction path provides more forward-looking gradient information but increases its displacement bias, which is a testable trade-off in the case of full-participation FedAvg-M.
Jun-Kang Liu· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.