{"total":22,"rows":[{"id":"2106.09481","title":"Stochastic Bias-Reduced Gradient Methods","created":"2021-06-17","cited_by_count":25,"area":null},{"id":"2307.04504","title":"An Algorithm with Optimal Dimension-Dependence for Zero-Order Nonsmooth Nonconvex Stochastic Optimization","created":"2023-07-10","cited_by_count":23,"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.15260","title":"Efficient Convex Optimization Requires Superlinear Memory","created":"2022-03-29","cited_by_count":14,"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":"2112.01118","title":"Near-Optimal Lower Bounds For Convex Optimization For All Orders of Smoothness","created":"2021-12-02","cited_by_count":6,"area":null},{"id":"2404.04931","title":"The Sample Complexity of Gradient Descent in Stochastic Convex Optimization","created":"2024-04-07","cited_by_count":6,"area":null},{"id":"2302.04963","title":"Quadratic Memory is Necessary for Optimal Query Complexity in Convex Optimization: Center-of-Mass is Pareto-Optimal","created":"2023-02-09","cited_by_count":5,"area":null},{"id":"2102.04259","title":"Concentration of Non-Isotropic Random Tensors with Applications to Learning and Empirical Risk Minimization","created":"2021-02-04","cited_by_count":4,"area":null},{"id":"2306.12534","title":"Memory-Query Tradeoffs for Randomized Convex Optimization","created":"2023-06-21","cited_by_count":4,"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":"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":"2511.13999","title":"On the Gradient Complexity of Private Optimization with Private Oracles","created":"2025-11-17","cited_by_count":2,"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":"2404.06720","title":"Gradient Descent is Pareto-Optimal in the Oracle Complexity and Memory Tradeoff for Feasibility Problems","created":"2024-04-10","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":"2607.24827","title":"Stronger Memory-Query Tradeoffs for Convex Optimization: The Limitations of Subquadratic Memory","created":"2026-07-21","cited_by_count":0,"area":null},{"id":"2610.13787","title":"Optimal Algorithms for Nonsmooth Nonconvex Stochastic Optimization with Constraints","created":"2026-10-09","cited_by_count":0,"area":null}],"next_cursor":null}