mlsanityData to 7 Oct 2026

Partial Model Averaging in Federated Learning: Performance Guarantees and Benefits

arXiv 2201.03789 ↗First posted 11 Jan 2022cs.LG stat.MLcited by 8

Not on the map. Why?

Abstract (arXiv)

Local Stochastic Gradient Descent (SGD) with periodic model averaging (FedAvg) is a foundational algorithm in Federated Learning. The algorithm independently runs SGD on multiple workers and periodically averages the model across all the workers. When local SGD runs with many workers, however, the periodic averaging causes a significant model discrepancy across the workers making the global loss converge slowly. While recent advanced optimization methods tackle the issue focused on non-IID settings, there still exists the model discrepancy issue due to the underlying periodic model averaging. We propose a partial model averaging framework that mitigates the model discrepancy issue in Federated Learning. The partial averaging encourages the local models to stay close to each other on parameter space, and it enables to more effectively minimize the global loss. Given a fixed number of iterations and a large number of workers (128), the partial averaging achieves up to 2.2% higher validation accuracy than the periodic full averaging.

Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 22 of its 32 references that are in the map. First posted on arXiv 11 Jan 2022.

Builds on

22 of 32 references.

References · 22

  1. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
  2. 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
  3. 2018Federated Optimization in Heterogeneous Networkscited by 2,971
  4. 2017Accurate, Large Minibatch SGD: Training ImageNet in 1 Hourcited by 1,479
  5. 2020Tackling the Objective Inconsistency Problem in Heterogeneous Federated Optimizationcited by 897
  6. 2018LEAF: A Benchmark for Federated Settingscited by 780
  7. 2019Large Batch Optimization for Deep Learning: Training BERT in 76 minutescited by 671
  8. 2018Local SGD Converges Fast and Communicates Littlecited by 595
  9. 2014SAGA: A Fast Incremental Gradient Method With Support for Non-Strongly Convex Composite Objectivescited by 401
  10. 2018Parallel Restarted SGD with Faster Convergence and Less Communication: Demystifying Why Model Averaging Works for Deep Learningcited by 277
  11. 2019Model Pruning Enables Efficient Federated Learning on Edge Devicescited by 219
  12. 2020The large learning rate phase of deep learning: the catapult mechanismcited by 206
10 more
  1. 2018Don't Use Large Mini-Batches, Use Local SGDcited by 201
  2. 2019On the Linear Speedup Analysis of Communication Efficient Momentum SGD for Distributed Non-Convex Optimizationcited by 178
  3. 2019Towards Explaining the Regularization Effect of Initial Large Learning Rate in Training Neural Networkscited by 162
  4. 2018Cooperative SGD: A unified Framework for the Design and Analysis of Communication-Efficient SGD Algorithmscited by 106
  5. 2019Local SGD with Periodic Averaging: Tighter Analysis and Adaptive Synchronizationcited by 106
  6. 2019Variance Reduced Local SGD with Lower Communication Complexitycited by 80
  7. 2018Adaptive Communication Strategies to Achieve the Best Error-Runtime Trade-off in Local-Update SGDcited by 76
  8. 2019AI Benchmark: All About Deep Learning on Smartphones in 2019cited by 76
  9. 2018On the Ineffectiveness of Variance Reduced Optimization for Deep Learningcited by 48
  10. 2021A Probabilistic Approach to Neural Network Pruningcited by 15

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 1; 2023: 0; 2024: 3; 2025: 3; 2026: 1.

8 papers.