Decentralized asynchronous optimization with DADAO allows decoupling and acceleration

MaRDI QIDQ7308313zbMATH OpenFDO

Authors Adel Nabli, Edouard Oyallon

Publication date 4 August 2026

Published in Journal of Machine Learning Research (JMLR) (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://jmlr.org/papers/v26/23-0748.html

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Convex programming (90C25)

Cites work

• Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs
• An Optimal Algorithm for Decentralized Finite-Sum Optimization
• CVXPY: a Python-embedded modeling language for convex optimization
• Distributed average consensus with least-mean-square deviation
• Effective graph resistance
• Expander graphs in pure and applied mathematics
• EXTRA: an exact first-order algorithm for decentralized consensus optimization
• Fastest Mixing Markov Chain on a Graph
• scientific article; zbMATH DE number 5454133 (Why is no real title available?)
• scientific article; zbMATH DE number 3438157 (Why is no real title available?)
• Minimizing Effective Resistance of a Graph
• Networks, crowds and markets. Reasoning about a highly connected world.
• Recent theoretical advances in decentralized distributed convex optimization
• Scikit-learn: machine learning in Python
• The electrical resistance of a graph captures its commute and cover times
• The error-feedback framework: SGD with delayed gradients

This page was built for publication: Decentralized asynchronous optimization with DADAO allows decoupling and acceleration

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7308313)