{"total":17,"rows":[{"id":"2103.15888","title":"The Complexity of Nonconvex-Strongly-Concave Minimax Optimization","created":"2021-03-29","cited_by_count":45,"area":null},{"id":"2104.06763","title":"Oracle Complexity in Nonsmooth Nonconvex Optimization","created":"2021-04-14","cited_by_count":39,"area":null},{"id":"2302.08300","title":"Deterministic Nonsmooth Nonconvex Optimization","created":"2023-02-16","cited_by_count":26,"area":null},{"id":"2203.15260","title":"Efficient Convex Optimization Requires Superlinear Memory","created":"2022-03-29","cited_by_count":14,"area":null},{"id":"2402.10898","title":"The Price of Adaptivity in Stochastic Convex Optimization","created":"2024-02-16","cited_by_count":11,"area":null},{"id":"2306.12534","title":"Memory-Query Tradeoffs for Randomized Convex Optimization","created":"2023-06-21","cited_by_count":4,"area":null},{"id":"2303.00972","title":"Practical Network Acceleration with Tiny Sets: Hypothesis, Theory, and Algorithm","created":"2023-03-02","cited_by_count":2,"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":"2606.00703","title":"Information-Theoretic Lower Bounds for Bit-Constrained Stochastic Optimization via a Reduction to Compressed Gaussian Mean Estimation","created":"2026-05-30","cited_by_count":1,"area":null},{"id":"2609.20701","title":"Stable Movement for Nondual Lipschitz Convex Optimization: Efficiency and Nearly Optimal Oracle Rates","created":"2026-09-17","cited_by_count":1,"area":null},{"id":"2508.13639","title":"Explainable Learning Rate Regimes for Stochastic Optimization","created":"2025-08-19","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":"2608.24527","title":"Provable Quantum-Classical Separation for Continuous Gibbs Sampling","created":"2026-08-25","cited_by_count":0,"area":null},{"id":"2609.09524","title":"Oracle Complexity of Stochastic Fixed-Point Equations with Nonexpansive Maps","created":"2026-09-08","cited_by_count":0,"area":null},{"id":"2609.13677","title":"Nonsmooth Optimization via Orthogonalized Momentum","created":"2026-09-12","cited_by_count":0,"area":null},{"id":"2609.14065","title":"Stabilizing Performative Feedback Loops with Minimal Model Deployments","created":"2026-09-12","cited_by_count":0,"area":null},{"id":"2610.13590","title":"Lower Bounds for Randomized Linear-Oracle Optimization over Strongly Convex Sets","created":"2026-10-09","cited_by_count":0,"area":null}],"next_cursor":null}