{"total":57,"rows":[{"id":"2102.13179","title":"Machine Unlearning via Algorithmic Stability","created":"2021-02-25","cited_by_count":130,"area":"safety"},{"id":"2103.15888","title":"The Complexity of Nonconvex-Strongly-Concave Minimax Optimization","created":"2021-03-29","cited_by_count":45,"area":null},{"id":"2302.01735","title":"Rethinking Semi-Supervised Medical Image Segmentation: A Variance-Reduction Perspective","created":"2023-02-03","cited_by_count":43,"area":null},{"id":"2104.06763","title":"Oracle Complexity in Nonsmooth Nonconvex Optimization","created":"2021-04-14","cited_by_count":39,"area":null},{"id":"2202.04428","title":"Adapting to Mixing Time in Stochastic Optimization with Markovian Data","created":"2022-02-09","cited_by_count":36,"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":"2311.03252","title":"Parameter-Agnostic Optimization under Relaxed Smoothness","created":"2023-11-06","cited_by_count":29,"area":null},{"id":"2302.08300","title":"Deterministic Nonsmooth Nonconvex Optimization","created":"2023-02-16","cited_by_count":26,"area":null},{"id":"2210.07863","title":"Revisiting Optimal Convergence Rate for Smooth and Non-convex Stochastic Decentralized Optimization","created":"2022-10-14","cited_by_count":23,"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":"2301.06428","title":"Faster Gradient-Free Algorithms for Nonsmooth Nonconvex Stochastic Optimization","created":"2023-01-16","cited_by_count":17,"area":null},{"id":"2306.14853","title":"Near-Optimal Nonconvex-Strongly-Convex Bilevel Optimization with Fully First-Order Oracles","created":"2023-06-26","cited_by_count":17,"area":null},{"id":"2504.09951","title":"Towards Weaker Variance Assumptions for Stochastic Optimization","created":"2025-04-14","cited_by_count":17,"area":null},{"id":"2508.04860","title":"Can SGD Handle Heavy-Tailed Noise?","created":"2025-08-06","cited_by_count":17,"area":null},{"id":"2104.14840","title":"Unified Convergence Analysis for Adaptive Optimization with Moving Average Estimator","created":"2021-04-30","cited_by_count":13,"area":null},{"id":"2210.02482","title":"Fisher information lower bounds for sampling","created":"2022-10-05","cited_by_count":12,"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":"2310.02987","title":"Variance Reduced Halpern Iteration for Finite-Sum Monotone Inclusions","created":"2023-10-04","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":"2402.11173","title":"How to Make the Gradients Small Privately: Improved Rates for Differentially Private Non-Convex Optimization","created":"2024-02-17","cited_by_count":10,"area":null},{"id":"2101.11041","title":"Complementary Composite Minimization, Small Gradients in General Norms, and Applications","created":"2021-01-26","cited_by_count":9,"area":null},{"id":"2202.08907","title":"Sampling Approximately Low-Rank Ising Models: MCMC meets Variational Methods","created":"2022-02-17","cited_by_count":9,"area":null},{"id":"2403.02967","title":"Non-convex Stochastic Composite Optimization with Polyak Momentum","created":"2024-03-05","cited_by_count":9,"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":"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":"2102.06806","title":"Parameter-free Locally Accelerated Conditional Gradients","created":"2021-02-12","cited_by_count":5,"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":"2101.12101","title":"Potential Function-based Framework for Making the Gradients Small in Convex and Min-Max Optimization","created":"2021-01-28","cited_by_count":4,"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":"2402.05071","title":"Revisiting Inexact Fixed-Point Iterations for Min-Max Problems: Stochasticity and Structured Nonconvexity","created":"2024-02-07","cited_by_count":4,"area":null},{"id":"2304.09221","title":"Convergence of stochastic gradient descent under a local Lojasiewicz condition for deep neural networks","created":"2023-04-18","cited_by_count":3,"area":null},{"id":"2310.17759","title":"Optimal Guarantees for Algorithmic Reproducibility and Gradient Complexity in Convex Optimization","created":"2023-10-26","cited_by_count":3,"area":null},{"id":"2510.03167","title":"Improving Online-to-Nonconvex Conversion for Smooth Optimization via Double Optimism","created":"2025-10-03","cited_by_count":3,"area":null},{"id":"2202.09052","title":"Tackling benign nonconvexity with smoothing and stochastic gradients","created":"2022-02-18","cited_by_count":2,"area":null},{"id":"2305.10294","title":"DualFL: A Duality-based Federated Learning Algorithm with Communication Acceleration in the General Convex Regime","created":"2023-05-17","cited_by_count":2,"area":null},{"id":"2411.05198","title":"Private Algorithms for Stochastic Saddle Points and Variational Inequalities: Beyond Euclidean Geometry","created":"2024-11-07","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":"2609.08380","title":"How to Make the Gradient Mapping Small for Constrained Stochastic Min-Max Problems and Beyond","created":"2026-09-08","cited_by_count":2,"area":null},{"id":"2409.19200","title":"Faster Acceleration for Steepest Descent","created":"2024-09-28","cited_by_count":1,"area":null},{"id":"2503.10138","title":"Are Convex Optimization Curves Convex?","created":"2025-03-13","cited_by_count":1,"area":null},{"id":"2505.22807","title":"Distribution free M-estimation","created":"2025-05-28","cited_by_count":1,"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":"2606.27082","title":"Finding Stationary Points by Comparisons","created":"2026-06-25","cited_by_count":1,"area":null},{"id":"2610.03165","title":"Sample complexity of variance-reduced policy gradient: weaker assumptions and lower bounds","created":"2026-10-02","cited_by_count":1,"area":"deeprl"},{"id":"2108.04482","title":"Complexity of Inexact Proximal Point Algorithm for minimizing convex functions with Holderian Growth","created":"2021-08-10","cited_by_count":0,"area":null},{"id":"2306.17470","title":"Oblivious Stochastic Composite Optimization","created":"2023-06-30","cited_by_count":0,"area":null},{"id":"2307.07605","title":"First-order Methods for Affinely Constrained Composite Non-convex Non-smooth Problems: Lower Complexity Bound and Near-optimal Methods","created":"2023-07-14","cited_by_count":0,"area":null},{"id":"2406.19475","title":"Stochastic First-Order Methods with Non-smooth and Non-Euclidean Proximal Terms for Nonconvex High-Dimensional Stochastic Optimization","created":"2024-06-27","cited_by_count":0,"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":"2510.04926","title":"Set to Be Fair: Demographic Parity Constraints for Set-Valued Classification","created":"2025-10-06","cited_by_count":0,"area":null},{"id":"2605.15859","title":"Complexity of Non-Log-Concave Sampling in Fisher Information","created":"2026-05-15","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.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}