{"total":54,"rows":[{"id":"2103.15888","title":"The Complexity of Nonconvex-Strongly-Concave Minimax Optimization","created":"2021-03-29","cited_by_count":45,"area":null},{"id":"2302.10249","title":"Faster high-accuracy log-concave sampling via algorithmic warm starts","created":"2023-02-20","cited_by_count":45,"area":null},{"id":"2102.07158","title":"Distributed Second Order Methods with Fast Rates and Compressed Communication","created":"2021-02-14","cited_by_count":25,"area":null},{"id":"2106.09481","title":"Stochastic Bias-Reduced Gradient Methods","created":"2021-06-17","cited_by_count":25,"area":null},{"id":"2107.09461","title":"CANITA: Faster Rates for Distributed Convex Optimization with Communication Compression","created":"2021-07-20","cited_by_count":23,"area":null},{"id":"2102.06333","title":"Efficient Algorithms for Federated Saddle Point Optimization","created":"2021-02-12","cited_by_count":20,"area":null},{"id":"2205.05653","title":"The First Optimal Algorithm for Smooth and Strongly-Convex-Strongly-Concave Minimax Optimization","created":"2022-05-11","cited_by_count":20,"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":"2110.12347","title":"Acceleration in Distributed Optimization under Similarity","created":"2021-10-24","cited_by_count":17,"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":"2403.03562","title":"Efficient Algorithms for Empirical Group Distributionally Robust Optimization and Beyond","created":"2024-03-06","cited_by_count":11,"area":null},{"id":"2208.13592","title":"Smooth Monotone Stochastic Variational Inequalities and Saddle Point Problems: A Survey","created":"2022-08-29","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.02702","title":"Stochastic Variance-Reduced Newton: Accelerating Finite-Sum Minimization with Large Batches","created":"2022-06-06","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":"2111.06171","title":"Convergence and Stability of the Stochastic Proximal Point Algorithm with Momentum","created":"2021-11-11","cited_by_count":7,"area":null},{"id":"2311.05589","title":"A Coefficient Makes SVRG Effective","created":"2023-11-09","cited_by_count":7,"area":null},{"id":"2405.05818","title":"Fine-grained Analysis and Faster Algorithms for Iteratively Solving Linear Systems","created":"2024-05-09","cited_by_count":7,"area":null},{"id":"2407.07084","title":"Stabilized Proximal-Point Methods for Federated Optimization","created":"2024-07-09","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":"2307.15868","title":"Faster Stochastic Algorithms for Minimax Optimization under Polyak--{\\L}ojasiewicz Conditions","created":"2023-07-29","cited_by_count":5,"area":null},{"id":"2410.06293","title":"Accelerated Preference Optimization for Large Language Model Alignment","created":"2024-10-08","cited_by_count":5,"area":"alignment"},{"id":"2101.00935","title":"First-Order Methods for Convex Optimization","created":"2021-01-04","cited_by_count":4,"area":null},{"id":"2101.12101","title":"Potential Function-based Framework for Making the Gradients Small in Convex and Min-Max Optimization","created":"2021-01-28","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":"2608.12043","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","created":"2026-08-12","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":"2311.10886","title":"A Whole New Ball Game: A Primal Accelerated Method for Matrix Games and Minimizing the Maximum of Smooth Functions","created":"2023-11-17","cited_by_count":3,"area":null},{"id":"2404.14758","title":"Second-order Information Promotes Mini-Batch Robustness in Variance-Reduced Gradients","created":"2024-04-23","cited_by_count":3,"area":null},{"id":"2509.02970","title":"Delayed Momentum Aggregation: Communication-efficient Byzantine-robust Federated Learning with Partial Participation","created":"2025-09-03","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":"2212.06283","title":"Variance-Reduced Conservative Policy Iteration","created":"2022-12-12","cited_by_count":2,"area":null},{"id":"2409.14280","title":"Accelerated Stochastic ExtraGradient: Mixing Hessian and Gradient Similarity to Reduce Communication in Distributed and Federated Learning","created":"2024-09-22","cited_by_count":2,"area":null},{"id":"2410.07272","title":"Boosting the Performance of Decentralized Federated Learning via Catalyst Acceleration","created":"2024-10-09","cited_by_count":2,"area":null},{"id":"2507.11724","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","created":"2025-07-15","cited_by_count":2,"area":null},{"id":"2111.05530","title":"Nearly Optimal Linear Convergence of Stochastic Primal-Dual Methods for Linear Programming","created":"2021-11-10","cited_by_count":1,"area":null},{"id":"2204.07702","title":"On Acceleration of Gradient-Based Empirical Risk Minimization using Local Polynomial Regression","created":"2022-04-16","cited_by_count":1,"area":null},{"id":"2205.10247","title":"SADAM: Stochastic Adam, A Stochastic Operator for First-Order Gradient-based Optimizer","created":"2022-05-20","cited_by_count":1,"area":null},{"id":"2309.13307","title":"CORE: Common Random Reconstruction for Distributed Optimization with Provable Low Communication Complexity","created":"2023-09-23","cited_by_count":1,"area":null},{"id":"2410.06482","title":"OledFL: Unleashing the Potential of Decentralized Federated Learning via Opposite Lookahead Enhancement","created":"2024-10-09","cited_by_count":1,"area":null},{"id":"2108.04482","title":"Complexity of Inexact Proximal Point Algorithm for minimizing convex functions with Holderian Growth","created":"2021-08-10","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":"2306.15848","title":"Ordering for Non-Replacement SGD","created":"2023-06-28","cited_by_count":0,"area":null},{"id":"2406.13879","title":"A Catalyst Framework for the Quantum Linear System Problem via the Proximal Point Algorithm","created":"2024-06-19","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},{"id":"2505.11748","title":"HOME-3: High-Order Momentum Estimator with Third-Power Gradient for Convex and Smooth Nonconvex Optimization","created":"2025-05-16","cited_by_count":0,"area":null},{"id":"2505.11752","title":"Permutation Randomization on Nonsmooth Nonconvex Optimization: A Theoretical and Experimental Study","created":"2025-05-16","cited_by_count":0,"area":null},{"id":"2505.23588","title":"Accelerated Training of Federated Learning via Second-Order Methods","created":"2025-05-29","cited_by_count":0,"area":null},{"id":"2510.08010","title":"Accelerated Evolving Set Processes for Local PageRank Computation","created":"2025-10-09","cited_by_count":0,"area":null},{"id":"2601.08614","title":"Accelerated Methods with Complexity Separation Under Data Similarity for Federated Learning Problems","created":"2026-01-13","cited_by_count":0,"area":null},{"id":"2607.04062","title":"Fast, Parallel, Query-Efficient Binary Classification","created":"2026-07-05","cited_by_count":0,"area":null}],"next_cursor":null}