{"total":16,"rows":[{"id":"2307.06324","title":"Provably Faster Gradient Descent via Long Steps","created":"2023-07-12","cited_by_count":20,"area":null},{"id":"2308.09474","title":"Evolving Scientific Discovery by Unifying Data and Background Knowledge with AI Hilbert","created":"2023-08-18","cited_by_count":18,"area":null},{"id":"2411.17668","title":"Anytime Acceleration of Gradient Descent","created":"2024-11-26","cited_by_count":7,"area":null},{"id":"2303.17192","title":"Sublinear Convergence Rates of Extragradient-Type Methods: A Survey on Classical and Recent Developments","created":"2023-03-30","cited_by_count":5,"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":"2412.18529","title":"Accelerating process control and optimization via machine learning: A review","created":"2024-12-24","cited_by_count":5,"area":null},{"id":"2209.14790","title":"Sparse PCA With Multiple Components","created":"2022-09-29","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":"2506.05855","title":"Optimized projection-free algorithms for online learning: construction and worst-case analysis","created":"2025-06-06","cited_by_count":3,"area":null},{"id":"2609.02855","title":"Improved Gradient Descent Lower Bounds Beyond Nesterov","created":"2026-09-02","cited_by_count":2,"area":null},{"id":"2404.06720","title":"Gradient Descent is Pareto-Optimal in the Oracle Complexity and Memory Tradeoff for Feasibility Problems","created":"2024-04-10","cited_by_count":1,"area":null},{"id":"2603.22155","title":"RAMPAGE: RAndomized Mid-Point for debiAsed Gradient Extrapolation","created":"2026-03-23","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":"2402.03021","title":"Data-induced multiscale losses and efficient multirate gradient descent schemes","created":"2024-02-05","cited_by_count":0,"area":null},{"id":"2601.03442","title":"Local Updates in Distributed Optimization: Provable Acceleration and Topology Effects","created":"2026-01-06","cited_by_count":0,"area":null}],"next_cursor":null}