{"total":36,"rows":[{"id":"2103.01516","title":"Private Stochastic Convex Optimization: Optimal Rates in $\\ell_1$ Geometry","created":"2021-03-02","cited_by_count":83,"area":null},{"id":"2203.00263","title":"Private Convex Optimization via Exponential Mechanism","created":"2022-03-01","cited_by_count":49,"area":null},{"id":"2103.12024","title":"Stability and Deviation Optimal Risk Bounds with Convergence Rate $O(1/n)$","created":"2021-03-22","cited_by_count":42,"area":null},{"id":"2102.01117","title":"SGD Generalizes Better Than GD (And Regularization Doesn't Help)","created":"2021-02-01","cited_by_count":38,"area":null},{"id":"2107.05074","title":"SGD: The Role of Implicit Regularization, Batch-size and Multiple-epochs","created":"2021-07-11","cited_by_count":22,"area":null},{"id":"2103.15352","title":"Private Non-smooth Empirical Risk Minimization and Stochastic Convex Optimization in Subquadratic Steps","created":"2021-03-29","cited_by_count":21,"area":null},{"id":"2202.13361","title":"Benign Underfitting of Stochastic Gradient Descent","created":"2022-02-27","cited_by_count":19,"area":null},{"id":"2204.12446","title":"Beyond Lipschitz: Sharp Generalization and Excess Risk Bounds for Full-Batch GD","created":"2022-04-26","cited_by_count":19,"area":null},{"id":"2302.04925","title":"Information Theoretic Lower Bounds for Information Theoretic Upper Bounds","created":"2023-02-09","cited_by_count":17,"area":null},{"id":"2102.02167","title":"Algorithmic Instabilities of Accelerated Gradient Descent","created":"2021-02-03","cited_by_count":16,"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":"2402.09327","title":"Information Complexity of Stochastic Convex Optimization: Applications to Generalization and Memorization","created":"2024-02-14","cited_by_count":14,"area":null},{"id":"2209.08951","title":"Generalization Bounds for Stochastic Gradient Descent via Localized $\\varepsilon$-Covers","created":"2022-09-19","cited_by_count":11,"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":"2511.12659","title":"Sample Complexity of Agnostic Multiclass Classification: Natarajan Dimension Strikes Back","created":"2025-11-16","cited_by_count":9,"area":null},{"id":"2207.08257","title":"Uniform Stability for First-Order Empirical Risk Minimization","created":"2022-07-17","cited_by_count":8,"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":"2202.13328","title":"Thinking Outside the Ball: Optimal Learning with Gradient Descent for Generalized Linear Stochastic Convex Optimization","created":"2022-02-27","cited_by_count":7,"area":null},{"id":"2303.10758","title":"Lower Generalization Bounds for GD and SGD in Smooth Stochastic Convex Optimization","created":"2023-03-19","cited_by_count":6,"area":null},{"id":"2401.12058","title":"The Dimension Strikes Back with Gradients: Generalization of Gradient Methods in Stochastic Convex Optimization","created":"2024-01-22","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":"2305.02247","title":"Select without Fear: Almost All Mini-Batch Schedules Generalize Optimally","created":"2023-05-03","cited_by_count":5,"area":null},{"id":"2305.16475","title":"Initialization-Dependent Sample Complexity of Linear Predictors and Neural Networks","created":"2023-05-25","cited_by_count":4,"area":null},{"id":"2511.03548","title":"Flat Minima and Generalization: Insights from Stochastic Convex Optimization","created":"2025-11-05","cited_by_count":4,"area":null},{"id":"2310.10006","title":"Soft ascent-descent as a stable and flexible alternative to flooding","created":"2023-10-16","cited_by_count":3,"area":null},{"id":"2505.08306","title":"Rapid Overfitting of Multi-Pass Stochastic Gradient Descent in Stochastic Convex Optimization","created":"2025-05-13","cited_by_count":3,"area":null},{"id":"2410.02176","title":"Towards Better Generalization: Weight Decay Induces Low-rank Bias for Neural Networks","created":"2024-10-03","cited_by_count":2,"area":null},{"id":"2202.06880","title":"Black-Box Generalization: Stability of Zeroth-Order Learning","created":"2022-02-14","cited_by_count":1,"area":null},{"id":"2501.03222","title":"Characterizing the Accuracy-Communication-Privacy Trade-off in Distributed Stochastic Convex Optimization","created":"2025-01-06","cited_by_count":1,"area":null},{"id":"2506.00252","title":"How hard is learning to cut? Trade-offs and sample complexity","created":"2025-05-30","cited_by_count":1,"area":null},{"id":"2111.05232","title":"Learning Rates for Nonconvex Pairwise Learning","created":"2021-11-09","cited_by_count":0,"area":null},{"id":"2412.11003","title":"Optimal Rates for Robust Stochastic Convex Optimization","created":"2024-12-15","cited_by_count":0,"area":null},{"id":"2602.08350","title":"All ERMs Can Fail in Stochastic Convex Optimization Lower Bounds in Linear Dimension","created":"2026-02-09","cited_by_count":0,"area":null},{"id":"2602.22936","title":"Generalization Bounds of Stochastic Gradient Descent in Homogeneous Neural Networks","created":"2026-02-26","cited_by_count":0,"area":null},{"id":"2605.07239","title":"Sample Complexity of Stochastic Optimization with Integer Variables","created":"2026-05-08","cited_by_count":0,"area":null},{"id":"2606.06934","title":"Uniform Stability and Generalization Error of GD and SGD on Fixed-Point Parameters","created":"2026-06-05","cited_by_count":0,"area":null}],"next_cursor":null}