{"total":22,"rows":[{"id":"2305.15155","title":"Momentum Provably Improves Error Feedback!","created":"2023-05-24","cited_by_count":31,"area":null},{"id":"2202.13361","title":"Benign Underfitting of Stochastic Gradient Descent","created":"2022-02-27","cited_by_count":19,"area":null},{"id":"2212.13556","title":"Limitations of Information-Theoretic Generalization Bounds for Gradient Descent Methods in Stochastic Convex Optimization","created":"2022-12-27","cited_by_count":19,"area":null},{"id":"2212.02083","title":"On the Overlooked Structure of Stochastic Gradients","created":"2022-12-05","cited_by_count":13,"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":"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":"2206.00501","title":"Benign Overfitting in Classification: Provably Counter Label Noise with Larger Models","created":"2022-06-01","cited_by_count":5,"area":null},{"id":"2210.06705","title":"From Gradient Flow on Population Loss to Learning with Stochastic Gradient Descent","created":"2022-10-13","cited_by_count":5,"area":null},{"id":"2305.09145","title":"Deep ReLU Networks Have Surprisingly Simple Polytopes","created":"2023-05-16","cited_by_count":5,"area":null},{"id":"2405.20114","title":"Towards Faster Decentralized Stochastic Optimization with Communication Compression","created":"2024-05-30","cited_by_count":5,"area":null},{"id":"2403.08585","title":"Improving Implicit Regularization of SGD with Preconditioning for Least Square Problems","created":"2024-03-13","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":"2209.03705","title":"Losing momentum in continuous-time stochastic optimisation","created":"2022-09-08","cited_by_count":2,"area":null},{"id":"2510.17503","title":"Stochastic Difference-of-Convex Optimization with Momentum","created":"2025-10-20","cited_by_count":2,"area":null},{"id":"2411.17567","title":"Improving the Convergence Rates of Forward Gradient Descent with Repeated Sampling","created":"2024-11-26","cited_by_count":1,"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.20314","title":"Less Data, Faster Training: repeating smaller datasets speeds up learning via sampling biases","created":"2026-05-19","cited_by_count":0,"area":null}],"next_cursor":null}