{"total":63,"rows":[{"id":"2107.00052","title":"Stochastic Gradient Descent-Ascent and Consensus Optimization for Smooth Games: Convergence Analysis under Expected Co-coercivity","created":"2021-06-30","cited_by_count":43,"area":null},{"id":"2202.07262","title":"Stochastic Gradient Descent-Ascent: Unified Theory and New Efficient Methods","created":"2022-02-15","cited_by_count":37,"area":null},{"id":"2111.08611","title":"Stochastic Extragradient: General Analysis and Improved Rates","created":"2021-11-16","cited_by_count":31,"area":null},{"id":"2302.03109","title":"On the Convergence of Federated Averaging with Cyclic Client Participation","created":"2023-02-06","cited_by_count":31,"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":"2305.07583","title":"MoMo: Momentum Models for Adaptive Learning Rates","created":"2023-05-12","cited_by_count":24,"area":null},{"id":"2110.15412","title":"Stochastic Mirror Descent: Convergence Analysis and Adaptive Variants via the Mirror Stochastic Polyak Stepsize","created":"2021-10-28","cited_by_count":22,"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":"2107.00464","title":"On the Convergence of Stochastic Extragradient for Bilinear Games using Restarted Iteration Averaging","created":"2021-06-30","cited_by_count":18,"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":"2110.01663","title":"Global Convergence and Stability of Stochastic Gradient Descent","created":"2021-10-04","cited_by_count":17,"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":"2102.09700","title":"AI-SARAH: Adaptive and Implicit Stochastic Recursive Gradient Methods","created":"2021-02-19","cited_by_count":15,"area":null},{"id":"2301.04935","title":"A Stochastic Proximal Polyak Step Size","created":"2023-01-12","cited_by_count":15,"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":"2111.06328","title":"Stationary Behavior of Constant Stepsize SGD Type Algorithms: An Asymptotic Characterization","created":"2021-11-11","cited_by_count":13,"area":null},{"id":"2207.08171","title":"SP2: A Second Order Stochastic Polyak Method","created":"2022-07-17","cited_by_count":13,"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":"2206.03907","title":"A Unified Convergence Theorem for Stochastic Optimization Methods","created":"2022-06-08","cited_by_count":12,"area":null},{"id":"2307.01497","title":"Accelerated stochastic approximation with state-dependent noise","created":"2023-07-04","cited_by_count":11,"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":"2503.02225","title":"Sharpness-Aware Minimization: General Analysis and Improved Rates","created":"2025-03-04","cited_by_count":10,"area":null},{"id":"2107.11774","title":"SGD with a Constant Large Learning Rate Can Converge to Local Maxima","created":"2021-07-25","cited_by_count":8,"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":"2410.12455","title":"Loss Landscape Characterization of Neural Networks without Over-Parametrization","created":"2024-10-16","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":"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.01139","title":"Minibatch and Local SGD: Algorithmic Stability and Linear Speedup in Generalization","created":"2023-10-02","cited_by_count":5,"area":null},{"id":"2403.07148","title":"Stochastic Extragradient with Random Reshuffling: Improved Convergence for Variational Inequalities","created":"2024-03-11","cited_by_count":5,"area":null},{"id":"2501.08263","title":"Multiplayer Federated Learning: Reaching Equilibrium with Less Communication","created":"2025-01-14","cited_by_count":5,"area":null},{"id":"2502.18605","title":"Expected Variational Inequalities","created":"2025-02-25","cited_by_count":5,"area":null},{"id":"2504.01898","title":"Analysis of an Idealized Stochastic Polyak Method and its Application to Black-Box Model Distillation","created":"2025-04-02","cited_by_count":5,"area":null},{"id":"2206.13290","title":"Theoretical analysis of Adam using hyperparameters close to one without Lipschitz smoothness","created":"2022-06-27","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":"2312.01047","title":"A New Random Reshuffling Method for Nonsmooth Nonconvex Finite-sum Optimization","created":"2023-12-02","cited_by_count":4,"area":null},{"id":"2303.12981","title":"Connected Superlevel Set in (Deep) Reinforcement Learning and its Application to Minimax Theorems","created":"2023-03-23","cited_by_count":3,"area":null},{"id":"2304.09221","title":"Convergence of stochastic gradient descent under a local Lojasiewicz condition for deep neural networks","created":"2023-04-18","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":"2411.10649","title":"Deep Loss Convexification for Learning Iterative Models","created":"2024-11-16","cited_by_count":3,"area":null},{"id":"2505.11434","title":"Controlling the Flow: Stability and Convergence for Stochastic Gradient Descent with Decaying Regularization","created":"2025-05-16","cited_by_count":3,"area":null},{"id":"2202.03524","title":"Finite-Sum Optimization: A New Perspective for Convergence to a Global Solution","created":"2022-02-07","cited_by_count":2,"area":null},{"id":"2205.12549","title":"Learning from time-dependent streaming data with online stochastic algorithms","created":"2022-05-25","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":"2310.12969","title":"Demystifying the Myths and Legends of Nonconvex Convergence of SGD","created":"2023-10-19","cited_by_count":2,"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":"2510.01943","title":"Smooth Quasar-Convex Optimization with Constraints","created":"2025-10-02","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":"2108.11713","title":"The Number of Steps Needed for Nonconvex Optimization of a Deep Learning Optimizer is a Rational Function of Batch Size","created":"2021-08-26","cited_by_count":1,"area":null},{"id":"2406.05637","title":"A Generalized Version of Chung's Lemma and its Applications","created":"2024-06-09","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":"2607.08104","title":"Vanilla SGD with Momentum Survives Heavy-Tailed Noise: Convergence Analysis without Gradient Clipping or Normalization","created":"2026-07-09","cited_by_count":1,"area":null},{"id":"2212.01848","title":"Convergence of ease-controlled Random Reshuffling gradient Algorithms under Lipschitz smoothness","created":"2022-12-04","cited_by_count":0,"area":null},{"id":"2305.13664","title":"Layer-wise Adaptive Step-Sizes for Stochastic First-Order Methods for Deep Learning","created":"2023-05-23","cited_by_count":0,"area":null},{"id":"2409.06542","title":"Dynamic Decoupling of Placid Terminal Attractor-based Gradient Descent Algorithm","created":"2024-09-10","cited_by_count":0,"area":null},{"id":"2503.19942","title":"A stochastic gradient descent algorithm with random search directions","created":"2025-03-25","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":"2511.20207","title":"Adaptive SGD with Line-Search and Polyak Stepsizes: Nonconvex Convergence and Accelerated Rates","created":"2025-11-25","cited_by_count":0,"area":null},{"id":"2605.14151","title":"Stochastic global optimization of continuous functions via random walks on Grassmannians","created":"2026-05-13","cited_by_count":0,"area":null},{"id":"2608.03001","title":"Stochastic Saddle Avoidance Beyond Unit Excitation and Smoothness: A Pathwise Lyapunov-Perron Framework","created":"2026-08-04","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}