arXiv (All)
open access
Do We Need Asynchronous SGD? On the Near-Optimality of Synchronous Methods
Modern distributed optimization methods mostly rely on traditional synchronous approaches, despite substantial recent progress in asynchronous optimization. We revisit Synchronous SGD and its robust variant, called $m$-Synchronous SGD, which can be interpreted as a method with a backup-worker strate
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Federated SGD with local asynchrony#1251619
- dSTAR: Straggler Tolerant and Byzantine Resilient Distributed SGD#1035272
- Clipping Makes Distributed and Federated Asynchronous SGD Robust to Stragglers#271792
- AsGrad: A sharp unified analysis of asynchronous-SGD algorithms#1251621
- Random Reshuffling Dominates Stochastic Gradient Descent#324881
Record · ID 1400832
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive