{"total":23,"rows":[{"id":"2501.16168","title":"Ringmaster ASGD: The First Asynchronous SGD with Optimal Time Complexity","created":"2025-01-27","cited_by_count":18,"area":null},{"id":"2310.20452","title":"AsGrad: A Sharp Unified Analysis of Asynchronous-SGD Algorithms","created":"2023-10-31","cited_by_count":16,"area":null},{"id":"2306.16484","title":"Towards a Better Theoretical Understanding of Independent Subnetwork Training","created":"2023-06-28","cited_by_count":6,"area":null},{"id":"2405.00017","title":"Queuing dynamics of asynchronous Federated Learning","created":"2024-02-12","cited_by_count":6,"area":null},{"id":"2410.04285","title":"MindFlayer SGD: Efficient Parallel SGD in the Presence of Heterogeneous and Random Worker Compute Times","created":"2024-10-05","cited_by_count":6,"area":null},{"id":"2405.15545","title":"Freya PAGE: First Optimal Time Complexity for Large-Scale Nonconvex Finite-Sum Optimization with Heterogeneous Asynchronous Computations","created":"2024-05-24","cited_by_count":5,"area":null},{"id":"2502.00775","title":"ATA: Adaptive Task Allocation for Efficient Resource Management in Distributed Machine Learning","created":"2025-02-02","cited_by_count":5,"area":null},{"id":"2509.22860","title":"Ringleader ASGD: The First Asynchronous SGD with Optimal Time Complexity under Data Heterogeneity","created":"2025-09-26","cited_by_count":5,"area":null},{"id":"2502.08206","title":"Optimizing Asynchronous Federated Learning: A Delicate Trade-Off Between Model-Parameter Staleness and Update Frequency","created":"2025-02-12","cited_by_count":2,"area":null},{"id":"2601.19379","title":"Optimal Asynchronous Stochastic Nonconvex Optimization under Heavy-Tailed Noise","created":"2026-01-27","cited_by_count":2,"area":null},{"id":"2605.13434","title":"Rescaled Asynchronous SGD: Optimal Distributed Optimization under Data and System Heterogeneity","created":"2026-05-13","cited_by_count":2,"area":null},{"id":"2605.18174","title":"Ringmaster LMO: Asynchronous Linear Minimization Oracle Momentum Method","created":"2026-05-18","cited_by_count":2,"area":null},{"id":"2408.07503","title":"Faster Stochastic Optimization with Arbitrary Delays via Asynchronous Mini-Batching","created":"2024-08-14","cited_by_count":1,"area":null},{"id":"2605.20866","title":"LOSCAR-SGD: Local SGD with Communication-Computation Overlap and Delay-Corrected Sparse Model Averaging","created":"2026-05-20","cited_by_count":1,"area":null},{"id":"2504.18454","title":"Pseudo-Asynchronous Local SGD: Robust and Efficient Data-Parallel Training","created":"2025-04-25","cited_by_count":0,"area":null},{"id":"2506.23836","title":"Proving the Limited Scalability of Centralized Distributed Optimization via a New Lower Bound Construction","created":"2025-06-30","cited_by_count":0,"area":null},{"id":"2509.01172","title":"Asynchronous and Stochastic Distributed Resource Allocation","created":"2025-09-01","cited_by_count":0,"area":null},{"id":"2602.03802","title":"Do We Need Asynchronous SGD? On the Near-Optimality of Synchronous Methods","created":"2026-02-03","cited_by_count":0,"area":null},{"id":"2605.02043","title":"Bringing Order to Asynchronous SGD: Towards Optimality under Data-Dependent Delays with Momentum","created":"2026-05-03","cited_by_count":0,"area":null},{"id":"2605.08871","title":"Rennala MVR: Improved Time Complexity for Parallel Stochastic Optimization via Momentum-Based Variance Reduction","created":"2026-05-09","cited_by_count":0,"area":null},{"id":"2606.04757","title":"Near-Optimal Decentralized Stochastic Convex Optimization over Networks","created":"2026-06-03","cited_by_count":0,"area":null},{"id":"2606.13287","title":"Clipping Makes Distributed and Federated Asynchronous SGD Robust to Stragglers","created":"2026-06-11","cited_by_count":0,"area":null},{"id":"2609.39357","title":"Robustifying Asynchronous SGD via Soft Throttling","created":"2026-09-30","cited_by_count":0,"area":null}],"next_cursor":null}