{"total":36,"rows":[{"id":"2110.04261","title":"Extragradient Method: $O(1/K)$ Last-Iterate Convergence for Monotone Variational Inequalities and Connections With Cocoercivity","created":"2021-10-08","cited_by_count":39,"area":null},{"id":"2501.18965","title":"The Surprising Agreement Between Convex Optimization Theory and Learning-Rate Scheduling for Large Model Training","created":"2025-01-31","cited_by_count":33,"area":null},{"id":"2309.07835","title":"Learning to Warm-Start Fixed-Point Optimization Algorithms","created":"2023-09-14","cited_by_count":32,"area":null},{"id":"2307.06324","title":"Provably Faster Gradient Descent via Long Steps","created":"2023-07-12","cited_by_count":20,"area":null},{"id":"2201.04040","title":"PEPit: computer-assisted worst-case analyses of first-order optimization methods in Python","created":"2022-01-11","cited_by_count":11,"area":null},{"id":"2505.01423","title":"Negative Stepsizes Make Gradient-Descent-Ascent Converge","created":"2025-05-02","cited_by_count":11,"area":null},{"id":"2411.17668","title":"Anytime Acceleration of Gradient Descent","created":"2024-11-26","cited_by_count":7,"area":null},{"id":"2404.04931","title":"The Sample Complexity of Gradient Descent in Stochastic Convex Optimization","created":"2024-04-07","cited_by_count":6,"area":null},{"id":"2404.13831","title":"Data-Driven Performance Guarantees for Classical and Learned Optimizers","created":"2024-04-22","cited_by_count":5,"area":null},{"id":"2105.12062","title":"Practical Schemes for Finding Near-Stationary Points of Convex Finite-Sums","created":"2021-05-25","cited_by_count":4,"area":null},{"id":"2301.07902","title":"A Nonstochastic Control Approach to Optimization","created":"2023-01-19","cited_by_count":4,"area":null},{"id":"2608.10418","title":"A lower bound for stepsize-based acceleration of gradient descent","created":"2026-08-11","cited_by_count":4,"area":null},{"id":"2105.14385","title":"On Centralized and Distributed Mirror Descent: Convergence Analysis Using Quadratic Constraints","created":"2021-05-29","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":"2509.06466","title":"Several Performance Bounds on Decentralized Online Optimization are Highly Conservative and Potentially Misleading","created":"2025-09-08","cited_by_count":2,"area":null},{"id":"2609.02855","title":"Improved Gradient Descent Lower Bounds Beyond Nesterov","created":"2026-09-02","cited_by_count":2,"area":null},{"id":"2105.13271","title":"OpReg-Boost: Learning to Accelerate Online Algorithms with Operator Regression","created":"2021-05-27","cited_by_count":1,"area":null},{"id":"2309.14155","title":"Extragradient Type Methods for Riemannian Variational Inequality Problems","created":"2023-09-25","cited_by_count":1,"area":null},{"id":"2506.05271","title":"Tight analyses of first-order methods with error feedback","created":"2025-06-05","cited_by_count":1,"area":null},{"id":"2508.06743","title":"Analysis of Schedule-Free Nonconvex Optimization","created":"2025-08-08","cited_by_count":1,"area":null},{"id":"2609.09152","title":"Silver Rate Is (Almost) Optimal for Gradient Descent","created":"2026-09-08","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":"2409.00913","title":"Generalized Continuous-Time Models for Nesterov's Accelerated Gradient Methods","created":"2024-09-02","cited_by_count":0,"area":null},{"id":"2504.08484","title":"Interpolation Conditions for Data Consistency and Prediction in Noisy Linear Systems","created":"2025-04-11","cited_by_count":0,"area":null},{"id":"2506.09730","title":"Empirical and computer-aided robustness analysis of long-step and accelerated methods in smooth convex optimization","created":"2025-06-11","cited_by_count":0,"area":null},{"id":"2509.08954","title":"Convexity of Optimization Curves: Local Sharp Thresholds, Robustness Impossibility, and New Counterexamples","created":"2025-09-10","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},{"id":"2604.19518","title":"Accelerating Optimization and Machine Learning through Decentralization","created":"2026-04-21","cited_by_count":0,"area":null},{"id":"2605.31594","title":"A Tight Theory of Error Feedback Algorithms in Distributed Optimization","created":"2026-05-29","cited_by_count":0,"area":null},{"id":"2606.06934","title":"Uniform Stability and Generalization Error of GD and SGD on Fixed-Point Parameters","created":"2026-06-05","cited_by_count":0,"area":null},{"id":"2607.07206","title":"Causal Optimizer Interaction Calculus: Hidden Geometric Relaxation and Identifiable Interventions","created":"2026-07-08","cited_by_count":0,"area":null},{"id":"2607.27476","title":"Entropy-Smooth Convex Optimization Cannot Be Accelerated","created":"2026-07-29","cited_by_count":0,"area":null},{"id":"2608.22834","title":"Mirror descent algorithms with logarithmic barriers","created":"2026-08-24","cited_by_count":0,"area":null},{"id":"2609.38375","title":"Lower Bounds for Linear-Oracle Online Learning","created":"2026-09-29","cited_by_count":0,"area":null},{"id":"2609.39114","title":"The Row Normalization Puzzle in Muon","created":"2026-09-30","cited_by_count":0,"area":null},{"id":"2610.06070","title":"Last-Iterate Convergence Rate of Normalized Gradient Descent under H\\\"older Smoothness","created":"2026-10-05","cited_by_count":0,"area":null}],"next_cursor":null}