{"total":20,"rows":[{"id":"2104.09342","title":"Random Reshuffling with Variance Reduction: New Analysis and Better Rates","created":"2021-04-19","cited_by_count":19,"area":null},{"id":"2109.04522","title":"Asynchronous Iterations in Optimization: New Sequence Results and Sharper Algorithmic Guarantees","created":"2021-09-09","cited_by_count":17,"area":null},{"id":"2104.12112","title":"Improved Analysis and Rates for Variance Reduction under Without-replacement Sampling Orders","created":"2021-04-25","cited_by_count":13,"area":null},{"id":"2202.08550","title":"Delay-adaptive step-sizes for asynchronous learning","created":"2022-02-17","cited_by_count":11,"area":null},{"id":"2111.13322","title":"Random-reshuffled SARAH does not need a full gradient computations","created":"2021-11-26","cited_by_count":7,"area":null},{"id":"2106.14956","title":"Robust Distributed Optimization With Randomly Corrupted Gradients","created":"2021-06-28","cited_by_count":6,"area":null},{"id":"2309.04980","title":"Linear Speedup of Incremental Aggregated Gradient Methods on Streaming Data","created":"2023-09-10","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":"2102.13244","title":"Cyclic Coordinate Dual Averaging with Extrapolation","created":"2021-02-26","cited_by_count":3,"area":null},{"id":"2410.02478","title":"Temporal Predictive Coding for Gradient Compression in Distributed Learning","created":"2024-10-03","cited_by_count":2,"area":null},{"id":"2502.14648","title":"Variance Reduction Methods Do Not Need to Compute Full Gradients: Improved Efficiency through Shuffling","created":"2025-02-20","cited_by_count":2,"area":null},{"id":"2307.06886","title":"Min-Max Optimization under Delays","created":"2023-07-13","cited_by_count":1,"area":null},{"id":"2405.16966","title":"Dual-Delayed Asynchronous SGD for Arbitrarily Heterogeneous Data","created":"2024-05-27","cited_by_count":1,"area":null},{"id":"2212.01848","title":"Convergence of ease-controlled Random Reshuffling gradient Algorithms under Lipschitz smoothness","created":"2022-12-04","cited_by_count":0,"area":null},{"id":"2306.15848","title":"Ordering for Non-Replacement SGD","created":"2023-06-28","cited_by_count":0,"area":null},{"id":"2411.15795","title":"Beyond adaptive gradient: Fast-Controlled Minibatch Algorithm for large-scale optimization","created":"2024-11-24","cited_by_count":0,"area":null},{"id":"2506.12444","title":"Adjusted Shuffling SARAH: Advancing Complexity Analysis via Dynamic Gradient Weighting","created":"2025-06-14","cited_by_count":0,"area":null},{"id":"2509.04133","title":"Shuffling Heuristic in Variational Inequalities: Establishing New Convergence Guarantees","created":"2025-09-04","cited_by_count":0,"area":null},{"id":"2602.05304","title":"A Short and Unified Convergence Analysis of the SAG, SAGA, and IAG Algorithms","created":"2026-02-05","cited_by_count":0,"area":null},{"id":"2608.04406","title":"Incremental Aggregation on the Grassmannian for Asynchronous Eigenspace Computation","created":"2026-08-05","cited_by_count":0,"area":null}],"next_cursor":null}