{"total":22,"rows":[{"id":"2202.11632","title":"Mirror Descent Strikes Again: Optimal Stochastic Convex Optimization under Infinite Noise Variance","created":"2022-02-23","cited_by_count":24,"area":null},{"id":"2205.12365","title":"Low-rank Optimal Transport: Approximation, Statistics and Debiasing","created":"2022-05-24","cited_by_count":21,"area":null},{"id":"2302.14043","title":"Single-Call Stochastic Extragradient Methods for Structured Non-monotone Variational Inequalities: Improved Analysis under Weaker Conditions","created":"2023-02-27","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":"2403.02648","title":"Remove that Square Root: A New Efficient Scale-Invariant Version of AdaGrad","created":"2024-03-05","cited_by_count":8,"area":null},{"id":"2307.06306","title":"Locally Adaptive Federated Learning","created":"2023-07-12","cited_by_count":7,"area":null},{"id":"2505.20219","title":"New Perspectives on the Polyak Stepsize: Surrogate Functions and Negative Results","created":"2025-05-26","cited_by_count":6,"area":null},{"id":"2312.17369","title":"SANIA: Polyak-type Optimization Framework Leads to Scale Invariant Stochastic Algorithms","created":"2023-12-28","cited_by_count":5,"area":null},{"id":"2406.00655","title":"Generalized Exponentiated Gradient Algorithms and Their Application to On-Line Portfolio Selection","created":"2024-06-02","cited_by_count":5,"area":null},{"id":"2505.04757","title":"Primal-dual algorithm for contextual stochastic combinatorial optimization","created":"2025-05-07","cited_by_count":4,"area":null},{"id":"2305.15249","title":"Decision-Aware Actor-Critic with Function Approximation and Theoretical Guarantees","created":"2023-05-24","cited_by_count":3,"area":null},{"id":"2505.17965","title":"Bias-Optimal Bounds for SGD: A Computer-Aided Lyapunov Analysis","created":"2025-05-23","cited_by_count":2,"area":null},{"id":"2511.07767","title":"Taking the Road Less Scheduled with Adaptive Polyak Steps","created":"2025-11-11","cited_by_count":2,"area":null},{"id":"2512.02342","title":"Safeguarded Stochastic Polyak Step Sizes for Non-smooth Optimization: Robust Performance Without Small (Sub)Gradients","created":"2025-12-02","cited_by_count":2,"area":null},{"id":"2311.02557","title":"Fast Minimization of Expected Logarithmic Loss via Stochastic Dual Averaging","created":"2023-11-05","cited_by_count":1,"area":null},{"id":"2602.18997","title":"Implicit Bias and Convergence of Matrix Stochastic Mirror Descent","created":"2026-02-22","cited_by_count":1,"area":null},{"id":"2603.16042","title":"Shuffling the Stochastic Mirror Descent via Dual Lipschitz Continuity and Kernel Conditioning","created":"2026-03-17","cited_by_count":1,"area":null},{"id":"2606.01827","title":"Adaptive Sharpness-Aware Minimization with a Polyak-type Step size: A Theory-Grounded Scheduler","created":"2026-06-01","cited_by_count":1,"area":null},{"id":"2111.06826","title":"Convergence Rates for the MAP of an Exponential Family and Stochastic Mirror Descent -- an Open Problem","created":"2021-11-12","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":"2606.11431","title":"Mirror Descent Beyond Euclidean Stability: An Exponential Separation in Initialization Sensitivity","created":"2026-06-09","cited_by_count":0,"area":null},{"id":"2609.26581","title":"Polyak-Type Extragradient Methods for Monotone Root-Finding Problems","created":"2026-09-22","cited_by_count":0,"area":null}],"next_cursor":null}