{"total":255,"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":"2102.04671","title":"A Single-Timescale Method for Stochastic Bilevel Optimization","created":"2021-02-09","cited_by_count":69,"area":null},{"id":"2111.01207","title":"Sig-Wasserstein GANs for Time Series Generation","created":"2021-11-01","cited_by_count":60,"area":null},{"id":"2205.02215","title":"FedNest: Federated Bilevel, Minimax, and Compositional Optimization","created":"2022-05-04","cited_by_count":60,"area":null},{"id":"2402.19078","title":"Smooth Tchebycheff Scalarization for Multi-Objective Optimization","created":"2024-02-29","cited_by_count":54,"area":null},{"id":"2112.05604","title":"Faster Single-loop Algorithms for Minimax Optimization without Strong Concavity","created":"2021-12-10","cited_by_count":49,"area":null},{"id":"2106.09110","title":"Safe Reinforcement Learning Using Advantage-Based Intervention","created":"2021-06-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":"2107.00052","title":"Stochastic Gradient Descent-Ascent and Consensus Optimization for Smooth Games: Convergence Analysis under Expected Co-coercivity","created":"2021-06-30","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":"2301.00712","title":"On Finding Small Hyper-Gradients in Bilevel Optimization: Hardness Results and Improved Analysis","created":"2023-01-02","cited_by_count":39,"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":"2203.04850","title":"Federated Minimax Optimization: Improved Convergence Analyses and Algorithms","created":"2022-03-09","cited_by_count":37,"area":null},{"id":"2104.08708","title":"Complexity Lower Bounds for Nonconvex-Strongly-Concave Min-Max Optimization","created":"2021-04-18","cited_by_count":36,"area":null},{"id":"2105.03793","title":"Stability and Generalization of Stochastic Gradient Methods for Minimax Problems","created":"2021-05-08","cited_by_count":36,"area":null},{"id":"2205.14224","title":"Will Bilevel Optimizers Benefit from Loops","created":"2022-05-27","cited_by_count":36,"area":null},{"id":"2112.12228","title":"Direct Behavior Specification via Constrained Reinforcement Learning","created":"2021-12-22","cited_by_count":31,"area":null},{"id":"2306.12067","title":"Optimal Algorithms for Stochastic Bilevel Optimization under Relaxed Smoothness Conditions","created":"2023-06-21","cited_by_count":31,"area":null},{"id":"2206.02346","title":"Convergence and sample complexity of natural policy gradient primal-dual methods for constrained MDPs","created":"2022-06-06","cited_by_count":27,"area":null},{"id":"2102.12586","title":"A Stochastic Optimization Framework for Fair Risk Minimization","created":"2021-02-24","cited_by_count":26,"area":null},{"id":"2206.02417","title":"Fast Adversarial Training with Adaptive Step Size","created":"2022-06-06","cited_by_count":25,"area":null},{"id":"2208.04425","title":"Controlled Sparsity via Constrained Optimization or: How I Learned to Stop Tuning Penalties and Love Constraints","created":"2022-08-08","cited_by_count":25,"area":null},{"id":"2201.09046","title":"Differentially Private SGDA for Minimax Problems","created":"2022-01-22","cited_by_count":23,"area":null},{"id":"2106.13781","title":"Tighter Analysis of Alternating Stochastic Gradient Method for Stochastic Nested Problems","created":"2021-06-25","cited_by_count":22,"area":null},{"id":"2202.12183","title":"Large-scale Stochastic Optimization of NDCG Surrogates for Deep Learning with Provable Convergence","created":"2022-02-24","cited_by_count":22,"area":null},{"id":"2212.02705","title":"What is the Solution for State-Adversarial Multi-Agent Reinforcement Learning?","created":"2022-12-06","cited_by_count":22,"area":null},{"id":"2102.04635","title":"Federated Deep AUC Maximization for Heterogeneous Data with a Constant Communication Complexity","created":"2021-02-09","cited_by_count":21,"area":null},{"id":"2208.05925","title":"Near-Optimal Algorithms for Making the Gradient Small in Stochastic Minimax Optimization","created":"2022-08-11","cited_by_count":20,"area":null},{"id":"2202.03684","title":"Efficiently Escaping Saddle Points in Bilevel Optimization","created":"2022-02-08","cited_by_count":19,"area":null},{"id":"2102.04653","title":"Proximal Gradient Descent-Ascent: Variable Convergence under K{\\L} Geometry","created":"2021-02-09","cited_by_count":18,"area":null},{"id":"2205.13746","title":"Regularized Gradient Descent Ascent for Two-Player Zero-Sum Markov Games","created":"2022-05-27","cited_by_count":18,"area":null},{"id":"2206.10414","title":"A Single-Timescale Analysis For Stochastic Approximation With Multiple Coupled Sequences","created":"2022-06-21","cited_by_count":17,"area":null},{"id":"2306.14853","title":"Near-Optimal Nonconvex-Strongly-Convex Bilevel Optimization with Fully First-Order Oracles","created":"2023-06-26","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.00743","title":"Nest Your Adaptive Algorithm for Parameter-Agnostic Nonconvex Minimax Optimization","created":"2022-06-01","cited_by_count":16,"area":null},{"id":"2206.04502","title":"What is a Good Metric to Study Generalization of Minimax Learners?","created":"2022-06-09","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":"2210.08781","title":"Stochastic Differentially Private and Fair Learning","created":"2022-10-17","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":"2101.01041","title":"Derivative-Free Policy Optimization for Linear Risk-Sensitive and Robust Control Design: Implicit Regularization and Sample Complexity","created":"2021-01-04","cited_by_count":15,"area":null},{"id":"2209.06866","title":"Robust Constrained Reinforcement Learning","created":"2022-09-14","cited_by_count":15,"area":null},{"id":"2305.19742","title":"Reliable Off-Policy Learning for Dosage Combinations","created":"2023-05-31","cited_by_count":15,"area":null},{"id":"2307.00126","title":"Accelerating Inexact HyperGradient Descent for Bilevel Optimization","created":"2023-06-30","cited_by_count":15,"area":null},{"id":"2209.08005","title":"Stability and Generalization for Markov Chain Stochastic Gradient Methods","created":"2022-09-16","cited_by_count":14,"area":null},{"id":"2210.07588","title":"Distributed Distributionally Robust Optimization with Non-Convex Objectives","created":"2022-10-14","cited_by_count":14,"area":null},{"id":"2302.14043","title":"Single-Call Stochastic Extragradient Methods for Structured Non-monotone Variational Inequalities: Improved Analysis under Weaker Conditions","created":"2023-02-27","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":"2106.16101","title":"AdaGDA: Faster Adaptive Gradient Descent Ascent Methods for Minimax Optimization","created":"2021-06-30","cited_by_count":13,"area":null},{"id":"2212.08791","title":"Two-Scale Gradient Descent Ascent Dynamics Finds Mixed Nash Equilibria of Continuous Games: A Mean-Field Perspective","created":"2022-12-17","cited_by_count":13,"area":null},{"id":"2105.01696","title":"Learning to Continuously Optimize Wireless Resource in a Dynamic Environment: A Bilevel Optimization Perspective","created":"2021-05-03","cited_by_count":12,"area":null},{"id":"2110.04814","title":"Finding Second-Order Stationary Points in Nonconvex-Strongly-Concave Minimax Optimization","created":"2021-10-10","cited_by_count":12,"area":null},{"id":"2206.02468","title":"An Optimal Transport Approach to Personalized Federated Learning","created":"2022-06-06","cited_by_count":12,"area":null},{"id":"2207.05650","title":"A Single-Loop Gradient Descent and Perturbed Ascent Algorithm for Nonconvex Functional Constrained Optimization","created":"2022-07-12","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":"2212.12978","title":"Universal Gradient Descent Ascent Method for Nonconvex-Nonconcave Minimax Optimization","created":"2022-12-26","cited_by_count":12,"area":null},{"id":"2406.04558","title":"On PI Controllers for Updating Lagrange Multipliers in Constrained Optimization","created":"2024-06-07","cited_by_count":12,"area":null},{"id":"2206.00260","title":"Multi-block Min-max Bilevel Optimization with Applications in Multi-task Deep AUC Maximization","created":"2022-06-01","cited_by_count":11,"area":null},{"id":"2209.08230","title":"A Robust and Constrained Multi-Agent Reinforcement Learning Electric Vehicle Rebalancing Method in AMoD Systems","created":"2022-09-17","cited_by_count":11,"area":null},{"id":"2211.13668","title":"Zeroth-Order Alternating Gradient Descent Ascent Algorithms for a Class of Nonconvex-Nonconcave Minimax Problems","created":"2022-11-24","cited_by_count":11,"area":null},{"id":"2212.02724","title":"Decentralized Stochastic Gradient Descent Ascent for Finite-Sum Minimax Problems","created":"2022-12-06","cited_by_count":11,"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":"2505.01423","title":"Negative Stepsizes Make Gradient-Descent-Ascent Converge","created":"2025-05-02","cited_by_count":11,"area":null},{"id":"2104.12676","title":"Solving a class of non-convex min-max games using adaptive momentum methods","created":"2021-04-26","cited_by_count":10,"area":null},{"id":"2112.09579","title":"Convergence Rates of Two-Time-Scale Gradient Descent-Ascent Dynamics for Solving Nonconvex Min-Max Problems","created":"2021-12-17","cited_by_count":10,"area":null},{"id":"2205.15614","title":"Communication-Efficient Distributionally Robust Decentralized Learning","created":"2022-05-31","cited_by_count":10,"area":null},{"id":"2206.02041","title":"First-Order Algorithms for Min-Max Optimization in Geodesic Metric Spaces","created":"2022-06-04","cited_by_count":10,"area":null},{"id":"2206.02953","title":"Sampling without Replacement Leads to Faster Rates in Finite-Sum Minimax Optimization","created":"2022-06-07","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.00329","title":"Learning with Logical Constraints but without Shortcut Satisfaction","created":"2024-03-01","cited_by_count":10,"area":null},{"id":"2110.05192","title":"Convex-Concave Min-Max Stackelberg Games","created":"2021-10-05","cited_by_count":9,"area":null},{"id":"2110.08477","title":"FedMM: Saddle Point Optimization for Federated Adversarial Domain Adaptation","created":"2021-10-16","cited_by_count":9,"area":null},{"id":"2203.01924","title":"Min-Max Bilevel Multi-objective Optimization with Applications in Machine Learning","created":"2022-03-03","cited_by_count":9,"area":null},{"id":"2206.01132","title":"A Communication-efficient Algorithm with Linear Convergence for Federated Minimax Learning","created":"2022-06-02","cited_by_count":9,"area":null},{"id":"2207.00957","title":"On Convergence of Gradient Descent Ascent: A Tight Local Analysis","created":"2022-07-03","cited_by_count":9,"area":null},{"id":"2303.03095","title":"Can We Find Nash Equilibria at a Linear Rate in Markov Games?","created":"2023-03-03","cited_by_count":9,"area":null},{"id":"2310.20369","title":"Stability and Generalization of the Decentralized Stochastic Gradient Descent Ascent Algorithm","created":"2023-10-31","cited_by_count":9,"area":null},{"id":"2106.01425","title":"GAL: Gradient Assisted Learning for Decentralized Multi-Organization Collaborations","created":"2021-06-02","cited_by_count":8,"area":null},{"id":"2106.01488","title":"Minimax Optimization with Smooth Algorithmic Adversaries","created":"2021-06-02","cited_by_count":8,"area":null},{"id":"2107.03633","title":"Generalization Error of GAN from the Discriminator's Perspective","created":"2021-07-08","cited_by_count":8,"area":null},{"id":"2107.05134","title":"Dual Training of Energy-Based Models with Overparametrized Shallow Neural Networks","created":"2021-07-11","cited_by_count":8,"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":"2205.09589","title":"Learning Energy Networks with Generalized Fenchel-Young Losses","created":"2022-05-19","cited_by_count":8,"area":null},{"id":"2206.00439","title":"Algorithmic Foundations of Empirical X-risk Minimization","created":"2022-06-01","cited_by_count":8,"area":null},{"id":"2207.04771","title":"Functional Generalized Empirical Likelihood Estimation for Conditional Moment Restrictions","created":"2022-07-11","cited_by_count":8,"area":null},{"id":"2210.05995","title":"SGDA with shuffling: faster convergence for nonconvex-P{\\L} minimax optimization","created":"2022-10-12","cited_by_count":8,"area":null},{"id":"2210.12812","title":"Symmetric (Optimistic) Natural Policy Gradient for Multi-agent Learning with Parameter Convergence","created":"2022-10-23","cited_by_count":8,"area":null},{"id":"2210.17478","title":"TiAda: A Time-scale Adaptive Algorithm for Nonconvex Minimax Optimization","created":"2022-10-31","cited_by_count":8,"area":null},{"id":"2301.02060","title":"A first-order augmented Lagrangian method for constrained minimax optimization","created":"2023-01-05","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":"2304.10101","title":"Federated Compositional Deep AUC Maximization","created":"2023-04-20","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":"2405.00965","title":"Robust Decentralized Learning with Local Updates and Gradient Tracking","created":"2024-05-02","cited_by_count":8,"area":null},{"id":"2102.11386","title":"Direct-Search for a Class of Stochastic Min-Max Problems","created":"2021-02-22","cited_by_count":7,"area":null},{"id":"2106.07537","title":"A Wasserstein Minimax Framework for Mixed Linear Regression","created":"2021-06-14","cited_by_count":7,"area":null},{"id":"2108.00473","title":"Derivative-free Alternating Projection Algorithms for General Nonconvex-Concave Minimax Problems","created":"2021-08-01","cited_by_count":7,"area":null},{"id":"2201.10447","title":"Differentially Private Temporal Difference Learning with Stochastic Nonconvex-Strongly-Concave Optimization","created":"2022-01-25","cited_by_count":7,"area":null},{"id":"2203.16615","title":"A Fast and Convergent Proximal Algorithm for Regularized Nonconvex and Nonsmooth Bi-level Optimization","created":"2022-03-30","cited_by_count":7,"area":null}],"next_cursor":"100"}