{"total":61,"rows":[{"id":"2205.02160","title":"Making SGD Parameter-Free","created":"2022-05-04","cited_by_count":50,"area":null},{"id":"2106.13756","title":"Private Adaptive Gradient Methods for Convex Optimization","created":"2021-06-25","cited_by_count":46,"area":null},{"id":"2202.00089","title":"Understanding AdamW through Proximal Methods and Scale-Freeness","created":"2022-01-31","cited_by_count":46,"area":null},{"id":"2203.00444","title":"Parameter-free Mirror Descent","created":"2022-02-26","cited_by_count":45,"area":null},{"id":"2206.05187","title":"On Convergence of FedProx: Local Dissimilarity Invariant Bounds, Non-smoothness and Beyond","created":"2022-06-10","cited_by_count":38,"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":"2305.07583","title":"MoMo: Momentum Models for Adaptive Learning Rates","created":"2023-05-12","cited_by_count":24,"area":null},{"id":"2308.06058","title":"Adaptive SGD with Polyak stepsize and Line-search: Robust Convergence and Variance Reduction","created":"2023-08-11","cited_by_count":23,"area":null},{"id":"2402.14758","title":"Batch and match: black-box variational inference with a score-based divergence","created":"2024-02-22","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":"2209.02257","title":"Faster federated optimization under second-order similarity","created":"2022-09-06","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":"2504.09951","title":"Towards Weaker Variance Assumptions for Stochastic Optimization","created":"2025-04-14","cited_by_count":17,"area":null},{"id":"2301.04935","title":"A Stochastic Proximal Polyak Step Size","created":"2023-01-12","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":"2301.06632","title":"Asymptotic normality and optimality in nonsmooth stochastic approximation","created":"2023-01-16","cited_by_count":14,"area":null},{"id":"2402.09542","title":"Layerwise Proximal Replay: A Proximal Point Method for Online Continual Learning","created":"2024-02-14","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":"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":"2203.00089","title":"Amortized Proximal Optimization","created":"2022-02-28","cited_by_count":9,"area":null},{"id":"2203.10327","title":"Implicit Parameter-free Online Learning with Truncated Linear Models","created":"2022-03-19","cited_by_count":8,"area":null},{"id":"2111.06171","title":"Convergence and Stability of the Stochastic Proximal Point Algorithm with Momentum","created":"2021-11-11","cited_by_count":7,"area":null},{"id":"2306.09955","title":"Training shallow ReLU networks on noisy data using hinge loss: when do we overfit and is it benign?","created":"2023-06-16","cited_by_count":7,"area":null},{"id":"2308.01481","title":"Online covariance estimation for stochastic gradient descent under Markovian sampling","created":"2023-08-03","cited_by_count":7,"area":null},{"id":"2102.05198","title":"Statistical Inference for Polyak-Ruppert Averaged Zeroth-order Stochastic Gradient Algorithm","created":"2021-02-10","cited_by_count":6,"area":null},{"id":"2304.00707","title":"High-dimensional scaling limits and fluctuations of online least-squares SGD with smooth covariance","created":"2023-04-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":"2604.16620","title":"Lower Bounds and Proximally Anchored SGD for Non-Convex Minimization Under Unbounded Variance","created":"2026-04-17","cited_by_count":5,"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":"2405.15941","title":"A Unified Theory of Stochastic Proximal Point Methods without Smoothness","created":"2024-05-24","cited_by_count":4,"area":null},{"id":"2201.12678","title":"A Stochastic Bundle Method for Interpolating Networks","created":"2022-01-29","cited_by_count":3,"area":null},{"id":"2210.17070","title":"Private optimization in the interpolation regime: faster rates and hardness results","created":"2022-10-31","cited_by_count":3,"area":null},{"id":"2306.00201","title":"Generalized Implicit Follow-The-Regularized-Leader","created":"2023-05-31","cited_by_count":3,"area":null},{"id":"2308.09310","title":"Variance reduction techniques for stochastic proximal point algorithms","created":"2023-08-18","cited_by_count":3,"area":null},{"id":"2401.13971","title":"Stochastic Weakly Convex Optimization Beyond Lipschitz Continuity","created":"2024-01-25","cited_by_count":3,"area":null},{"id":"2410.01410","title":"On the Convergence of FedProx with Extrapolation and Inexact Prox","created":"2024-10-02","cited_by_count":3,"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":"2206.12663","title":"Statistical inference with implicit SGD: proximal Robbins-Monro vs. Polyak-Ruppert","created":"2022-06-25","cited_by_count":2,"area":null},{"id":"2305.14161","title":"Revisiting Subgradient Method: Complexity and Convergence Beyond Lipschitz Continuity","created":"2023-05-23","cited_by_count":2,"area":null},{"id":"2406.01115","title":"Cohort Squeeze: Beyond a Single Communication Round per Cohort in Cross-Device Federated Learning","created":"2024-06-03","cited_by_count":2,"area":null},{"id":"2502.00882","title":"Worth Their Weight: Randomized and Regularized Block Kaczmarz Algorithms without Preprocessing","created":"2025-02-02","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":"2210.12277","title":"The Stochastic Proximal Distance Algorithm","created":"2022-10-21","cited_by_count":1,"area":null},{"id":"2302.09727","title":"Statistical Inference for Linear Functionals of Online SGD in High-dimensional Linear Regression","created":"2023-02-20","cited_by_count":1,"area":null},{"id":"2308.02123","title":"Eva: A General Vectorized Approximation Framework for Second-order Optimization","created":"2023-08-04","cited_by_count":1,"area":null},{"id":"2510.04988","title":"Adaptive Memory Momentum via a Model-Based Framework for Deep Learning Optimization","created":"2025-10-06","cited_by_count":1,"area":null},{"id":"2510.19734","title":"Statistical Inference for Linear Functionals of Online Least-squares SGD when $t \\gtrsim d^{1+\\delta}$","created":"2025-10-22","cited_by_count":1,"area":null},{"id":"2111.07866","title":"Mitigating Divergence of Latent Factors via Dual Ascent for Low Latency Event Prediction Models","created":"2021-11-15","cited_by_count":0,"area":null},{"id":"2204.01705","title":"Learning to Accelerate by the Methods of Step-size Planning","created":"2022-04-01","cited_by_count":0,"area":null},{"id":"2205.09571","title":"Augmented Lagrangian Methods for Time-varying Constrained Online Convex Optimization","created":"2022-05-19","cited_by_count":0,"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":"2307.11955","title":"Implicit Interpretation of Importance Weight Aware Updates","created":"2023-07-22","cited_by_count":0,"area":null},{"id":"2402.12828","title":"Tracking the Median of Gradients with a Stochastic Proximal Point Method","created":"2024-02-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":"2509.14969","title":"Stochastic Adaptive Gradient Descent Without Descent","created":"2025-09-18","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.10697","title":"Mean-square and sublinear convergence of a stochastic proximal point algorithm in metric spaces of nonpositive curvature","created":"2025-10-12","cited_by_count":0,"area":null},{"id":"2602.05489","title":"Convergence Rate of the Last Iterate of Stochastic Proximal Algorithms","created":"2026-02-05","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}],"next_cursor":null}