{"total":32,"rows":[{"id":"2302.12022","title":"DoG is SGD's Best Friend: A Parameter-Free Dynamic Step Size Schedule","created":"2023-02-08","cited_by_count":85,"area":null},{"id":"2207.13887","title":"Adaptive Second Order Coresets for Data-efficient Machine Learning","created":"2022-07-28","cited_by_count":60,"area":null},{"id":"2306.01244","title":"Towards Sustainable Learning: Coresets for Data-efficient Deep Learning","created":"2023-06-02","cited_by_count":44,"area":null},{"id":"2102.06489","title":"Stability and Convergence of Stochastic Gradient Clipping: Beyond Lipschitz Continuity and Smoothness","created":"2021-02-12","cited_by_count":37,"area":null},{"id":"2510.09827","title":"An Exploration of Non-Euclidean Gradient Descent: Muon and its Many Variants","created":"2025-10-10","cited_by_count":28,"area":null},{"id":"2202.12328","title":"Cutting Some Slack for SGD with Adaptive Polyak Stepsizes","created":"2022-02-24","cited_by_count":18,"area":null},{"id":"2306.12747","title":"Don't be so Monotone: Relaxing Stochastic Line Search in Over-Parameterized Models","created":"2023-06-22","cited_by_count":15,"area":null},{"id":"2101.02696","title":"Accelerated, Optimal, and Parallel: Some Results on Model-Based Stochastic Optimization","created":"2021-01-07","cited_by_count":14,"area":null},{"id":"2105.07291","title":"Adaptive Newton Sketch: Linear-time Optimization with Quadratic Convergence and Effective Hessian Dimensionality","created":"2021-05-15","cited_by_count":14,"area":null},{"id":"2406.04142","title":"Stochastic Polyak Step-sizes and Momentum: Convergence Guarantees and Practical Performance","created":"2024-06-06","cited_by_count":13,"area":null},{"id":"2106.03034","title":"Minibatch and Momentum Model-based Methods for Stochastic Weakly Convex Optimization","created":"2021-06-06","cited_by_count":10,"area":null},{"id":"2307.14528","title":"Function Value Learning: Adaptive Learning Rates Based on the Polyak Stepsize and Function Splitting in ERM","created":"2023-07-26","cited_by_count":8,"area":null},{"id":"2303.02095","title":"Data-Efficient Training of CNNs and Transformers with Coresets: A Stability Perspective","created":"2023-03-03","cited_by_count":6,"area":null},{"id":"2204.00406","title":"A Semismooth Newton Stochastic Proximal Point Algorithm with Variance Reduction","created":"2022-04-01","cited_by_count":5,"area":null},{"id":"2305.17498","title":"A Model-Based Method for Minimizing CVaR and Beyond","created":"2023-05-27","cited_by_count":5,"area":null},{"id":"2402.02342","title":"MetaOptimize: A Framework for Optimizing Step Sizes and Other Meta-parameters","created":"2024-02-04","cited_by_count":5,"area":null},{"id":"2103.09027","title":"Repurposing Pretrained Models for Robust Out-of-domain Few-Shot Learning","created":"2021-03-16","cited_by_count":4,"area":null},{"id":"2301.03125","title":"Sharper Analysis for Minibatch Stochastic Proximal Point Methods: Stability, Smoothness, and Deviation","created":"2023-01-09","cited_by_count":4,"area":null},{"id":"2402.01599","title":"Hyperparameter tuning via trajectory predictions: Stochastic prox-linear methods in matrix sensing","created":"2024-02-02","cited_by_count":4,"area":null},{"id":"2205.01457","title":"Efficient algorithms for implementing incremental proximal-point methods","created":"2022-05-03","cited_by_count":2,"area":null},{"id":"2308.16362","title":"A Unified Analysis on the Subgradient Upper Bounds for the Subgradient Methods Minimizing Composite Nonconvex, Nonsmooth and Non-Lipschitz Functions","created":"2023-08-30","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":"2111.14761","title":"Adaptive First- and Second-Order Algorithms for Large-Scale Machine Learning","created":"2021-11-29","cited_by_count":1,"area":null},{"id":"2505.15303","title":"Laplace Sample Information: Data Informativeness Through a Bayesian Lens","created":"2025-05-21","cited_by_count":1,"area":null},{"id":"2102.10880","title":"A Probabilistically Motivated Learning Rate Adaptation for Stochastic Optimization","created":"2021-02-22","cited_by_count":0,"area":null},{"id":"2111.07058","title":"Bolstering Stochastic Gradient Descent with Model Building","created":"2021-11-13","cited_by_count":0,"area":null},{"id":"2112.05837","title":"Learning distributed channel access policies for networked estimation: data-driven optimization in the mean-field regime","created":"2021-12-10","cited_by_count":0,"area":null},{"id":"2306.15848","title":"Ordering for Non-Replacement SGD","created":"2023-06-28","cited_by_count":0,"area":null},{"id":"2510.02735","title":"Quantitative Convergence Analysis of Projected Stochastic Gradient Descent for Non-Convex Losses via the Goldstein Subdifferential","created":"2025-10-03","cited_by_count":0,"area":null},{"id":"2510.15164","title":"Hyperparameter Optimization and Reproducibility in Deep Learning Model Training","created":"2025-10-16","cited_by_count":0,"area":null},{"id":"2602.09842","title":"Step-Size Stability in Stochastic Optimization: A Theoretical Perspective","created":"2026-02-10","cited_by_count":0,"area":null},{"id":"2606.29593","title":"How AI settled the complexity of the oldest SGD algorithm","created":"2026-06-28","cited_by_count":0,"area":null}],"next_cursor":null}