{"total":31,"rows":[{"id":"2105.14368","title":"Fit without fear: remarkable mathematical phenomena of deep learning through the prism of interpolation","created":"2021-05-29","cited_by_count":132,"area":null},{"id":"2105.13462","title":"On Linear Stability of SGD and Input-Smoothness of Neural Networks","created":"2021-05-27","cited_by_count":63,"area":null},{"id":"2102.03183","title":"Last iterate convergence of SGD for Least-Squares in the Interpolation regime","created":"2021-02-05","cited_by_count":42,"area":null},{"id":"2105.01650","title":"Stochastic gradient descent with noise of machine learning type. Part I: Discrete time analysis","created":"2021-05-04","cited_by_count":39,"area":null},{"id":"2102.09385","title":"Convergence of stochastic gradient descent schemes for Lojasiewicz-landscapes","created":"2021-02-16","cited_by_count":28,"area":null},{"id":"2306.02601","title":"Aiming towards the minimizers: fast convergence of SGD for overparametrized problems","created":"2023-06-05","cited_by_count":22,"area":null},{"id":"2110.01663","title":"Global Convergence and Stability of Stochastic Gradient Descent","created":"2021-10-04","cited_by_count":17,"area":null},{"id":"2307.11782","title":"Convergence of Adam for Non-convex Objectives: Relaxed Hyperparameters and Non-ergodic Case","created":"2023-07-20","cited_by_count":14,"area":null},{"id":"2402.07818","title":"Differentially Private Zeroth-Order Methods for Scalable Large Language Model Finetuning","created":"2024-02-12","cited_by_count":14,"area":null},{"id":"2502.02870","title":"Uncertainty Quantification with the Empirical Neural Tangent Kernel","created":"2025-02-05","cited_by_count":11,"area":null},{"id":"2106.02720","title":"An Even More Optimal Stochastic Optimization Algorithm: Minibatching and Interpolation Learning","created":"2021-06-04","cited_by_count":10,"area":null},{"id":"2109.14090","title":"Reversible Gromov-Monge Sampler for Simulation-Based Inference","created":"2021-09-28","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":"2310.00692","title":"A Theoretical Analysis of Noise Geometry in Stochastic Gradient Descent","created":"2023-10-01","cited_by_count":9,"area":null},{"id":"2203.03159","title":"Risk Bounds of Multi-Pass SGD for Least Squares in the Interpolation Regime","created":"2022-03-07","cited_by_count":8,"area":null},{"id":"2410.08395","title":"Nesterov acceleration in benignly non-convex landscapes","created":"2024-10-10","cited_by_count":7,"area":null},{"id":"2208.11246","title":"Accelerating SGD for Highly Ill-Conditioned Huge-Scale Online Matrix Completion","created":"2022-08-24","cited_by_count":6,"area":null},{"id":"2210.08363","title":"Data-Efficient Augmentation for Training Neural Networks","created":"2022-10-15","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":"2305.13471","title":"Fast Convergence in Learning Two-Layer Neural Networks with Separable Data","created":"2023-05-22","cited_by_count":3,"area":null},{"id":"2310.17610","title":"A qualitative difference between gradient flows of convex functions in finite- and infinite-dimensional Hilbert spaces","created":"2023-10-26","cited_by_count":3,"area":null},{"id":"2311.17539","title":"Critical Influence of Overparameterization on Sharpness-aware Minimization","created":"2023-11-29","cited_by_count":3,"area":null},{"id":"2402.17890","title":"From Inverse Optimization to Feasibility to ERM","created":"2024-02-27","cited_by_count":3,"area":null},{"id":"2505.17300","title":"Statistical Inference for Online Algorithms","created":"2025-05-22","cited_by_count":2,"area":null},{"id":"2202.12831","title":"Benchmark Assessment for DeepSpeed Optimization Library","created":"2022-02-12","cited_by_count":1,"area":null},{"id":"2304.00459","title":"Fast Convergence of Random Reshuffling under Over-Parameterization and the Polyak-\\L ojasiewicz Condition","created":"2023-04-02","cited_by_count":1,"area":null},{"id":"2305.09978","title":"Stochastic Ratios Tracking Algorithm for Large Scale Machine Learning Problems","created":"2023-05-17","cited_by_count":1,"area":null},{"id":"2112.14872","title":"Local Quadratic Convergence of Stochastic Gradient Descent with Adaptive Step Size","created":"2021-12-30","cited_by_count":0,"area":null},{"id":"2207.10046","title":"Adaptive Step-Size Methods for Compressed SGD","created":"2022-07-20","cited_by_count":0,"area":null},{"id":"2404.02378","title":"Faster Convergence of Stochastic Accelerated Gradient Descent under Interpolation","created":"2024-04-03","cited_by_count":0,"area":null},{"id":"2506.08428","title":"Sharper Convergence Rates for Nonconvex Optimisation via Reduction Mappings","created":"2025-06-10","cited_by_count":0,"area":null}],"next_cursor":null}