{"total":14,"rows":[{"id":"2305.16284","title":"DoWG Unleashed: An Efficient Universal Parameter-Free Gradient Descent Method","created":"2023-05-25","cited_by_count":35,"area":null},{"id":"2107.00464","title":"On the Convergence of Stochastic Extragradient for Bilinear Games using Restarted Iteration Averaging","created":"2021-06-30","cited_by_count":18,"area":null},{"id":"2310.10082","title":"A simple uniformly optimal method without line search for convex optimization","created":"2023-10-16","cited_by_count":18,"area":null},{"id":"2106.02720","title":"An Even More Optimal Stochastic Optimization Algorithm: Minibatching and Interpolation Learning","created":"2021-06-04","cited_by_count":10,"area":null},{"id":"2203.13908","title":"On efficient algorithms for computing near-best polynomial approximations to high-dimensional, Hilbert-valued functions from limited samples","created":"2022-03-25","cited_by_count":8,"area":null},{"id":"2504.06962","title":"Efficient Self-Supervised Learning for Earth Observation via Dynamic Dataset Curation","created":"2025-04-09","cited_by_count":7,"area":null},{"id":"2203.00804","title":"NESTANets: Stable, accurate and efficient neural networks for analysis-sparse inverse problems","created":"2022-03-02","cited_by_count":5,"area":null},{"id":"2205.03202","title":"Perseus: A Simple and Optimal High-Order Method for Variational Inequalities","created":"2022-05-06","cited_by_count":5,"area":null},{"id":"2301.03125","title":"Sharper Analysis for Minibatch Stochastic Proximal Point Methods: Stability, Smoothness, and Deviation","created":"2023-01-09","cited_by_count":4,"area":null},{"id":"2210.17550","title":"Nesterov Meets Optimism: Rate-Optimal Separable Minimax Optimization","created":"2022-10-31","cited_by_count":2,"area":null},{"id":"2301.02268","title":"Restarts subject to approximate sharpness: A parameter-free and optimal scheme for first-order methods","created":"2023-01-05","cited_by_count":2,"area":null},{"id":"2303.05037","title":"Gauges and Accelerated Optimization over Smooth and/or Strongly Convex Sets","created":"2023-03-09","cited_by_count":2,"area":null},{"id":"2305.17323","title":"Some Primal-Dual Theory for Subgradient Methods for Strongly Convex Optimization","created":"2023-05-27","cited_by_count":0,"area":null},{"id":"2507.19465","title":"Linearly Convergent Algorithms for Nonsmooth Problems with Unknown Smooth Regions","created":"2025-07-25","cited_by_count":0,"area":null}],"next_cursor":null}