{"total":151,"rows":[{"id":"2102.12660","title":"Distributionally Robust Federated Averaging","created":"2021-02-25","cited_by_count":104,"area":null},{"id":"2101.04233","title":"Independent Policy Gradient Methods for Competitive Reinforcement Learning","created":"2021-01-11","cited_by_count":101,"area":null},{"id":"2203.15046","title":"AUC Maximization in the Era of Big Data and AI: A Survey","created":"2022-03-28","cited_by_count":100,"area":null},{"id":"2302.12022","title":"DoG is SGD's Best Friend: A Parameter-Free Dynamic Step Size Schedule","created":"2023-02-08","cited_by_count":85,"area":null},{"id":"2102.11845","title":"Learning with User-Level Privacy","created":"2021-02-23","cited_by_count":72,"area":null},{"id":"2102.03926","title":"Lower Bounds and Accelerated Algorithms for Bilevel Optimization","created":"2021-02-07","cited_by_count":46,"area":null},{"id":"2107.05585","title":"Differentially Private Stochastic Optimization: New Results in Convex and Non-Convex Settings","created":"2021-07-12","cited_by_count":45,"area":null},{"id":"2209.05045","title":"Gradient-Free Methods for Deterministic and Stochastic Nonsmooth Nonconvex Optimization","created":"2022-09-12","cited_by_count":43,"area":null},{"id":"2102.13152","title":"Local Stochastic Gradient Descent Ascent: Convergence Analysis and Communication Efficiency","created":"2021-02-25","cited_by_count":40,"area":null},{"id":"2104.06763","title":"Oracle Complexity in Nonsmooth Nonconvex Optimization","created":"2021-04-14","cited_by_count":39,"area":null},{"id":"2110.12459","title":"Non-convex Distributionally Robust Optimization: Non-asymptotic Analysis","created":"2021-10-24","cited_by_count":39,"area":null},{"id":"2206.05187","title":"On Convergence of FedProx: Local Dissimilarity Invariant Bounds, Non-smoothness and Beyond","created":"2022-06-10","cited_by_count":38,"area":null},{"id":"2212.10439","title":"Policy Gradient in Robust MDPs with Global Convergence Guarantee","created":"2022-12-20","cited_by_count":38,"area":null},{"id":"2102.06489","title":"Stability and Convergence of Stochastic Gradient Clipping: Beyond Lipschitz Continuity and Smoothness","created":"2021-02-12","cited_by_count":37,"area":null},{"id":"2203.04850","title":"Federated Minimax Optimization: Improved Convergence Analyses and Algorithms","created":"2022-03-09","cited_by_count":37,"area":null},{"id":"2306.03638","title":"Provable convergence guarantees for black-box variational inference","created":"2023-06-04","cited_by_count":29,"area":null},{"id":"2510.09827","title":"An Exploration of Non-Euclidean Gradient Descent: Muon and its Many Variants","created":"2025-10-10","cited_by_count":28,"area":null},{"id":"2110.11876","title":"Tight and Robust Private Mean Estimation with Few Users","created":"2021-10-22","cited_by_count":26,"area":null},{"id":"2302.08300","title":"Deterministic Nonsmooth Nonconvex Optimization","created":"2023-02-16","cited_by_count":26,"area":null},{"id":"2106.09481","title":"Stochastic Bias-Reduced Gradient Methods","created":"2021-06-17","cited_by_count":25,"area":null},{"id":"2206.07082","title":"Stability and Generalization of Stochastic Optimization with Nonconvex and Nonsmooth Problems","created":"2022-06-14","cited_by_count":25,"area":null},{"id":"2305.07583","title":"MoMo: Momentum Models for Adaptive Learning Rates","created":"2023-05-12","cited_by_count":24,"area":null},{"id":"2402.14758","title":"Batch and match: black-box variational inference with a score-based divergence","created":"2024-02-22","cited_by_count":22,"area":null},{"id":"2405.09742","title":"Random Scaling and Momentum for Non-smooth Non-convex Optimization","created":"2024-05-16","cited_by_count":19,"area":null},{"id":"2101.04968","title":"Learning with Gradient Descent and Weakly Convex Losses","created":"2021-01-13","cited_by_count":16,"area":null},{"id":"2204.07826","title":"Beyond L1: Faster and Better Sparse Models with skglm","created":"2022-04-16","cited_by_count":16,"area":null},{"id":"2208.10451","title":"Minimax AUC Fairness: Efficient Algorithm with Provable Convergence","created":"2022-08-22","cited_by_count":16,"area":null},{"id":"2305.19004","title":"Policy Gradient Algorithms for Robust MDPs with Non-Rectangular Uncertainty Sets","created":"2023-05-30","cited_by_count":16,"area":null},{"id":"2311.00678","title":"Complexity of Single Loop Algorithms for Nonlinear Programming with Stochastic Objective and Constraints","created":"2023-11-01","cited_by_count":16,"area":null},{"id":"2408.11974","title":"Two-Timescale Gradient Descent Ascent Algorithms for Nonconvex Minimax Optimization","created":"2024-08-21","cited_by_count":16,"area":null},{"id":"2301.04935","title":"A Stochastic Proximal Polyak Step Size","created":"2023-01-12","cited_by_count":15,"area":null},{"id":"2101.02696","title":"Accelerated, Optimal, and Parallel: Some Results on Model-Based Stochastic Optimization","created":"2021-01-07","cited_by_count":14,"area":null},{"id":"2303.09261","title":"Orthogonal Directions Constrained Gradient Method: from non-linear equality constraints to Stiefel manifold","created":"2023-03-16","cited_by_count":14,"area":null},{"id":"2104.14840","title":"Unified Convergence Analysis for Adaptive Optimization with Moving Average Estimator","created":"2021-04-30","cited_by_count":13,"area":null},{"id":"2205.00107","title":"Bridging Differential Privacy and Byzantine-Robustness via Model Aggregation","created":"2022-04-29","cited_by_count":13,"area":null},{"id":"2206.03907","title":"A Unified Convergence Theorem for Stochastic Optimization Methods","created":"2022-06-08","cited_by_count":12,"area":null},{"id":"2209.10825","title":"Nonsmooth Nonconvex-Nonconcave Minimax Optimization: Primal-Dual Balancing and Iteration Complexity Analysis","created":"2022-09-22","cited_by_count":12,"area":null},{"id":"2108.11832","title":"Active manifolds, stratifications, and convergence to local minima in nonsmooth optimization","created":"2021-08-26","cited_by_count":11,"area":null},{"id":"2301.13314","title":"Oracle Complexity of Single-Loop Switching Subgradient Methods for Non-Smooth Weakly Convex Functional Constrained Optimization","created":"2023-01-30","cited_by_count":11,"area":null},{"id":"2402.17722","title":"Taming Nonconvex Stochastic Mirror Descent with General Bregman Divergence","created":"2024-02-27","cited_by_count":11,"area":null},{"id":"2106.03034","title":"Minibatch and Momentum Model-based Methods for Stochastic Weakly Convex Optimization","created":"2021-06-06","cited_by_count":10,"area":null},{"id":"2211.07096","title":"Alternating Implicit Projected SGD and Its Efficient Variants for Equality-constrained Bilevel Optimization","created":"2022-11-14","cited_by_count":10,"area":null},{"id":"2310.03234","title":"Non-Smooth Weakly-Convex Finite-sum Coupled Compositional Optimization","created":"2023-10-05","cited_by_count":10,"area":null},{"id":"2310.03613","title":"Solving a Class of Non-Convex Minimax Optimization in Federated Learning","created":"2023-10-05","cited_by_count":10,"area":null},{"id":"2403.02967","title":"Non-convex Stochastic Composite Optimization with Polyak Momentum","created":"2024-03-05","cited_by_count":9,"area":null},{"id":"2501.19214","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","created":"2025-01-31","cited_by_count":9,"area":null},{"id":"2110.03950","title":"Nonconvex-Nonconcave Min-Max Optimization with a Small Maximization Domain","created":"2021-10-08","cited_by_count":8,"area":null},{"id":"2202.04296","title":"A Projection-free Algorithm for Constrained Stochastic Multi-level Composition Optimization","created":"2022-02-09","cited_by_count":8,"area":null},{"id":"2302.04249","title":"Federated Minimax Optimization with Client Heterogeneity","created":"2023-02-08","cited_by_count":8,"area":null},{"id":"2307.05906","title":"Mini-Batch Optimization of Contrastive Loss","created":"2023-07-12","cited_by_count":8,"area":null},{"id":"2307.14528","title":"Function Value Learning: Adaptive Learning Rates Based on the Polyak Stepsize and Function Splitting in ERM","created":"2023-07-26","cited_by_count":8,"area":null},{"id":"2403.06871","title":"On the Generalization Ability of Unsupervised Pretraining","created":"2024-03-11","cited_by_count":8,"area":null},{"id":"2412.20556","title":"Distributionally Robust Optimization via Iterative Algorithms in Continuous Probability Spaces","created":"2024-12-29","cited_by_count":8,"area":null},{"id":"2106.09815","title":"Escaping strict saddle points of the Moreau envelope in nonsmooth optimization","created":"2021-06-17","cited_by_count":7,"area":null},{"id":"2203.15797","title":"Convergence of First-Order Methods for Constrained Nonconvex Optimization with Dependent Data","created":"2022-03-29","cited_by_count":7,"area":null},{"id":"2205.14278","title":"Generalization Bounds of Nonconvex-(Strongly)-Concave Stochastic Minimax Optimization","created":"2022-05-28","cited_by_count":7,"area":null},{"id":"2208.02204","title":"Efficiently Computing Nash Equilibria in Adversarial Team Markov Games","created":"2022-08-03","cited_by_count":7,"area":null},{"id":"2210.09382","title":"Tight Analysis of Extra-gradient and Optimistic Gradient Methods For Nonconvex Minimax Problems","created":"2022-10-17","cited_by_count":7,"area":null},{"id":"2312.11835","title":"Provably Convergent Federated Trilevel Learning","created":"2023-12-19","cited_by_count":6,"area":null},{"id":"2412.14291","title":"Projected gradient methods for nonconvex and stochastic smooth optimization: new complexities and auto-conditioned stepsizes","created":"2024-12-18","cited_by_count":6,"area":null},{"id":"2504.15243","title":"Single-loop Algorithms for Stochastic Non-convex Optimization with Weakly-Convex Constraints","created":"2025-04-21","cited_by_count":6,"area":null},{"id":"2204.00406","title":"A Semismooth Newton Stochastic Proximal Point Algorithm with Variance Reduction","created":"2022-04-01","cited_by_count":5,"area":null},{"id":"2305.05828","title":"A Normal Map-Based Proximal Stochastic Gradient Method: Convergence and Identification Properties","created":"2023-05-10","cited_by_count":5,"area":null},{"id":"2305.17498","title":"A Model-Based Method for Minimizing CVaR and Beyond","created":"2023-05-27","cited_by_count":5,"area":null},{"id":"2504.07607","title":"Stochastic Smoothed Primal-Dual Algorithms for Nonconvex Optimization with Linear Inequality Constraints","created":"2025-04-10","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":"2102.02837","title":"Escaping Saddle Points for Nonsmooth Weakly Convex Functions via Perturbed Proximal Algorithms","created":"2021-02-04","cited_by_count":4,"area":null},{"id":"2210.11113","title":"PAC-Bayesian Learning of Optimization Algorithms","created":"2022-10-20","cited_by_count":4,"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":"2302.12431","title":"Flexible Phase Dynamics for Bio-Plausible Contrastive Learning","created":"2023-02-24","cited_by_count":4,"area":null},{"id":"2309.03094","title":"Smoothing ADMM for Sparse-Penalized Quantile Regression with Non-Convex Penalties","created":"2023-09-04","cited_by_count":4,"area":null},{"id":"2311.13447","title":"Differentially Private Non-Convex Optimization under the KL Condition with Optimal Rates","created":"2023-11-22","cited_by_count":4,"area":null},{"id":"2312.01047","title":"A New Random Reshuffling Method for Nonsmooth Nonconvex Finite-sum Optimization","created":"2023-12-02","cited_by_count":4,"area":null},{"id":"2312.13380","title":"Fed-QSSL: A Framework for Personalized Federated Learning under Bitwidth and Data Heterogeneity","created":"2023-12-20","cited_by_count":4,"area":null},{"id":"2405.10815","title":"A Functional Model Method for Nonconvex Nonsmooth Conditional Stochastic Optimization","created":"2024-05-17","cited_by_count":4,"area":null},{"id":"2405.18577","title":"Single-Loop Stochastic Algorithms for Difference of Max-Structured Weakly Convex Functions","created":"2024-05-28","cited_by_count":4,"area":null},{"id":"2406.01484","title":"Online Optimization Perspective on First-Order and Zero-Order Decentralized Nonsmooth Nonconvex Stochastic Optimization","created":"2024-06-03","cited_by_count":4,"area":null},{"id":"2203.14434","title":"Flexible risk design using bi-directional dispersion","created":"2022-03-28","cited_by_count":3,"area":null},{"id":"2204.07742","title":"DRFLM: Distributionally Robust Federated Learning with Inter-client Noise via Local Mixup","created":"2022-04-16","cited_by_count":3,"area":null},{"id":"2303.13326","title":"Decentralized Adversarial Training over Graphs","created":"2023-03-23","cited_by_count":3,"area":null},{"id":"2310.10006","title":"Soft ascent-descent as a stable and flexible alternative to flooding","created":"2023-10-16","cited_by_count":3,"area":null},{"id":"2401.13971","title":"Stochastic Weakly Convex Optimization Beyond Lipschitz Continuity","created":"2024-01-25","cited_by_count":3,"area":null},{"id":"2405.10289","title":"On the Uniform Convergence of Subdifferentials in Stochastic Optimization and Learning","created":"2024-05-16","cited_by_count":3,"area":null},{"id":"2407.01825","title":"Reevaluating Theoretical Analysis Methods for Optimization in Deep Learning","created":"2024-07-01","cited_by_count":3,"area":null},{"id":"2408.16852","title":"The Star Geometry of Critic-Based Regularizer Learning","created":"2024-08-29","cited_by_count":3,"area":null},{"id":"2410.01410","title":"On the Convergence of FedProx with Extrapolation and Inexact Prox","created":"2024-10-02","cited_by_count":3,"area":null},{"id":"2410.06369","title":"Communication-Efficient Federated Group Distributionally Robust Optimization","created":"2024-10-08","cited_by_count":3,"area":null},{"id":"2111.03854","title":"Learning equilibria with personalized incentives in a class of nonmonotone games","created":"2021-11-06","cited_by_count":2,"area":null},{"id":"2201.01652","title":"Stochastic regularized majorization-minimization with weakly convex and multi-convex surrogates","created":"2022-01-05","cited_by_count":2,"area":null},{"id":"2205.01457","title":"Efficient algorithms for implementing incremental proximal-point methods","created":"2022-05-03","cited_by_count":2,"area":null},{"id":"2302.12261","title":"Testing Stationarity Concepts for ReLU Networks: Hardness, Regularity, and Robust Algorithms","created":"2023-02-23","cited_by_count":2,"area":null},{"id":"2305.14161","title":"Revisiting Subgradient Method: Complexity and Convergence Beyond Lipschitz Continuity","created":"2023-05-23","cited_by_count":2,"area":null},{"id":"2308.16362","title":"A Unified Analysis on the Subgradient Upper Bounds for the Subgradient Methods Minimizing Composite Nonconvex, Nonsmooth and Non-Lipschitz Functions","created":"2023-08-30","cited_by_count":2,"area":null},{"id":"2311.09065","title":"Damped Proximal Augmented Lagrangian Method for weakly-Convex Problems with Convex Constraints","created":"2023-11-15","cited_by_count":2,"area":null},{"id":"2501.02001","title":"Communication Efficient Cooperative Edge AI via Event-Triggered Computation Offloading","created":"2025-01-01","cited_by_count":2,"area":null},{"id":"2502.00882","title":"Worth Their Weight: Randomized and Regularized Block Kaczmarz Algorithms without Preprocessing","created":"2025-02-02","cited_by_count":2,"area":null},{"id":"2505.17965","title":"Bias-Optimal Bounds for SGD: A Computer-Aided Lyapunov Analysis","created":"2025-05-23","cited_by_count":2,"area":null},{"id":"2509.08942","title":"Group Distributionally Robust Machine Learning under Group Level Distributional Uncertainty","created":"2025-09-10","cited_by_count":2,"area":null},{"id":"2510.01943","title":"Smooth Quasar-Convex Optimization with Constraints","created":"2025-10-02","cited_by_count":2,"area":null},{"id":"2510.21468","title":"Finite-Time Analysis of Stochastic Nonconvex Nonsmooth Optimization on the Riemannian Manifolds","created":"2025-10-24","cited_by_count":2,"area":null}],"next_cursor":"100"}