{"total":33,"rows":[{"id":"2103.15888","title":"The Complexity of Nonconvex-Strongly-Concave Minimax Optimization","created":"2021-03-29","cited_by_count":45,"area":null},{"id":"2302.06570","title":"Beyond Uniform Smoothness: A Stopped Analysis of Adaptive SGD","created":"2023-02-13","cited_by_count":41,"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":"2206.00846","title":"Faster Rates of Convergence to Stationary Points in Differentially Private Optimization","created":"2022-06-02","cited_by_count":32,"area":null},{"id":"2203.06735","title":"Private Non-Convex Federated Learning Without a Trusted Server","created":"2022-03-13","cited_by_count":26,"area":null},{"id":"2202.04598","title":"Reproducibility in Optimization: Theoretical Framework and Limits","created":"2022-02-09","cited_by_count":21,"area":null},{"id":"2208.05925","title":"Near-Optimal Algorithms for Making the Gradient Small in Stochastic Minimax Optimization","created":"2022-08-11","cited_by_count":20,"area":null},{"id":"2306.14969","title":"On the Sample Complexity of Quantum Boltzmann Machine Learning","created":"2023-06-26","cited_by_count":19,"area":null},{"id":"2209.02257","title":"Faster federated optimization under second-order similarity","created":"2022-09-06","cited_by_count":18,"area":null},{"id":"2508.04860","title":"Can SGD Handle Heavy-Tailed Noise?","created":"2025-08-06","cited_by_count":17,"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":"2404.01436","title":"Convergence Guarantees for RMSProp and Adam in Generalized-smooth Non-convex Optimization with Affine Noise Variance","created":"2024-04-01","cited_by_count":14,"area":null},{"id":"2302.12909","title":"Differentially Private Algorithms for the Stochastic Saddle Point Problem with Optimal Rates for the Strong Gap","created":"2023-02-24","cited_by_count":12,"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":"2208.13592","title":"Smooth Monotone Stochastic Variational Inequalities and Saddle Point Problems: A Survey","created":"2022-08-29","cited_by_count":10,"area":null},{"id":"2311.05398","title":"The Sample Complexity Of ERMs In Stochastic Convex Optimization","created":"2023-11-09","cited_by_count":8,"area":null},{"id":"2302.03542","title":"Two Losses Are Better Than One: Faster Optimization Using a Cheaper Proxy","created":"2023-02-07","cited_by_count":7,"area":null},{"id":"2407.15453","title":"Regression under demographic parity constraints via unlabeled post-processing","created":"2024-07-22","cited_by_count":5,"area":null},{"id":"2604.16620","title":"Lower Bounds and Proximally Anchored SGD for Non-Convex Minimization Under Unbounded Variance","created":"2026-04-17","cited_by_count":5,"area":null},{"id":"2105.12062","title":"Practical Schemes for Finding Near-Stationary Points of Convex Finite-Sums","created":"2021-05-25","cited_by_count":4,"area":null},{"id":"2311.13447","title":"Differentially Private Non-Convex Optimization under the KL Condition with Optimal Rates","created":"2023-11-22","cited_by_count":4,"area":null},{"id":"2502.09257","title":"From Contextual Combinatorial Semi-Bandits to Bandit List Classification: Improved Sample Complexity with Sparse Rewards","created":"2025-02-13","cited_by_count":4,"area":null},{"id":"2510.11676","title":"Accelerated stochastic first-order method for convex optimization under heavy-tailed noise","created":"2025-10-13","cited_by_count":4,"area":null},{"id":"2410.08994","title":"Optimal Downsampling for Imbalanced Classification with Generalized Linear Models","created":"2024-10-11","cited_by_count":2,"area":null},{"id":"2504.03560","title":"Stochastic Optimization with Optimal Importance Sampling","created":"2025-04-04","cited_by_count":2,"area":null},{"id":"2607.06883","title":"Finding a stationary point of a stochastic convex problem","created":"2026-07-08","cited_by_count":2,"area":null},{"id":"2512.04008","title":"Efficient Public Verification of Private ML via Regularization","created":"2025-12-03","cited_by_count":1,"area":null},{"id":"2512.14246","title":"Randomized multi-class classification under system constraints: a unified approach via post-processing","created":"2025-12-16","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":"2512.14686","title":"Bias-Variance Trade-off for Clipped Stochastic First-Order Methods: From Bounded Variance to Infinite Mean","created":"2025-12-16","cited_by_count":0,"area":null},{"id":"2609.15257","title":"Improving the Last-Iterate Guarantees of Anytime Algorithms for Stochastic Monotone Variational Inequalities","created":"2026-09-14","cited_by_count":0,"area":null},{"id":"2609.28543","title":"Stochastic Inertial Krasnosel'skii-Mann Iteration Achieves Near-Optimal Sample Complexity","created":"2026-09-22","cited_by_count":0,"area":null},{"id":"2610.05038","title":"Optimal Oracle Complexity for Finite-Sum Monotone Inclusions","created":"2026-10-04","cited_by_count":0,"area":null}],"next_cursor":null}