Research map / Optimization / Distributed and compressed
Birch SGD: A Tree Graph Framework for Local and Asynchronous SGD Methods
Alexander Tyurin, Danil Sivtsov
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use Ringmaster ASGD (frequent updates) instead of other methods when communication is free | ResNet18 on CIFAR10, n=8 · CIFAR10 (ResNet18, classical regime) | convergence vs simulated time | Improved |
| Ringmaster ASGD under slow communications (tau=100) | Ringmaster ASGD · MNIST logistic regression (slow communications) | convergence vs simulated time | Hurt |
| add local steps with asynchronous updates (Async-Local SGD) | distributed SGD · MNIST logistic regression (heterogeneous computations/communications) | convergence vs simulated time | Improved |
| increase batch size B (delay radius R) beyond theory-optimal value in Rennala SGD (ablation) | Rennala SGD · MNIST logistic regression (n=100, slow communications) | convergence vs simulated time | Hurt |
| use Cycle SGD (sync only 8 of 64 workers) instead of full synchronization | Cycle SGD · MNIST logistic regression (communication time 1.5k) | total time | Improved |
Closest papers by meaning
- Do We Need Asynchronous SGD? On the Near-Optimality of Synchronous Methods (NeurIPS 2026 · similarity 0.88)
- Rescaled Asynchronous SGD: Optimal Distributed Optimization under Data and System Heterogeneity (NeurIPS 2026 · similarity 0.87)
- Tight Time Complexities in Parallel Stochastic Optimization with Arbitrary Computation Dynamics (ICLR 2025 · similarity 0.87)
- Shadowheart SGD: Distributed Asynchronous SGD with Optimal Time Complexity Under Arbitrary Computation and Communication Heterogeneity (NeurIPS 2024 · similarity 0.86)
- Freya PAGE: First Optimal Time Complexity for Large-Scale Nonconvex Finite-Sum Optimization with Heterogeneous Asynchronous Computations (NeurIPS 2024 · similarity 0.86)
- Ringmaster ASGD: The First Asynchronous SGD with Optimal Time Complexity (ICML 2025 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
