Asynchronous fully-decentralized SGD in the cluster-based model

DOI10.1016/J.TCS.2025.115073MaRDI QIDQ7026229zbMATH OpenFDO

Authors Hagit Attiya, Noa Schiller

Publication date 18 February 2025

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2025.115073

zbMATH Keywords

cluster-based modelSGD

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Applications of mathematical programming (90C90)

Cites work

• A Stochastic Approximation Method
• Approximate Byzantine Fault-Tolerance in Distributed Optimization
• Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
• Convex optimization: algorithms and complexity
• Distributed Computing with the Cloud
• Distributed Subgradient Methods for Multi-Agent Optimization
• Fast multidimensional asymptotic and approximate consensus
• Fault-Tolerance in Distributed Optimization: The Case of Redundancy
• Fault-Tolerant Multi-Agent Optimization
• Genuinely Distributed Byzantine Machine Learning
• scientific article; zbMATH DE number 7650878 (Why is no real title available?)
• scientific article; zbMATH DE number 7774308 (Why is no real title available?)
• Information-Theoretic Lower Bounds on the Oracle Complexity of Stochastic Convex Optimization
• Multidimensional agreement in Byzantine systems
• Optimization methods for large-scale machine learning
• Principles of Distributed Systems
• Reaching approximate agreement in the presence of faults
• Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming
• The Convergence of Stochastic Gradient Descent in Asynchronous Shared Memory

This page was built for publication: Asynchronous fully-decentralized SGD in the cluster-based model

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