mlsanityData to 14 Oct 2026

WASH: Train your Ensemble with Communication-Efficient Weight Shuffling, then Average

arXiv 2405.17517 ↗First posted 27 May 2024cs.LG cs.CV cs.NEcited by 9

Not on the map. Why?

Abstract (arXiv)

The performance of deep neural networks is enhanced by ensemble methods, which average the output of several models. However, this comes at an increased cost at inference. Weight averaging methods aim at balancing the generalization of ensembling and the inference speed of a single model by averaging the parameters of an ensemble of models. Yet, naive averaging results in poor performance as models converge to different loss basins, and aligning the models to improve the performance of the average is challenging. Alternatively, inspired by distributed training, methods like DART and PAPA have been proposed to train several models in parallel such that they will end up in the same basin, resulting in good averaging accuracy. However, these methods either compromise ensembling accuracy or demand significant communication between models during training. In this paper, we introduce WASH, a novel distributed method for training model ensembles for weight averaging that achieves state-of-the-art image classification accuracy. WASH maintains models within the same basin by randomly shuffling a small percentage of weights during training, resulting in diverse models and lower communication costs compared to standard parameter averaging methods.

Key facts. Cited by 9 papers in the map (data through 14 Oct 2026). Builds on 33 of its 48 references that are in the map. First posted on arXiv 27 May 2024.

Builds on

33 of 48 references.

References · 33

  1. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,669
  2. 2015Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learningcited by 4,448
  3. 2016Simple and Scalable Predictive Uncertainty Estimation using Deep Ensemblescited by 3,926
  4. 2018Federated Optimization in Heterogeneous Networkscited by 2,987
  5. 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,396
  6. 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,209
  7. 2016Optimization Methods for Large-Scale Machine Learningcited by 1,150
  8. 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 637
  9. 2018Local SGD Converges Fast and Communicates Littlecited by 605
  10. 2018Loss Surfaces, Mode Connectivity, and Fast Ensembling of DNNscited by 588
  11. 2016Federated Optimization: Distributed Machine Learning for On-Device Intelligencecited by 564
  12. 2020Federated Learning with Matched Averagingcited by 564
21 more
  1. 2019Deep Ensembles: A Loss Landscape Perspectivecited by 443
  2. 2021SWAD: Domain Generalization by Seeking Flat Minimacited by 434
  3. 2019Bayesian Nonparametric Federated Learning of Neural Networkscited by 387
  4. 2020What is being transferred in transfer learning?cited by 368
  5. 2018Don't Use Large Mini-Batches, Use Local SGDcited by 202
  6. 2014EXTRA: An Exact First-Order Algorithm for Decentralized Consensus Optimizationcited by 160
  7. 2021Efficient Deep Learning: A Survey on Making Deep Learning Models Smaller, Faster, and Bettercited by 154
  8. 2022Diverse Weight Averaging for Out-of-Distribution Generalizationcited by 148
  9. 2018D2: Decentralized Training over Decentralized Datacited by 140
  10. 2019SlowMo: Improving Communication-Efficient Distributed SGD with Slow Momentumcited by 121
  11. 2021Loss Surface Simplexes for Mode Connecting Volumes and Fast Ensemblingcited by 75
  12. 2021No One Representation to Rule Them All: Overlapping Features of Training Methodscited by 58
  13. 2021Federated Dropout -- A Simple Approach for Enabling Federated Learning on Resource Constrained Devicescited by 56
  14. 2023ZeRO++: Extremely Efficient Collective Communication for Giant Model Trainingcited by 52
  15. 2021Consensus Control for Decentralized Deep Learningcited by 49
  16. 2021Cross-Gradient Aggregation for Decentralized Learning from Non-IID datacited by 33
  17. 2021Trade-offs of Local SGD at Scale: An Empirical Studycited by 20
  18. 2021Communication-efficient SGD: From Local SGD to One-Shot Averagingcited by 19
  19. 2021ResIST: Layer-Wise Decomposition of ResNets for Distributed Trainingcited by 18
  20. 2020Distributed Stochastic Consensus Optimization with Momentum for Nonconvex Nonsmooth Problemscited by 8
  21. 2023A2CiD2: Accelerating Asynchronous Communication in Decentralized Deep Learningcited by 7

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 1; 2025: 6; 2026: 2.

9 papers.