{"total":19,"rows":[{"id":"2111.11309","title":"No-Regret Dynamics in the Fenchel Game: A Unified Framework for Algorithmic Convex Optimization","created":"2021-11-22","cited_by_count":20,"area":null},{"id":"2102.02167","title":"Algorithmic Instabilities of Accelerated Gradient Descent","created":"2021-02-03","cited_by_count":16,"area":null},{"id":"2106.04819","title":"Contextual Recommendations and Low-Regret Cutting-Plane Algorithms","created":"2021-06-09","cited_by_count":15,"area":null},{"id":"2106.07644","title":"A Continuized View on Nesterov Acceleration for Stochastic Gradient Descent and Randomized Gossip","created":"2021-06-10","cited_by_count":15,"area":null},{"id":"2103.01338","title":"Acceleration via Fractal Learning Rate Schedules","created":"2021-03-01","cited_by_count":13,"area":null},{"id":"2206.07553","title":"On the fast convergence of minibatch heavy ball momentum","created":"2022-06-15","cited_by_count":13,"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":"2104.07006","title":"Fast quantum state reconstruction via accelerated non-convex programming","created":"2021-04-14","cited_by_count":5,"area":null},{"id":"2101.12101","title":"Potential Function-based Framework for Making the Gradients Small in Convex and Min-Max Optimization","created":"2021-01-28","cited_by_count":4,"area":null},{"id":"2202.06152","title":"Analysis of Dual-Based PID Controllers through Convolutional Mirror Descent","created":"2022-02-12","cited_by_count":3,"area":null},{"id":"2306.10096","title":"Memory-Constrained Algorithms for Convex Optimization via Recursive Cutting-Planes","created":"2023-06-16","cited_by_count":3,"area":null},{"id":"2204.12663","title":"Understanding A Class of Decentralized and Federated Optimization Algorithms: A Multi-Rate Feedback Control Perspective","created":"2022-04-27","cited_by_count":2,"area":null},{"id":"2409.19200","title":"Faster Acceleration for Steepest Descent","created":"2024-09-28","cited_by_count":1,"area":null},{"id":"2201.08311","title":"Accelerated Gradient Flow: Risk, Stability, and Implicit Regularization","created":"2022-01-20","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":"2304.10063","title":"Understanding Accelerated Gradient Methods: Lyapunov Analyses and Hamiltonian Assisted Interpretations","created":"2023-04-20","cited_by_count":0,"area":null},{"id":"2409.00913","title":"Generalized Continuous-Time Models for Nesterov's Accelerated Gradient Methods","created":"2024-09-02","cited_by_count":0,"area":null},{"id":"2605.18609","title":"Perfect Parallelization in Mini-Batch SGD with Classical Momentum Acceleration","created":"2026-05-18","cited_by_count":0,"area":null},{"id":"2606.17260","title":"Accelerated Convex Optimization via Hamiltonian Dynamics with Deterministic Integration Time","created":"2026-06-15","cited_by_count":0,"area":null}],"next_cursor":null}