ISTA Publications
metadata only
Revisiting LocalSGD and SCAFFOLD: Improved rates and missing analysis
LocalSGD and SCAFFOLD are widely used methods in distributed stochastic optimization, with numerous applications in machine learning, large-scale data processing, and federated learning. However, rigorously establishing their theoretical advantages over simpler methods, such as minibatch SGD (MbSGD)
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
- Random Reshuffling Dominates Stochastic Gradient Descent#324881
- Clipping Makes Distributed and Federated Asynchronous SGD Robust to Stragglers#271792
- Tackling Parallelization Challenges of Randomized Preconditioners With Dependency Tracking#997434
- Randomized Subspace Nesterov Accelerated Gradient#151726
- What's in a Smoothness Constant? Tighter Rates for Local SGD with Bounded Second-order Heterogeneity#373410
Record · ID 1066574
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