{"total":21,"rows":[{"id":"2402.19078","title":"Smooth Tchebycheff Scalarization for Multi-Objective Optimization","created":"2024-02-29","cited_by_count":54,"area":null},{"id":"2104.06763","title":"Oracle Complexity in Nonsmooth Nonconvex Optimization","created":"2021-04-14","cited_by_count":39,"area":null},{"id":"2106.11938","title":"Robust Regression Revisited: Acceleration and Improved Estimation Rates","created":"2021-06-22","cited_by_count":15,"area":null},{"id":"2202.04640","title":"Sharper Rates for Separable Minimax and Finite Sum Optimization via Primal-Dual Extragradient Methods","created":"2022-02-09","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":"2102.13643","title":"Variance Reduction via Primal-Dual Accelerated Dual Averaging for Nonsmooth Convex Finite-Sums","created":"2021-02-26","cited_by_count":10,"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.01744","title":"Accelerated SGD for Non-Strongly-Convex Least Squares","created":"2022-03-03","cited_by_count":9,"area":null},{"id":"2101.00935","title":"First-Order Methods for Convex Optimization","created":"2021-01-04","cited_by_count":4,"area":null},{"id":"2406.03006","title":"Quantum Algorithms and Lower Bounds for Finite-Sum Optimization","created":"2024-06-05","cited_by_count":4,"area":null},{"id":"2501.15941","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","created":"2025-01-27","cited_by_count":4,"area":null},{"id":"2310.17759","title":"Optimal Guarantees for Algorithmic Reproducibility and Gradient Complexity in Convex Optimization","created":"2023-10-26","cited_by_count":3,"area":null},{"id":"2511.22331","title":"On the Condition Number Dependency in Bilevel Optimization","created":"2025-11-27","cited_by_count":3,"area":null},{"id":"2101.01505","title":"Delayed Projection Techniques for Linearly Constrained Problems: Convergence Rates, Acceleration, and Applications","created":"2021-01-05","cited_by_count":2,"area":null},{"id":"2505.00398","title":"Safety in the Face of Adversity: Achieving Zero Constraint Violation in Online Learning with Slowly Changing Constraints","created":"2025-05-01","cited_by_count":1,"area":null},{"id":"2604.16075","title":"Towards Universal Convergence of Backward Error in Linear System Solvers","created":"2026-04-17","cited_by_count":1,"area":null},{"id":"2608.08463","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","created":"2026-08-09","cited_by_count":1,"area":null},{"id":"2110.10858","title":"Utilizing Redundancy in Cost Functions for Resilience in Distributed Optimization and Learning","created":"2021-10-21","cited_by_count":0,"area":null},{"id":"2211.08622","title":"Impact of Redundancy on Resilience in Distributed Optimization and Learning","created":"2022-11-16","cited_by_count":0,"area":null},{"id":"2304.11665","title":"Accelerated Doubly Stochastic Gradient Algorithm for Large-scale Empirical Risk Minimization","created":"2023-04-23","cited_by_count":0,"area":null},{"id":"2410.02559","title":"Obtaining Lower Query Complexities through Lightweight Zeroth-Order Proximal Gradient Algorithms","created":"2024-10-03","cited_by_count":0,"area":null}],"next_cursor":null}