{"total":19,"rows":[{"id":"2402.15926","title":"Large Stepsize Gradient Descent for Logistic Loss: Non-Monotonicity of the Loss Improves Optimization Efficiency","created":"2024-02-24","cited_by_count":35,"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":"2504.04105","title":"Minimax Optimal Convergence of Gradient Descent in Logistic Regression via Large and Adaptive Stepsizes","created":"2025-04-05","cited_by_count":7,"area":null},{"id":"2406.13888","title":"Open Problem: Anytime Convergence Rate of Gradient Descent","created":"2024-06-19","cited_by_count":5,"area":null},{"id":"2510.17506","title":"Convergence Rates for Gradient Descent on the Edge of Stability in Overparametrised Least Squares","created":"2025-10-20","cited_by_count":4,"area":null},{"id":"2604.13870","title":"Gradient Descent's Last Iterate is Often (slightly) Suboptimal","created":"2026-04-15","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":"2505.23081","title":"Gradient Methods with Online Scaling Part I. Theoretical Foundations","created":"2025-05-29","cited_by_count":3,"area":null},{"id":"2311.18431","title":"On the convergence of adaptive first order methods: proximal gradient and alternating minimization algorithms","created":"2023-11-30","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":"2602.12471","title":"Tight Bounds for Logistic Regression with Large Stepsize Gradient Descent in Low Dimension","created":"2026-02-12","cited_by_count":1,"area":null},{"id":"2607.08380","title":"Dynamics of Gradient Descent with Large Step Size Near a Manifold of Flat Minima","created":"2026-07-09","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":"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":"2602.18946","title":"Exponential Convergence of (Stochastic) Gradient Descent for Separable Logistic Regression","created":"2026-02-21","cited_by_count":0,"area":null},{"id":"2604.13393","title":"A short proof of near-linear convergence of adaptive gradient descent under fourth-order growth and convexity","created":"2026-04-15","cited_by_count":0,"area":null},{"id":"2609.08656","title":"A Lower Bound for the Heavy-Ball Method on Smooth Convex Functions","created":"2026-09-08","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}],"next_cursor":null}