{"total":20,"rows":[{"id":"2103.15888","title":"The Complexity of Nonconvex-Strongly-Concave Minimax Optimization","created":"2021-03-29","cited_by_count":45,"area":null},{"id":"2102.05274","title":"Stability of SGD: Tightness Analysis and Improved Bounds","created":"2021-02-10","cited_by_count":33,"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":"2410.16561","title":"Revisiting Gradient Normalization and Clipping for Nonconvex SGD under Heavy-Tailed Noise: Necessity, Sufficiency, and Acceleration","created":"2024-10-21","cited_by_count":18,"area":null},{"id":"2106.01761","title":"Near Optimal Stochastic Algorithms for Finite-Sum Unbalanced Convex-Concave Minimax Optimization","created":"2021-06-03","cited_by_count":16,"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":"2203.13225","title":"Distributionally Robust Optimization via Ball Oracle Acceleration","created":"2022-03-24","cited_by_count":14,"area":null},{"id":"2402.07101","title":"On the Complexity of First-Order Methods in Stochastic Bilevel Optimization","created":"2024-02-11","cited_by_count":12,"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":"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":"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":"2103.05138","title":"On the Oracle Complexity of Higher-Order Smooth Non-Convex Finite-Sum Optimization","created":"2021-03-08","cited_by_count":1,"area":null},{"id":"2109.08711","title":"Experimental Evaluation of Computational Complexity for Different Neural Network Equalizers in Optical Communications","created":"2021-09-17","cited_by_count":1,"area":null},{"id":"2506.20630","title":"First-order methods for stochastic and finite-sum convex optimization with deterministic constraints","created":"2025-06-25","cited_by_count":1,"area":null},{"id":"2609.08133","title":"Sparse Data Augmentation for Optimization with Provable Guarantees","created":"2026-09-08","cited_by_count":1,"area":null},{"id":"2505.01258","title":"A Provably Convergent Plug-and-Play Framework for Stochastic Bilevel Optimization","created":"2025-05-02","cited_by_count":0,"area":null},{"id":"2602.11789","title":"Decentralized Non-convex Stochastic Optimization with Heterogeneous Variance","created":"2026-02-12","cited_by_count":0,"area":null},{"id":"2610.04944","title":"Near-Optimal Complexity of Finite-Sum Nonconvex-Strongly-Concave Minimax Optimization","created":"2026-10-04","cited_by_count":0,"area":null}],"next_cursor":null}