{"total":32,"rows":[{"id":"2105.11066","title":"Policy Mirror Descent for Regularized Reinforcement Learning: A Generalized Framework with Linear Convergence","created":"2021-05-24","cited_by_count":84,"area":null},{"id":"2104.06763","title":"Oracle Complexity in Nonsmooth Nonconvex Optimization","created":"2021-04-14","cited_by_count":39,"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":"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":"2107.09461","title":"CANITA: Faster Rates for Distributed Convex Optimization with Communication Compression","created":"2021-07-20","cited_by_count":23,"area":null},{"id":"2210.07863","title":"Revisiting Optimal Convergence Rate for Smooth and Non-convex Stochastic Decentralized Optimization","created":"2022-10-14","cited_by_count":23,"area":null},{"id":"2111.11309","title":"No-Regret Dynamics in the Fenchel Game: A Unified Framework for Algorithmic Convex Optimization","created":"2021-11-22","cited_by_count":20,"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":"2109.04522","title":"Asynchronous Iterations in Optimization: New Sequence Results and Sharper Algorithmic Guarantees","created":"2021-09-09","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":"2206.05891","title":"Anchor Sampling for Federated Learning with Partial Client Participation","created":"2022-06-13","cited_by_count":14,"area":null},{"id":"2201.07427","title":"Lifted Primal-Dual Method for Bilinearly Coupled Smooth Minimax Optimization","created":"2022-01-19","cited_by_count":13,"area":null},{"id":"2301.13731","title":"A relaxed proximal gradient descent algorithm for convergent plug-and-play with proximal denoiser","created":"2023-01-31","cited_by_count":12,"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":"2307.01497","title":"Accelerated stochastic approximation with state-dependent noise","created":"2023-07-04","cited_by_count":11,"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":"2110.03294","title":"EF21 with Bells & Whistles: Six Algorithmic Extensions of Modern Error Feedback","created":"2021-10-07","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":"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":"2208.10025","title":"Simple and Optimal Stochastic Gradient Methods for Nonsmooth Nonconvex Optimization","created":"2022-08-22","cited_by_count":5,"area":null},{"id":"2311.01216","title":"Convergent plug-and-play with proximal denoiser and unconstrained regularization parameter","created":"2023-11-02","cited_by_count":5,"area":null},{"id":"2101.00935","title":"First-Order Methods for Convex Optimization","created":"2021-01-04","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":"2203.05117","title":"Optimal Methods for Convex Risk Averse Distributed Optimization","created":"2022-03-10","cited_by_count":2,"area":null},{"id":"2206.00529","title":"Variance Reduction is an Antidote to Byzantines: Better Rates, Weaker Assumptions and Communication Compression as a Cherry on the Top","created":"2022-06-01","cited_by_count":2,"area":null},{"id":"2305.10294","title":"DualFL: A Duality-based Federated Learning Algorithm with Communication Acceleration in the General Convex Regime","created":"2023-05-17","cited_by_count":2,"area":null},{"id":"2308.05292","title":"Byzantine-Robust Decentralized Stochastic Optimization with Stochastic Gradient Noise-Independent Learning Error","created":"2023-08-10","cited_by_count":2,"area":null},{"id":"2405.01731","title":"Dynamic Anisotropic Smoothing for Noisy Derivative-Free Optimization","created":"2024-05-02","cited_by_count":2,"area":null},{"id":"2306.05292","title":"Safe Collaborative Filtering","created":"2023-06-08","cited_by_count":1,"area":null},{"id":"2506.20630","title":"First-order methods for stochastic and finite-sum convex optimization with deterministic constraints","created":"2025-06-25","cited_by_count":1,"area":null},{"id":"2406.04731","title":"Efficient Continual Finite-Sum Minimization","created":"2024-06-07","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}