{"total":47,"rows":[{"id":"2205.09588","title":"How catastrophic can catastrophic forgetting be in linear regression?","created":"2022-05-19","cited_by_count":81,"area":null},{"id":"2102.08352","title":"Stochastic Variance Reduction for Variational Inequality Methods","created":"2021-02-16","cited_by_count":47,"area":null},{"id":"2103.15888","title":"The Complexity of Nonconvex-Strongly-Concave Minimax Optimization","created":"2021-03-29","cited_by_count":45,"area":null},{"id":"2102.09743","title":"Personalized Federated Learning: A Unified Framework and Universal Optimization Techniques","created":"2021-02-19","cited_by_count":34,"area":null},{"id":"2102.01583","title":"The Min-Max Complexity of Distributed Stochastic Convex Optimization with Intermittent Communication","created":"2021-02-02","cited_by_count":31,"area":null},{"id":"2106.09481","title":"Stochastic Bias-Reduced Gradient Methods","created":"2021-06-17","cited_by_count":25,"area":null},{"id":"2103.08280","title":"Lower Complexity Bounds of Finite-Sum Optimization Problems: The Results and Construction","created":"2021-03-15","cited_by_count":24,"area":null},{"id":"2212.14370","title":"Can 5th Generation Local Training Methods Support Client Sampling? Yes!","created":"2022-12-29","cited_by_count":22,"area":null},{"id":"2209.02257","title":"Faster federated optimization under second-order similarity","created":"2022-09-06","cited_by_count":18,"area":null},{"id":"2105.01778","title":"Thinking Inside the Ball: Near-Optimal Minimization of the Maximal Loss","created":"2021-05-04","cited_by_count":17,"area":null},{"id":"2106.01761","title":"Near Optimal Stochastic Algorithms for Finite-Sum Unbalanced Convex-Concave Minimax Optimization","created":"2021-06-03","cited_by_count":16,"area":null},{"id":"2302.08766","title":"A Lower Bound and a Near-Optimal Algorithm for Bilevel Empirical Risk Minimization","created":"2023-02-17","cited_by_count":16,"area":null},{"id":"2110.03313","title":"Distributed Methods with Compressed Communication for Solving Variational Inequalities, with Theoretical Guarantees","created":"2021-10-07","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":"2211.01851","title":"Adaptive Stochastic Variance Reduction for Non-convex Finite-Sum Minimization","created":"2022-11-03","cited_by_count":15,"area":null},{"id":"2107.00469","title":"Never Go Full Batch (in Stochastic Convex Optimization)","created":"2021-06-29","cited_by_count":14,"area":null},{"id":"2203.13225","title":"Distributionally Robust Optimization via Ball Oracle Acceleration","created":"2022-03-24","cited_by_count":14,"area":null},{"id":"2203.15260","title":"Efficient Convex Optimization Requires Superlinear Memory","created":"2022-03-29","cited_by_count":14,"area":null},{"id":"2402.07793","title":"Tuning-Free Stochastic Optimization","created":"2024-02-12","cited_by_count":13,"area":null},{"id":"2304.07504","title":"Stochastic Distributed Optimization under Average Second-order Similarity: Algorithms and Analysis","created":"2023-04-15","cited_by_count":11,"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":"2103.11333","title":"ANITA: An Optimal Loopless Accelerated Variance-Reduced Gradient Method","created":"2021-03-21","cited_by_count":9,"area":null},{"id":"2206.08627","title":"RECAPP: Crafting a More Efficient Catalyst for Convex Optimization","created":"2022-06-17","cited_by_count":8,"area":null},{"id":"2208.00779","title":"DADAO: Decoupled Accelerated Decentralized Asynchronous Optimization","created":"2022-07-26","cited_by_count":8,"area":null},{"id":"2407.09690","title":"Private Heterogeneous Federated Learning Without a Trusted Server Revisited: Error-Optimal and Communication-Efficient Algorithms for Convex Losses","created":"2024-07-12","cited_by_count":8,"area":null},{"id":"2103.12293","title":"Stochastic Reweighted Gradient Descent","created":"2021-03-23","cited_by_count":7,"area":null},{"id":"2208.10025","title":"Simple and Optimal Stochastic Gradient Methods for Nonsmooth Nonconvex Optimization","created":"2022-08-22","cited_by_count":5,"area":null},{"id":"2302.04963","title":"Quadratic Memory is Necessary for Optimal Query Complexity in Convex Optimization: Center-of-Mass is Pareto-Optimal","created":"2023-02-09","cited_by_count":5,"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":"2604.16620","title":"Lower Bounds and Proximally Anchored SGD for Non-Convex Minimization Under Unbounded Variance","created":"2026-04-17","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":"2110.10093","title":"Stochastic Primal-Dual Deep Unrolling","created":"2021-10-19","cited_by_count":4,"area":null},{"id":"2201.12302","title":"Adaptive Accelerated (Extra-)Gradient Methods with Variance Reduction","created":"2022-01-28","cited_by_count":4,"area":null},{"id":"2306.12534","title":"Memory-Query Tradeoffs for Randomized Convex Optimization","created":"2023-06-21","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":"2303.11954","title":"Bayesian Optimization for Function Compositions with Applications to Dynamic Pricing","created":"2023-03-21","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":"2211.15310","title":"Stochastic Steffensen method","created":"2022-11-28","cited_by_count":2,"area":null},{"id":"2402.02359","title":"Incremental Quasi-Newton Methods with Faster Superlinear Convergence Rates","created":"2024-02-04","cited_by_count":2,"area":null},{"id":"2402.02569","title":"On the Complexity of Finite-Sum Smooth Optimization under the Polyak-{\\L}ojasiewicz Condition","created":"2024-02-04","cited_by_count":2,"area":null},{"id":"2511.13999","title":"On the Gradient Complexity of Private Optimization with Private Oracles","created":"2025-11-17","cited_by_count":2,"area":null},{"id":"2103.05138","title":"On the Oracle Complexity of Higher-Order Smooth Non-Convex Finite-Sum Optimization","created":"2021-03-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":"2208.03811","title":"Decomposable Non-Smooth Convex Optimization with Nearly-Linear Gradient Oracle Complexity","created":"2022-08-07","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":"2610.05038","title":"Optimal Oracle Complexity for Finite-Sum Monotone Inclusions","created":"2026-10-04","cited_by_count":0,"area":null}],"next_cursor":null}