{"total":13,"rows":[{"id":"2206.07553","title":"On the fast convergence of minibatch heavy ball momentum","created":"2022-06-15","cited_by_count":13,"area":null},{"id":"2410.03883","title":"DiSK: Differentially Private Optimizer with Simplified Kalman Filter for Noise Reduction","created":"2024-10-04","cited_by_count":11,"area":null},{"id":"2201.11204","title":"On the Convergence of mSGD and AdaGrad for Stochastic Optimization","created":"2022-01-26","cited_by_count":7,"area":null},{"id":"2102.11755","title":"Analytical Study of Momentum-Based Acceleration Methods in Paradigmatic High-Dimensional Non-Convex Problems","created":"2021-02-23","cited_by_count":5,"area":null},{"id":"2207.12395","title":"Tuning Stochastic Gradient Algorithms for Statistical Inference via Large-Sample Asymptotics","created":"2022-07-25","cited_by_count":4,"area":null},{"id":"2202.06922","title":"Convex Programs and Lyapunov Functions for Reinforcement Learning: A Unified Perspective on the Analysis of Value-Based Methods","created":"2022-02-14","cited_by_count":3,"area":null},{"id":"2103.08017","title":"Transient growth of accelerated optimization algorithms","created":"2021-03-14","cited_by_count":2,"area":null},{"id":"2501.08883","title":"Increasing Batch Size Improves Convergence of Stochastic Gradient Descent with Momentum","created":"2025-01-15","cited_by_count":2,"area":null},{"id":"2209.11920","title":"Tradeoffs between convergence rate and noise amplification for momentum-based accelerated optimization algorithms","created":"2022-09-24","cited_by_count":1,"area":null},{"id":"2509.13628","title":"Accelerated Gradient Methods with Biased Gradient Estimates: Risk Sensitivity, High-Probability Guarantees, and Large Deviation Bounds","created":"2025-09-17","cited_by_count":1,"area":null},{"id":"2109.15292","title":"Accelerating Perturbed Stochastic Iterates in Asynchronous Lock-Free Optimization","created":"2021-09-30","cited_by_count":0,"area":null},{"id":"2403.11163","title":"A Selective Review on Statistical Methods for Massive Data Computation: Distributed Computing, Subsampling, and Minibatch Techniques","created":"2024-03-17","cited_by_count":0,"area":null},{"id":"2602.03329","title":"From Inexact Gradients to Byzantine Robustness: Acceleration and Optimization under Similarity","created":"2026-02-03","cited_by_count":0,"area":null}],"next_cursor":null}