mlsanityData to 14 Oct 2026

BlueFog: Make Decentralized Algorithms Practical for Optimization and Deep Learning

arXiv 2111.04287 ↗First posted 8 Nov 2021cs.DC cs.LGcited by 16

Not on the map. Why?

Abstract (arXiv)

Decentralized algorithm is a form of computation that achieves a global goal through local dynamics that relies on low-cost communication between directly-connected agents. On large-scale optimization tasks involving distributed datasets, decentralized algorithms have shown strong, sometimes superior, performance over distributed algorithms with a central node. Recently, developing decentralized algorithms for deep learning has attracted great attention. They are considered as low-communication-overhead alternatives to those using a parameter server or the Ring-Allreduce protocol. However, the lack of an easy-to-use and efficient software package has kept most decentralized algorithms merely on paper. To fill the gap, we introduce BlueFog, a python library for straightforward, high-performance implementations of diverse decentralized algorithms. Based on a unified abstraction of various communication operations, BlueFog offers intuitive interfaces to implement a spectrum of decentralized algorithms, from those using a static, undirected graph for synchronous operations to those using dynamic and directed graphs for asynchronous operations. BlueFog also adopts several system-level acceleration techniques to further optimize the performance on the deep learning tasks. On mainstream DNN training tasks, BlueFog reaches a much higher throughput and achieves an overall 1.2× ~ 1.8× speedup over Horovod, a state-of-the-art distributed deep learning package based on Ring-Allreduce. BlueFog is open source at https://github.com/Bluefog-Lib/bluefog.

Key facts. Cited by 16 papers in the map (data through 14 Oct 2026). Builds on 47 of its 89 references that are in the map. First posted on arXiv 8 Nov 2021.

Builds on

47 of 89 references.

References · 47

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  3. 2020Language Models are Few-Shot Learnerscited by 32,419
  4. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  5. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
  6. 2019EfficientNet: Rethinking Model Scaling for Convolutional Neural Networkscited by 6,442
  7. 2018MobileNetV2: Inverted Residuals and Linear Bottleneckscited by 4,795
  8. 2017Accurate, Large Minibatch SGD: Training ImageNet in 1 Hourcited by 1,492
  9. 2018Local SGD Converges Fast and Communicates Littlecited by 605
  10. 2017Can Decentralized Algorithms Outperform Centralized Algorithms? A Case Study for Decentralized Parallel Stochastic Gradient Descentcited by 502
  11. 2020A Unified Theory of Decentralized SGD with Changing Topology and Local Updatescited by 367
  12. 2018Horovod: fast and easy distributed deep learning in TensorFlowcited by 279
35 more
  1. 2019Decentralized Stochastic Optimization and Gossip Algorithms with Compressed Communicationcited by 221
  2. 2019On the Linear Speedup Analysis of Communication Efficient Momentum SGD for Distributed Non-Convex Optimizationcited by 180
  3. 2014EXTRA: An Exact First-Order Algorithm for Decentralized Consensus Optimizationcited by 160
  4. 2017Asynchronous Decentralized Parallel Stochastic Gradient Descentcited by 159
  5. 2018Demystifying Parallel and Distributed Deep Learning: An In-Depth Concurrency Analysiscited by 156
  6. 2018Stochastic Gradient Push for Distributed Deep Learningcited by 152
  7. 2016Achieving Geometric Convergence for Distributed Optimization over Time-Varying Graphscited by 150
  8. 2018D2: Decentralized Training over Decentralized Datacited by 140
  9. 2019Decentralized Deep Learning with Arbitrary Communication Compressioncited by 111
  10. 2016NEXT: In-Network Nonconvex Optimizationcited by 107
  11. 2019DoubleSqueeze: Parallel Stochastic Gradient Descent with Double-Pass Error-Compensated Compressioncited by 99
  12. 2018LAG: Lazily Aggregated Gradient for Communication-Efficient Distributed Learningcited by 96
  13. 2016A Large Contextual Dataset for Classification, Detection and Counting of Cars with Deep Learningcited by 86
  14. 2017Optimal algorithms for smooth and strongly convex distributed optimization in networkscited by 83
  15. 2013Distributed optimization over time-varying directed graphscited by 78
  16. 2021Quasi-Global Momentum: Accelerating Decentralized Deep Learning on Heterogeneous Datacited by 69
  17. 2020Optimal Complexity in Decentralized Trainingcited by 60
  18. 2013On the Linear Convergence of the ADMM in Decentralized Consensus Optimizationcited by 57
  19. 2021Exponential Graph is Provably Efficient for Decentralized Deep Trainingcited by 56
  20. 2020An improved convergence analysis for decentralized online stochastic non-convex optimizationcited by 53
  21. 2017A decentralized proximal-gradient method with network independent step-sizes and separated convergence ratescited by 51
  22. 2017Exact Diffusion for Distributed Optimization and Learning --- Part I: Algorithm Developmentcited by 50
  23. 2021Consensus Control for Decentralized Deep Learningcited by 49
  24. 2018Push-Pull Gradient Methods for Distributed Optimization in Networkscited by 46
  25. 2021A Unified and Refined Convergence Analysis for Non-Convex Decentralized Learningcited by 44
  26. 2021DecentLaM: Decentralized Momentum SGD for Large-batch Deep Trainingcited by 40
  27. 2021RelaySum for Decentralized Deep Learning on Heterogeneous Datacited by 39
  28. 2021Removing Data Heterogeneity Influence Enhances Network Topology Dependence of Decentralized SGDcited by 29
  29. 2018A Dual Approach for Optimal Algorithms in Distributed Optimization over Networkscited by 27
  30. 2018A linear algorithm for optimization over directed graphs with geometric convergencecited by 25
  31. 2021Accelerating Gossip SGD with Periodic Global Averagingcited by 25
  32. 2013Complexity of Word Collocation Networks: A Preliminary Structural Analysiscited by 17
  33. 2021Improving the Transient Times for Distributed Stochastic Gradient Methodscited by 13
  34. 2021BAGUA: Scaling up Distributed Learning with System Relaxationscited by 13
  35. 2021A Stochastic Proximal Gradient Framework for Decentralized Non-Convex Composite Optimization: Topology-Independent Sample Complexity and Communication Efficiencycited by 11

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2022: 7; 2023: 4; 2024: 2; 2025: 1; 2026: 2.

16 papers.

Sort: