OledFL: Unleashing the Potential of Decentralized Federated Learning via Opposite Lookahead Enhancement
Not on the map. Why?
Abstract (arXiv)
Decentralized Federated Learning (DFL) surpasses Centralized Federated Learning (CFL) in terms of faster training, privacy preservation, and light communication, making it a promising alternative in the field of federated learning. However, DFL still exhibits significant disparities with CFL in terms of generalization ability such as rarely theoretical understanding and degraded empirical performance due to severe inconsistency. In this paper, we enhance the consistency of DFL by developing an opposite lookahead enhancement technique (Ole), yielding OledFL to optimize the initialization of each client in each communication round, thus significantly improving both the generalization and convergence speed. Moreover, we rigorously establish its convergence rate in non-convex setting and characterize its generalization bound through uniform stability, which provides concrete reasons why OledFL can achieve both the fast convergence speed and high generalization ability. Extensive experiments conducted on the CIFAR10 and CIFAR100 datasets with Dirichlet and Pathological distributions illustrate that our OledFL can achieve up to 5% performance improvement and 8× speedup, compared to the most popular DFedAvg optimizer in DFL.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 44 of its 57 references that are in the map. First posted on arXiv 9 Oct 2024.
Builds on
44 of 57 references.
References · 44
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
- 2019Advances and Open Problems in Federated Learningcited by 3,021
- 2018Federated Optimization in Heterogeneous Networkscited by 2,971
- 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,337
- 2019Measuring the Effects of Non-Identical Data Distribution for Federated Visual Classificationcited by 836
- 2021Federated Learning Based on Dynamic Regularizationcited by 555
- 2015Train faster, generalize better: Stability of stochastic gradient descentcited by 547
- 2017Computing Nonvacuous Generalization Bounds for Deep (Stochastic) Neural Networks with Many More Parameters than Training Datacited by 527
- 2017Can Decentralized Algorithms Outperform Centralized Algorithms? A Case Study for Decentralized Parallel Stochastic Gradient Descentcited by 496
- 2014SAGA: A Fast Incremental Gradient Method With Support for Non-Strongly Convex Composite Objectivescited by 401
- 2020A Unified Theory of Decentralized SGD with Changing Topology and Local Updatescited by 361
- 2019Lookahead Optimizer: k steps forward, 1 step backcited by 333
32 more
- 2020Personalized Federated Learning with First Order Model Optimizationcited by 201
- 2021Achieving Linear Speedup with Partial Worker Participation in Non-IID Federated Learningcited by 192
- 2013Minimizing Finite Sums with the Stochastic Average Gradientcited by 164
- 2020Mime: Mimicking Centralized Stochastic Algorithms in Federated Learningcited by 152
- 2022Generalized Federated Learning via Sharpness Aware Minimizationcited by 144
- 2020FedPD: A Federated Learning Framework with Optimal Rates and Adaptivity to Non-IID Datacited by 143
- 2022Decentralized Federated Learning: Fundamentals, State of the Art, Frameworks, Trends, and Challengescited by 137
- 2021Decentralized Federated Averagingcited by 114
- 2022Improving Generalization in Federated Learning by Seeking Flat Minimacited by 98
- 2023Decentralized Federated Learning: A Survey and Perspectivecited by 86
- 2019Peer-to-peer Federated Learning on Graphscited by 85
- 2017Optimal algorithms for smooth and strongly convex distributed optimization in networkscited by 81
- 2014A Proximal Stochastic Gradient Method with Progressive Variance Reductioncited by 78
- 2021FedCM: Federated Learning with Client-level Momentumcited by 77
- 2022DisPFL: Towards Communication-Efficient Personalized Federated Learning via Decentralized Sparse Trainingcited by 74
- 2020Optimal Complexity in Decentralized Trainingcited by 59
- 2021Exponential Graph is Provably Efficient for Decentralized Deep Trainingcited by 55
- 2015A Universal Catalyst for First-Order Optimizationcited by 54
- 2023FedSpeed: Larger Local Interval, Less Communication Round, and Higher Generalization Accuracycited by 49
- 2023Improving the Model Consistency of Decentralized Federated Learningcited by 45
- 2022Federated Learning via Inexact ADMMcited by 44
- 2022Topology-aware Generalization of Decentralized SGDcited by 37
- 2021Stability of SGD: Tightness Analysis and Improved Boundscited by 33
- 2020Privacy Amplification by Decentralizationcited by 28
- 2023A Survey on Decentralized Federated Learningcited by 27
- 2022Revisiting Optimal Convergence Rate for Smooth and Non-convex Stochastic Decentralized Optimizationcited by 22
- 2023Understanding How Consistency Works in Federated Learning via Stage-wise Relaxed Initializationcited by 21
- 2021Optimal Gradient Tracking for Decentralized Optimizationcited by 18
- 2023Stability and Generalization of the Decentralized Stochastic Gradient Descent Ascent Algorithmcited by 8
- 2023DFedADMM: Dual Constraints Controlled Model Inconsistency for Decentralized Federated Learningcited by 6
- 2020An acceleration of decentralized SGD under general assumptions with low stochastic noisecited by 3
- 2024An Accelerated Distributed Stochastic Gradient Method with Momentumcited by 3
Built on by
Citing papers per year: 2025: 1.
1 paper.