{"total":76,"rows":[{"id":"2201.12091","title":"Linear Adversarial Concept Erasure","created":"2022-01-28","cited_by_count":101,"area":null},{"id":"2309.01753","title":"On Penalty Methods for Nonconvex Bilevel Optimization and First-Order Stochastic Approximation","created":"2023-09-04","cited_by_count":51,"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":"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":"2302.04451","title":"Generalization in Graph Neural Networks: Improved PAC-Bayesian Bounds on Graph Diffusion","created":"2023-02-09","cited_by_count":40,"area":null},{"id":"2202.07262","title":"Stochastic Gradient Descent-Ascent: Unified Theory and New Efficient Methods","created":"2022-02-15","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":"2104.08708","title":"Complexity Lower Bounds for Nonconvex-Strongly-Concave Min-Max Optimization","created":"2021-04-18","cited_by_count":36,"area":null},{"id":"2210.03096","title":"Accelerated Single-Call Methods for Constrained Min-Max Optimization","created":"2022-10-06","cited_by_count":32,"area":null},{"id":"2111.08611","title":"Stochastic Extragradient: General Analysis and Improved Rates","created":"2021-11-16","cited_by_count":31,"area":null},{"id":"2306.11700","title":"Last-Iterate Convergent Policy Gradient Primal-Dual Methods for Constrained MDPs","created":"2023-06-20","cited_by_count":28,"area":null},{"id":"2402.01704","title":"Steering Language Models with Game-Theoretic Solvers","created":"2024-01-24","cited_by_count":28,"area":null},{"id":"2302.09029","title":"Solving stochastic weak Minty variational inequalities without increasing batch size","created":"2023-02-17","cited_by_count":21,"area":null},{"id":"2302.09831","title":"Escaping limit cycles: Global convergence for constrained nonconvex-nonconcave minimax problems","created":"2023-02-20","cited_by_count":21,"area":null},{"id":"2206.05248","title":"Accelerated Algorithms for Constrained Nonconvex-Nonconcave Min-Max Optimization and Comonotone Inclusion","created":"2022-06-10","cited_by_count":20,"area":null},{"id":"2410.23126","title":"Provably Optimal Memory Capacity for Modern Hopfield Models: Transformer-Compatible Dense Associative Memories as Spherical Codes","created":"2024-10-30","cited_by_count":19,"area":null},{"id":"2109.06795","title":"ROMAX: Certifiably Robust Deep Multiagent Reinforcement Learning via Convex Relaxation","created":"2021-09-14","cited_by_count":17,"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":"2104.05605","title":"Understanding Overparameterization in Generative Adversarial Networks","created":"2021-04-12","cited_by_count":14,"area":null},{"id":"2206.01095","title":"Clipped Stochastic Methods for Variational Inequalities with Heavy-Tailed Noise","created":"2022-06-02","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":"2306.00212","title":"Provably Efficient Generalized Lagrangian Policy Optimization for Safe Multi-Agent Reinforcement Learning","created":"2023-05-31","cited_by_count":14,"area":null},{"id":"2306.08553","title":"Noise Stability Optimization for Finding Flat Minima: A Hessian-based Regularization Approach","created":"2023-06-14","cited_by_count":14,"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":"2211.03413","title":"Max-Min Off-Policy Actor-Critic Method Focusing on Worst-Case Robustness to Model Misspecification","created":"2022-11-07","cited_by_count":11,"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":"2110.05192","title":"Convex-Concave Min-Max Stackelberg Games","created":"2021-10-05","cited_by_count":9,"area":null},{"id":"2202.06950","title":"Sion's Minimax Theorem in Geodesic Metric Spaces and a Riemannian Extragradient Algorithm","created":"2022-02-13","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":"2403.11844","title":"Near-Optimal Solutions of Constrained Learning Problems","created":"2024-03-18","cited_by_count":9,"area":null},{"id":"2101.05248","title":"Solving Min-Max Optimization with Hidden Structure via Gradient Descent Ascent","created":"2021-01-13","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":"2110.03950","title":"Nonconvex-Nonconcave Min-Max Optimization with a Small Maximization Domain","created":"2021-10-08","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":"2305.17342","title":"Rethinking Adversarial Policies: A Generalized Attack Formulation and Provable Defense in RL","created":"2023-05-27","cited_by_count":7,"area":null},{"id":"2306.16502","title":"Stochastic Methods in Variational Inequalities: Ergodicity, Bias and Refinements","created":"2023-06-28","cited_by_count":6,"area":null},{"id":"2203.14126","title":"Robust No-Regret Learning in Min-Max Stackelberg Games","created":"2022-03-26","cited_by_count":5,"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":"2309.09457","title":"Exploring and Learning in Sparse Linear MDPs without Computationally Intractable Oracles","created":"2023-09-18","cited_by_count":5,"area":null},{"id":"2502.18605","title":"Expected Variational Inequalities","created":"2025-02-25","cited_by_count":5,"area":null},{"id":"2210.09769","title":"STay-ON-the-Ridge: Guaranteed Convergence to Local Minimax Equilibrium in Nonconvex-Nonconcave Games","created":"2022-10-18","cited_by_count":4,"area":null},{"id":"2306.05100","title":"Communication-Efficient Gradient Descent-Accent Methods for Distributed Variational Inequalities: Unified Analysis and Local Updates","created":"2023-06-08","cited_by_count":4,"area":null},{"id":"2312.03259","title":"f-FERM: A Scalable Framework for Robust Fair Empirical Risk Minimization","created":"2023-12-06","cited_by_count":4,"area":null},{"id":"2402.05071","title":"Revisiting Inexact Fixed-Point Iterations for Min-Max Problems: Stochasticity and Structured Nonconvexity","created":"2024-02-07","cited_by_count":4,"area":null},{"id":"2406.02357","title":"The complexity of approximate (coarse) correlated equilibrium for incomplete information games","created":"2024-06-04","cited_by_count":4,"area":null},{"id":"2205.10146","title":"Revisiting GANs by Best-Response Constraint: Perspective, Methodology, and Application","created":"2022-05-20","cited_by_count":3,"area":null},{"id":"2312.16609","title":"Exploiting hidden structures in non-convex games for convergence to Nash equilibrium","created":"2023-12-27","cited_by_count":3,"area":null},{"id":"2202.06460","title":"Simultaneous Transport Evolution for Minimax Equilibria on Measures","created":"2022-02-14","cited_by_count":2,"area":null},{"id":"2303.00970","title":"PAPAL: A Provable PArticle-based Primal-Dual ALgorithm for Mixed Nash Equilibrium","created":"2023-03-02","cited_by_count":2,"area":null},{"id":"2304.12768","title":"Towards Characterizing the First-order Query Complexity of Learning (Approximate) Nash Equilibria in Zero-sum Matrix Games","created":"2023-04-25","cited_by_count":2,"area":null},{"id":"2306.16617","title":"Last-Iterate Convergence of Adaptive Riemannian Gradient Descent for Equilibrium Computation","created":"2023-06-29","cited_by_count":2,"area":null},{"id":"2310.09157","title":"The Computational Complexity of Finding Stationary Points in Non-Convex Optimization","created":"2023-10-13","cited_by_count":2,"area":null},{"id":"2312.12067","title":"Optimistic Policy Gradient in Multi-Player Markov Games with a Single Controller: Convergence Beyond the Minty Property","created":"2023-12-19","cited_by_count":2,"area":null},{"id":"2401.14585","title":"Diffusion Stochastic Optimization for Min-Max Problems","created":"2024-01-26","cited_by_count":2,"area":null},{"id":"2406.13041","title":"Accelerated Stochastic Min-Max Optimization Based on Bias-corrected Momentum","created":"2024-06-18","cited_by_count":2,"area":null},{"id":"2111.04178","title":"Towards convergence to Nash equilibria in two-team zero-sum games","created":"2021-11-07","cited_by_count":1,"area":null},{"id":"2304.08389","title":"Beyond first-order methods for non-convex non-concave min-max optimization","created":"2023-04-17","cited_by_count":1,"area":null},{"id":"2309.11682","title":"Dr. FERMI: A Stochastic Distributionally Robust Fair Empirical Risk Minimization Framework","created":"2023-09-20","cited_by_count":1,"area":null},{"id":"2406.02939","title":"Achieving Near-Optimal Convergence for Distributed Minimax Optimization with Adaptive Stepsizes","created":"2024-06-05","cited_by_count":1,"area":null},{"id":"2411.02654","title":"Fair and Welfare-Efficient Constrained Multi-matchings under Uncertainty","created":"2024-11-04","cited_by_count":1,"area":null},{"id":"2411.05228","title":"Solving Hidden Monotone Variational Inequalities with Surrogate Losses","created":"2024-11-07","cited_by_count":1,"area":null},{"id":"2501.10884","title":"Fixed Point Computation: Beating Brute Force with Smoothed Analysis","created":"2025-01-18","cited_by_count":1,"area":null},{"id":"2604.10373","title":"Shuffling the Data, Stretching the Step-size: Sharper Bias in constant step-size SGD","created":"2026-04-11","cited_by_count":1,"area":null},{"id":"2605.13806","title":"Min-Max Optimization Requires Exponentially Many Queries","created":"2026-05-13","cited_by_count":1,"area":null},{"id":"2605.20797","title":"Beyond Numerical Features: CNN-Driven Algorithm Selection via Contour Plots for Continuous Black-Box Optimization","created":"2026-05-20","cited_by_count":1,"area":null},{"id":"2606.17000","title":"The Complexity of Min-Max Optimization for Quadratic Polynomials","created":"2026-06-15","cited_by_count":1,"area":null},{"id":"2206.15177","title":"Large deviations for interacting particle dynamics for finding mixed equilibria in zero-sum games","created":"2022-06-30","cited_by_count":0,"area":null},{"id":"2310.19220","title":"From Stream to Pool: Pricing Under the Law of Diminishing Marginal Utility","created":"2023-10-30","cited_by_count":0,"area":null},{"id":"2507.13841","title":"The Challenge and Reward of Fair Play in Narrative: A Computational Approach","created":"2025-07-18","cited_by_count":0,"area":null},{"id":"2509.14032","title":"Nash Equilibria in Games with Playerwise Concave Coupling Constraints: Existence and Computation","created":"2025-09-17","cited_by_count":0,"area":null},{"id":"2602.01564","title":"Local exponential stability of mean-field Langevin descent-ascent and associated particle system","created":"2026-02-02","cited_by_count":0,"area":null},{"id":"2603.00027","title":"Bilevel Optimization with Lower-Level Uniform Convexity: Theory and Algorithm","created":"2026-02-04","cited_by_count":0,"area":null},{"id":"2610.07814","title":"Stochastic Gradient Descent Ascent is Suboptimal for Nonconvex-P{\\L} Min-Max Games","created":"2026-10-06","cited_by_count":0,"area":null}],"next_cursor":null}