mlsanityData to 7 Oct 2026

Asynchronous Parallel Incremental Block-Coordinate Descent for Decentralized Machine Learning

arXiv 2202.03263 ↗First posted 7 Feb 2022cs.LG cs.MAcited by 1

Not on the map. Why?

Abstract (arXiv)

Machine learning (ML) is a key technique for big-data-driven modelling and analysis of massive Internet of Things (IoT) based intelligent and ubiquitous computing. For fast-increasing applications and data amounts, distributed learning is a promising emerging paradigm since it is often impractical or inefficient to share/aggregate data to a centralized location from distinct ones. This paper studies the problem of training an ML model over decentralized systems, where data are distributed over many user devices and the learning algorithm run on-device, with the aim of relaxing the burden at a central entity/server. Although gossip-based approaches have been used for this purpose in different use cases, they suffer from high communication costs, especially when the number of devices is large. To mitigate this, incremental-based methods are proposed. We first introduce incremental block-coordinate descent (I-BCD) for the decentralized ML, which can reduce communication costs at the expense of running time. To accelerate the convergence speed, an asynchronous parallel incremental BCD (API-BCD) method is proposed, where multiple devices/agents are active in an asynchronous fashion. We derive convergence properties for the proposed methods. Simulation results also show that our API-BCD method outperforms state of the art in terms of running time and communication costs.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 18 of its 34 references that are in the map. First posted on arXiv 7 Feb 2022.

Builds on

18 of 34 references.

References · 18

  1. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
  2. 2019Federated Learning: Challenges, Methods, and Future Directionscited by 1,531
  3. 2016Federated Learning: Strategies for Improving Communication Efficiencycited by 1,461
  4. 2019The Non-IID Data Quagmire of Decentralized Machine Learningcited by 303
  5. 2017Deep Reinforcement Learning framework for Autonomous Drivingcited by 224
  6. 2014EXTRA: An Exact First-Order Algorithm for Decentralized Consensus Optimizationcited by 160
  7. 2013On the Convergence of Decentralized Gradient Descentcited by 158
  8. 2018On Markov Chain Gradient Descentcited by 63
  9. 2013On the Linear Convergence of the ADMM in Decentralized Consensus Optimizationcited by 57
  10. 2018Walkman: A Communication-Efficient Random-Walk Algorithm for Decentralized Optimizationcited by 30
  11. 2014Asynchronous Stochastic Coordinate Descent: Parallelism and Convergence Propertiescited by 21
  12. 2021Federated Learning over Wireless IoT Networks with Optimized Communication and Resourcescited by 13
6 more
  1. 2019Distributed Nesterov gradient methods over arbitrary graphscited by 6
  2. 2020Coded Stochastic ADMM for Decentralized Consensus Optimization with Edge Computingcited by 5
  3. 2019Decentralized Consensus Optimization Based on Parallel Random Walkcited by 4
  4. 2015Newton-like method with diagonal correction for distributed optimizationcited by 3
  5. 2016On the Convergence of Asynchronous Parallel Iteration with Unbounded Delayscited by 2
  6. 2020Privacy-preserving Incremental ADMM for Decentralized Consensus Optimizationcited by 2

Built on by

Cited by year

Citing papers per year: 2023: 1.

1 paper.