{"total":13,"rows":[{"id":"2103.15888","title":"The Complexity of Nonconvex-Strongly-Concave Minimax Optimization","created":"2021-03-29","cited_by_count":45,"area":null},{"id":"2206.03665","title":"Lower Bounds and Nearly Optimal Algorithms in Distributed Learning with Communication Compression","created":"2022-06-08","cited_by_count":33,"area":null},{"id":"2103.08280","title":"Lower Complexity Bounds of Finite-Sum Optimization Problems: The Results and Construction","created":"2021-03-15","cited_by_count":24,"area":null},{"id":"2302.08766","title":"A Lower Bound and a Near-Optimal Algorithm for Bilevel Empirical Risk Minimization","created":"2023-02-17","cited_by_count":16,"area":null},{"id":"2305.16297","title":"Unbiased Compression Saves Communication in Distributed Optimization: When and How Much?","created":"2023-05-25","cited_by_count":14,"area":null},{"id":"2304.07504","title":"Stochastic Distributed Optimization under Average Second-order Similarity: Algorithms and Analysis","created":"2023-04-15","cited_by_count":11,"area":null},{"id":"2305.07612","title":"Lower Bounds and Accelerated Algorithms in Distributed Stochastic Optimization with Communication Compression","created":"2023-05-12","cited_by_count":11,"area":null},{"id":"2103.12293","title":"Stochastic Reweighted Gradient Descent","created":"2021-03-23","cited_by_count":7,"area":null},{"id":"2102.09893","title":"A Variance Controlled Stochastic Method with Biased Estimation for Faster Non-convex Optimization","created":"2021-02-19","cited_by_count":2,"area":null},{"id":"2402.02569","title":"On the Complexity of Finite-Sum Smooth Optimization under the Polyak-{\\L}ojasiewicz Condition","created":"2024-02-04","cited_by_count":2,"area":null},{"id":"2501.18164","title":"Faster Convergence of Riemannian Stochastic Gradient Descent with Increasing Batch Size","created":"2025-01-30","cited_by_count":2,"area":null},{"id":"2103.04413","title":"Escaping Saddle Points with Stochastically Controlled Stochastic Gradient Methods","created":"2021-03-07","cited_by_count":0,"area":null},{"id":"2208.03811","title":"Decomposable Non-Smooth Convex Optimization with Nearly-Linear Gradient Oracle Complexity","created":"2022-08-07","cited_by_count":0,"area":null}],"next_cursor":null}