SADDLe: Sharpness-Aware Decentralized Deep Learning with Heterogeneous Data
Not on the map. Why?
Abstract (arXiv)
Decentralized training enables learning with distributed datasets generated at different locations without relying on a central server. In realistic scenarios, the data distribution across these sparsely connected learning agents can be significantly heterogeneous, leading to local model over-fitting and poor global model generalization. Another challenge is the high communication cost of training models in such a peer-to-peer fashion without any central coordination. In this paper, we jointly tackle these two-fold practical challenges by proposing SADDLe, a set of sharpness-aware decentralized deep learning algorithms. SADDLe leverages Sharpness-Aware Minimization (SAM) to seek a flatter loss landscape during training, resulting in better model generalization as well as enhanced robustness to communication compression. We present two versions of our approach and conduct extensive experiments to show that SADDLe leads to 1-20% improvement in test accuracy compared to other existing techniques. Additionally, our proposed approach is robust to communication compression, with an average drop of only 1% in the presence of up to 4x compression.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 42 of its 52 references that are in the map. First posted on arXiv 22 May 2024.
Builds on
42 of 52 references.
References · 42
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2018MobileNetV2: Inverted Residuals and Linear Bottleneckscited by 4,795
- 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,417
- 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,352
- 2017Visualizing the Loss Landscape of Neural Netscited by 1,130
- 2019Measuring the Effects of Non-Identical Data Distribution for Federated Visual Classificationcited by 851
- 2016Federated Optimization: Distributed Machine Learning for On-Device Intelligencecited by 564
- 2019Fantastic Generalization Measures and Where to Find Themcited by 513
- 2017Can Decentralized Algorithms Outperform Centralized Algorithms? A Case Study for Decentralized Parallel Stochastic Gradient Descentcited by 502
- 2018Sparsified SGD with Memorycited by 376
- 2019Error Feedback Fixes SignSGD and other Gradient Compression Schemescited by 310
- 2019The Non-IID Data Quagmire of Decentralized Machine Learningcited by 305
30 more
- 2021ASAM: Adaptive Sharpness-Aware Minimization for Scale-Invariant Learning of Deep Neural Networkscited by 293
- 2018The Convergence of Sparsified Gradient Methodscited by 229
- 2019Decentralized Stochastic Optimization and Gossip Algorithms with Compressed Communicationcited by 221
- 2018Stochastic Gradient Push for Distributed Deep Learningcited by 152
- 2020The Break-Even Point on Optimization Trajectories of Deep Neural Networkscited by 150
- 2022Towards Understanding Sharpness-Aware Minimizationcited by 146
- 2022Generalized Federated Learning via Sharpness Aware Minimizationcited by 144
- 2018D2: Decentralized Training over Decentralized Datacited by 140
- 2022Towards Efficient and Scalable Sharpness-Aware Minimizationcited by 129
- 2022Penalizing Gradient Norm for Efficiently Improving Generalization in Deep Learningcited by 122
- 2019Decentralized Deep Learning with Arbitrary Communication Compressioncited by 111
- 2022Improving Generalization in Federated Learning by Seeking Flat Minimacited by 98
- 2022Sharpness-Aware Training for Freecited by 95
- 2018Communication Compression for Decentralized Trainingcited by 88
- 2022Make Sharpness-Aware Minimization Stronger: A Sparsified Perturbation Approachcited by 70
- 2021Quasi-Global Momentum: Accelerating Decentralized Deep Learning on Heterogeneous Datacited by 69
- 2022An Improved Analysis of Gradient Tracking for Decentralized Machine Learningcited by 69
- 2020Can Federated Learning Save The Planet?cited by 52
- 2023Dynamic Regularized Sharpness Aware Minimization in Federated Learning: Approaching Global Consistency and Smooth Landscapecited by 46
- 2020Evolving Normalization-Activation Layerscited by 45
- 2023Improving the Model Consistency of Decentralized Federated Learningcited by 45
- 2023An Adaptive Policy to Employ Sharpness-Aware Minimizationcited by 43
- 2021DAdaQuant: Doubly-adaptive quantization for communication-efficient Federated Learningcited by 41
- 2022BEER: Fast O(1/T) Rate for Decentralized Nonconvex Optimization with Communication Compressioncited by 41
- 2020PowerGossip: Practical Low-Rank Communication Compression in Decentralized Deep Learningcited by 35
- 2021Cross-Gradient Aggregation for Decentralized Learning from Non-IID datacited by 33
- 2023Practical Sharpness-Aware Minimization Cannot Converge All the Way to Optimacited by 20
- 2023Decentralized SGD and Average-direction SAM are Asymptotically Equivalentcited by 15
- 2020Decentralized Deep Learning using Momentum-Accelerated Consensuscited by 14
- 2023Global Update Tracking: A Decentralized Learning Algorithm for Heterogeneous Datacited by 12
Built on by
Not cited yet.