{"total":35,"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":"2203.04850","title":"Federated Minimax Optimization: Improved Convergence Analyses and Algorithms","created":"2022-03-09","cited_by_count":37,"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":"2106.11851","title":"Stochastic Polyak Stepsize with a Moving Target","created":"2021-06-22","cited_by_count":19,"area":null},{"id":"2110.11442","title":"Towards Noise-adaptive, Problem-adaptive (Accelerated) Stochastic Gradient Descent","created":"2021-10-21","cited_by_count":16,"area":null},{"id":"2207.08171","title":"SP2: A Second Order Stochastic Polyak Method","created":"2022-07-17","cited_by_count":13,"area":null},{"id":"2209.14827","title":"On the Convergence of AdaGrad(Norm) on $\\R^{d}$: Beyond Convexity, Non-Asymptotic Rate and Acceleration","created":"2022-09-29","cited_by_count":13,"area":null},{"id":"2506.23803","title":"SGD with Adaptive Preconditioning: Unified Analysis and Momentum Acceleration","created":"2025-06-30","cited_by_count":12,"area":null},{"id":"2205.15142","title":"Special Properties of Gradient Descent with Large Learning Rates","created":"2022-05-30","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":"2410.08395","title":"Nesterov acceleration in benignly non-convex landscapes","created":"2024-10-10","cited_by_count":7,"area":null},{"id":"2302.07851","title":"Continuized Acceleration for Quasar Convex Functions in Non-Convex Optimization","created":"2023-02-15","cited_by_count":6,"area":null},{"id":"2303.10472","title":"Practical and Matching Gradient Variance Bounds for Black-Box Variational Bayesian Inference","created":"2023-03-18","cited_by_count":6,"area":null},{"id":"2310.05309","title":"Optimizing Solution-Samplers for Combinatorial Problems: The Landscape of Policy-Gradient Methods","created":"2023-10-08","cited_by_count":5,"area":null},{"id":"2502.02002","title":"The Ball-Proximal (=\"Broximal\") Point Method: a New Algorithm, Convergence Theory, and Applications","created":"2025-02-04","cited_by_count":5,"area":null},{"id":"2502.18605","title":"Expected Variational Inequalities","created":"2025-02-25","cited_by_count":5,"area":null},{"id":"2211.14645","title":"Accelerated Riemannian Optimization: Handling Constraints with a Prox to Bound Geometric Penalties","created":"2022-11-26","cited_by_count":4,"area":null},{"id":"2303.11526","title":"PRISE: Demystifying Deep Lucas-Kanade with Strongly Star-Convex Constraints for Multimodel Image Alignment","created":"2023-03-21","cited_by_count":4,"area":null},{"id":"2306.05100","title":"Communication-Efficient Gradient Descent-Accent Methods for Distributed Variational Inequalities: Unified Analysis and Local Updates","created":"2023-06-08","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":"2204.10536","title":"Sharper Utility Bounds for Differentially Private Models","created":"2022-04-22","cited_by_count":3,"area":null},{"id":"2411.10649","title":"Deep Loss Convexification for Learning Iterative Models","created":"2024-11-16","cited_by_count":3,"area":null},{"id":"2505.02281","title":"Minimisation of Quasar-Convex Functions Using Random Zeroth-Order Oracles","created":"2025-05-04","cited_by_count":3,"area":null},{"id":"2511.22331","title":"On the Condition Number Dependency in Bilevel Optimization","created":"2025-11-27","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":"2206.05869","title":"On the Convergence to a Global Solution of Shuffling-Type Gradient Algorithms","created":"2022-06-13","cited_by_count":2,"area":null},{"id":"2312.16360","title":"Mean-field underdamped Langevin dynamics and its spacetime discretization","created":"2023-12-26","cited_by_count":2,"area":null},{"id":"2510.01943","title":"Smooth Quasar-Convex Optimization with Constraints","created":"2025-10-02","cited_by_count":2,"area":null},{"id":"2210.02604","title":"Spectral Regularization Allows Data-frugal Learning over Combinatorial Spaces","created":"2022-10-05","cited_by_count":1,"area":null},{"id":"2307.04456","title":"Invex Programs: First Order Algorithms and Their Convergence","created":"2023-07-10","cited_by_count":1,"area":null},{"id":"2605.25395","title":"EMA-Nesterov: Stabilizing Nesterov's Lookahead for Accelerated Deep Learning Optimization","created":"2026-05-25","cited_by_count":1,"area":null},{"id":"2203.10973","title":"A Local Convergence Theory for the Stochastic Gradient Descent Method in Non-Convex Optimization With Non-isolated Local Minima","created":"2022-03-21","cited_by_count":0,"area":null},{"id":"2407.03601","title":"Online Non-Stationary Stochastic Quasar-Convex Optimization","created":"2024-07-04","cited_by_count":0,"area":null},{"id":"2504.00836","title":"Spingarn's Method and Progressive Decoupling Beyond Elicitable Monotonicity","created":"2025-04-01","cited_by_count":0,"area":null},{"id":"2605.15522","title":"Stochastic Non-Smooth Convex Optimization with Unbounded Gradients","created":"2026-05-15","cited_by_count":0,"area":null}],"next_cursor":null}