{"total":31,"rows":[{"id":"2102.01583","title":"The Min-Max Complexity of Distributed Stochastic Convex Optimization with Intermittent Communication","created":"2021-02-02","cited_by_count":31,"area":null},{"id":"2106.09481","title":"Stochastic Bias-Reduced Gradient Methods","created":"2021-06-17","cited_by_count":25,"area":null},{"id":"2205.09647","title":"The First Optimal Acceleration of High-Order Methods in Smooth Convex Optimization","created":"2022-05-19","cited_by_count":20,"area":null},{"id":"2105.01778","title":"Thinking Inside the Ball: Near-Optimal Minimization of the Maximal Loss","created":"2021-05-04","cited_by_count":17,"area":null},{"id":"2301.00457","title":"ReSQueing Parallel and Private Stochastic Convex Optimization","created":"2023-01-01","cited_by_count":17,"area":null},{"id":"2106.11938","title":"Robust Regression Revisited: Acceleration and Improved Estimation Rates","created":"2021-06-22","cited_by_count":15,"area":null},{"id":"2107.00469","title":"Never Go Full Batch (in Stochastic Convex Optimization)","created":"2021-06-29","cited_by_count":14,"area":null},{"id":"2203.13225","title":"Distributionally Robust Optimization via Ball Oracle Acceleration","created":"2022-03-24","cited_by_count":14,"area":null},{"id":"2403.03562","title":"Efficient Algorithms for Empirical Group Distributionally Robust Optimization and Beyond","created":"2024-03-06","cited_by_count":11,"area":null},{"id":"2206.08627","title":"RECAPP: Crafting a More Efficient Catalyst for Convex Optimization","created":"2022-06-17","cited_by_count":8,"area":null},{"id":"2209.10346","title":"On the Complexity of Finding Small Subgradients in Nonsmooth Optimization","created":"2022-09-21","cited_by_count":8,"area":null},{"id":"2306.14041","title":"Smoothed $f$-Divergence Distributionally Robust Optimization","created":"2023-06-24","cited_by_count":7,"area":null},{"id":"2306.14381","title":"Gradient Descent Converges Linearly for Logistic Regression on Separable Data","created":"2023-06-26","cited_by_count":7,"area":null},{"id":"2308.14742","title":"Minimizing Quasi-Self-Concordant Functions by Gradient Regularization of Newton Method","created":"2023-08-28","cited_by_count":7,"area":null},{"id":"2110.02954","title":"A Stochastic Newton Algorithm for Distributed Convex Optimization","created":"2021-10-07","cited_by_count":6,"area":null},{"id":"2502.02002","title":"The Ball-Proximal (=\"Broximal\") Point Method: a New Algorithm, Convergence Theory, and Applications","created":"2025-02-04","cited_by_count":5,"area":null},{"id":"2211.14645","title":"Accelerated Riemannian Optimization: Handling Constraints with a Prox to Bound Geometric Penalties","created":"2022-11-26","cited_by_count":4,"area":null},{"id":"2412.06990","title":"The Oracle Complexity of Simplex-based Matrix Games","created":"2024-12-09","cited_by_count":4,"area":null},{"id":"2510.00823","title":"Non-Euclidean Broximal Point Method: A Blueprint for Geometry-Aware Optimization","created":"2025-10-01","cited_by_count":4,"area":null},{"id":"2111.02763","title":"Understanding Riemannian Acceleration via a Proximal Extragradient Framework","created":"2021-11-04","cited_by_count":3,"area":null},{"id":"2311.10886","title":"A Whole New Ball Game: A Primal Accelerated Method for Matrix Games and Minimizing the Maximum of Smooth Functions","created":"2023-11-17","cited_by_count":3,"area":null},{"id":"2404.14875","title":"Regularized Gauss-Newton for Optimizing Overparameterized Neural Networks","created":"2024-04-23","cited_by_count":3,"area":null},{"id":"2406.07373","title":"Closing the Computational-Query Depth Gap in Parallel Stochastic Convex Optimization","created":"2024-06-11","cited_by_count":3,"area":null},{"id":"2411.08987","title":"Non-Euclidean High-Order Smooth Convex Optimization","created":"2024-11-13","cited_by_count":3,"area":null},{"id":"2506.13710","title":"Gradient-Normalized Smoothness for Optimization with Approximate Hessians","created":"2025-06-16","cited_by_count":3,"area":null},{"id":"2106.08855","title":"Beyond Tikhonov: Faster Learning with Self-Concordant Losses via Iterative Regularization","created":"2021-06-16","cited_by_count":1,"area":null},{"id":"2403.16317","title":"Optimization on a Finer Scale: Bounded Local Subgradient Variation Perspective","created":"2024-03-24","cited_by_count":1,"area":null},{"id":"2409.19200","title":"Faster Acceleration for Steepest Descent","created":"2024-09-28","cited_by_count":1,"area":null},{"id":"2506.08362","title":"Solving Convex-Concave Problems with $\\tilde{\\mathcal{O}}(\\epsilon^{-4/7})$ Second-Order Oracle Complexity","created":"2025-06-10","cited_by_count":0,"area":null},{"id":"2607.04062","title":"Fast, Parallel, Query-Efficient Binary Classification","created":"2026-07-05","cited_by_count":0,"area":null},{"id":"2608.21359","title":"Primal Acceleration of Newton's Method","created":"2026-08-21","cited_by_count":0,"area":null}],"next_cursor":null}