{"total":217,"rows":[{"id":"2401.04056","title":"A Minimaximalist Approach to Reinforcement Learning from Human Feedback","created":"2024-01-08","cited_by_count":144,"area":"alignment"},{"id":"2209.08709","title":"BOME! Bilevel Optimization Made Easy: A Simple First-Order Approach","created":"2022-09-19","cited_by_count":105,"area":null},{"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":"2105.15186","title":"Fast Policy Extragradient Methods for Competitive Games with Entropy Regularization","created":"2021-05-31","cited_by_count":63,"area":null},{"id":"2111.01207","title":"Sig-Wasserstein GANs for Time Series Generation","created":"2021-11-01","cited_by_count":60,"area":null},{"id":"2102.08352","title":"Stochastic Variance Reduction for Variational Inequality Methods","created":"2021-02-16","cited_by_count":47,"area":null},{"id":"2103.14029","title":"Causal Inference Under Unmeasured Confounding With Negative Controls: A Minimax Learning Approach","created":"2021-03-25","cited_by_count":44,"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":"2111.06008","title":"Near-Optimal No-Regret Learning for Correlated Equilibria in Multi-Player General-Sum Games","created":"2021-11-11","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":"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":"2303.14623","title":"Inverse Reinforcement Learning without Reinforcement Learning","created":"2023-03-26","cited_by_count":36,"area":"offlinerl"},{"id":"2210.03096","title":"Accelerated Single-Call Methods for Constrained Min-Max Optimization","created":"2022-10-06","cited_by_count":32,"area":null},{"id":"2402.08848","title":"Hybrid Inverse Reinforcement Learning","created":"2024-02-13","cited_by_count":32,"area":"offlinerl"},{"id":"2102.09468","title":"Near-optimal Local Convergence of Alternating Gradient Descent-Ascent for Minimax Optimization","created":"2021-02-18","cited_by_count":31,"area":null},{"id":"2106.14326","title":"Last-iterate Convergence in Extensive-Form Games","created":"2021-06-27","cited_by_count":28,"area":null},{"id":"2106.08315","title":"Decentralized Local Stochastic Extra-Gradient for Variational Inequalities","created":"2021-06-15","cited_by_count":25,"area":null},{"id":"2205.15397","title":"Minimax Optimal Online Imitation Learning via Replay Estimation","created":"2022-05-30","cited_by_count":25,"area":"offlinerl"},{"id":"2206.03922","title":"A unified stochastic approximation framework for learning in games","created":"2022-06-08","cited_by_count":23,"area":null},{"id":"2106.08537","title":"Clustering Mixture Models in Almost-Linear Time via List-Decodable Mean Estimation","created":"2021-06-16","cited_by_count":21,"area":null},{"id":"2106.12928","title":"Exploration-Exploitation in Multi-Agent Competition: Convergence with Bounded Rationality","created":"2021-06-24","cited_by_count":21,"area":null},{"id":"2206.09495","title":"The Power of Regularization in Solving Extensive-Form Games","created":"2022-06-19","cited_by_count":21,"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":"2111.14737","title":"Beyond Time-Average Convergence: Near-Optimal Uncoupled Online Learning via Clairvoyant Multiplicative Weights Update","created":"2021-11-29","cited_by_count":20,"area":null},{"id":"2301.13306","title":"Autobidders with Budget and ROI Constraints: Efficiency, Regret, and Pacing Dynamics","created":"2023-01-30","cited_by_count":20,"area":null},{"id":"2302.01275","title":"ReLOAD: Reinforcement Learning with Optimistic Ascent-Descent for Last-Iterate Convergence in Constrained MDPs","created":"2023-02-02","cited_by_count":20,"area":null},{"id":"2104.13326","title":"Fast Distributionally Robust Learning with Variance Reduced Min-Max Optimization","created":"2021-04-27","cited_by_count":19,"area":null},{"id":"2204.09228","title":"Tight Last-Iterate Convergence of the Extragradient and the Optimistic Gradient Descent-Ascent Algorithm for Constrained Monotone Variational Inequalities","created":"2022-04-20","cited_by_count":19,"area":null},{"id":"2204.11144","title":"Competitive Physics Informed Networks","created":"2022-04-23","cited_by_count":19,"area":null},{"id":"2102.08903","title":"Provably Efficient Policy Optimization for Two-Player Zero-Sum Markov Games","created":"2021-02-17","cited_by_count":18,"area":null},{"id":"2107.00464","title":"On the Convergence of Stochastic Extragradient for Bilinear Games using Restarted Iteration Averaging","created":"2021-06-30","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":"2208.08544","title":"Estimating individual treatment effects under unobserved confounding using binary instruments","created":"2022-08-17","cited_by_count":18,"area":null},{"id":"2206.06015","title":"No-Regret Learning in Games with Noisy Feedback: Faster Rates and Adaptivity via Learning Rate Separation","created":"2022-06-13","cited_by_count":17,"area":null},{"id":"2112.15199","title":"Accelerated Primal-Dual Gradient Method for Smooth and Convex-Concave Saddle-Point Problems with Bilinear Coupling","created":"2021-12-30","cited_by_count":16,"area":null},{"id":"2202.09674","title":"Generalized Optimistic Methods for Convex-Concave Saddle Point Problems","created":"2022-02-19","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":"2402.13903","title":"Dealing with unbounded gradients in stochastic saddle-point optimization","created":"2024-02-21","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":"2110.03313","title":"Distributed Methods with Compressed Communication for Solving Variational Inequalities, with Theoretical Guarantees","created":"2021-10-07","cited_by_count":15,"area":null},{"id":"2112.02856","title":"Doubly Optimal No-Regret Online Learning in Strongly Monotone Games with Bandit Feedback","created":"2021-12-06","cited_by_count":15,"area":null},{"id":"2202.02771","title":"Optimal Algorithms for Decentralized Stochastic Variational Inequalities","created":"2022-02-06","cited_by_count":14,"area":null},{"id":"2301.11241","title":"On the Convergence of No-Regret Learning Dynamics in Time-Varying Games","created":"2023-01-26","cited_by_count":14,"area":null},{"id":"2301.13120","title":"Doubly Optimal No-Regret Learning in Monotone Games","created":"2023-01-30","cited_by_count":14,"area":null},{"id":"2305.15938","title":"First Order Methods with Markovian Noise: from Acceleration to Variational Inequalities","created":"2023-05-25","cited_by_count":14,"area":null},{"id":"2401.12033","title":"Momentum-SAM: Sharpness Aware Minimization without Computational Overhead","created":"2024-01-22","cited_by_count":14,"area":null},{"id":"2406.10631","title":"Fast Last-Iterate Convergence of Learning in Games Requires Forgetful Algorithms","created":"2024-06-15","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":"2206.04160","title":"Alternating Mirror Descent for Constrained Min-Max Games","created":"2022-06-08","cited_by_count":13,"area":null},{"id":"2302.05404","title":"Minimax Instrumental Variable Regression and $L_2$ Convergence Guarantees without Identification or Closedness","created":"2023-02-10","cited_by_count":13,"area":null},{"id":"2406.07451","title":"A Multi-Armed Bandit Approach to Online Selection and Evaluation of Generative Models","created":"2024-06-11","cited_by_count":13,"area":null},{"id":"2107.01906","title":"The Last-Iterate Convergence Rate of Optimistic Mirror Descent in Stochastic Variational Inequalities","created":"2021-07-05","cited_by_count":12,"area":null},{"id":"2212.13955","title":"Beyond the Golden Ratio for Variational Inequality Algorithms","created":"2022-12-28","cited_by_count":12,"area":null},{"id":"2511.22475","title":"Adversarial Flow Models","created":"2025-11-27","cited_by_count":12,"area":null},{"id":"2102.08431","title":"Complex Momentum for Optimization in Games","created":"2021-02-16","cited_by_count":11,"area":null},{"id":"2103.03405","title":"Learning in Matrix Games can be Arbitrarily Complex","created":"2021-03-05","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":"2410.16528","title":"ADAM-SINDy: An Efficient Optimization Framework for Parameterized Nonlinear Dynamical System Identification","created":"2024-10-21","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":"2109.14090","title":"Reversible Gromov-Monge Sampler for Simulation-Based Inference","created":"2021-09-28","cited_by_count":10,"area":null},{"id":"2111.02708","title":"Quasi-Newton Methods for Saddle Point Problems and Beyond","created":"2021-11-04","cited_by_count":10,"area":null},{"id":"2307.09470","title":"Multi-Player Zero-Sum Markov Games with Networked Separable Interactions","created":"2023-07-13","cited_by_count":10,"area":null},{"id":"2411.07007","title":"Non-Adversarial Inverse Reinforcement Learning via Successor Feature Matching","created":"2024-11-11","cited_by_count":10,"area":"offlinerl"},{"id":"2109.14213","title":"On the One-sided Convergence of Adam-type Algorithms in Non-convex Non-concave Min-max Optimization","created":"2021-09-29","cited_by_count":9,"area":null},{"id":"2205.16003","title":"Learning (Very) Simple Generative Models Is Hard","created":"2022-05-31","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":"2208.09855","title":"Last-Iterate Convergence with Full and Noisy Feedback in Two-Player Zero-Sum Games","created":"2022-08-21","cited_by_count":9,"area":null},{"id":"2301.03113","title":"Randomized Block-Coordinate Optimistic Gradient Algorithms for Root-Finding Problems","created":"2023-01-08","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":"2305.16610","title":"Adaptively Perturbed Mirror Descent for Learning in Games","created":"2023-05-26","cited_by_count":9,"area":null},{"id":"2506.01502","title":"Learning of Population Dynamics: Inverse Optimization Meets JKO Scheme","created":"2025-06-02","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":"2112.13826","title":"Last-Iterate Convergence of Saddle-Point Optimizers via High-Resolution Differential Equations","created":"2021-12-27","cited_by_count":8,"area":null},{"id":"2112.14570","title":"Lyapunov Exponents for Diversity in Differentiable Games","created":"2021-12-24","cited_by_count":8,"area":null},{"id":"2206.09254","title":"Mutation-Driven Follow the Regularized Leader for Last-Iterate Convergence in Zero-Sum Games","created":"2022-06-18","cited_by_count":8,"area":null},{"id":"2206.09446","title":"Compression and Data Similarity: Combination of Two Techniques for Communication-Efficient Solving of Distributed Variational Inequalities","created":"2022-06-19","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.17478","title":"TiAda: A Time-scale Adaptive Algorithm for Nonconvex Minimax Optimization","created":"2022-10-31","cited_by_count":8,"area":null},{"id":"2406.02016","title":"Adaptive and Optimal Second-order Optimistic Methods for Minimax Optimization","created":"2024-06-04","cited_by_count":8,"area":null},{"id":"2410.10683","title":"SAMPa: Sharpness-aware Minimization Parallelized","created":"2024-10-14","cited_by_count":8,"area":null},{"id":"2506.03464","title":"From Average-Iterate to Last-Iterate Convergence in Games: A Reduction and Its Applications","created":"2025-06-04","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":"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":"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":"2302.07615","title":"Similarity, Compression and Local Steps: Three Pillars of Efficient Communications for Distributed Variational Inequalities","created":"2023-02-15","cited_by_count":7,"area":null},{"id":"2402.12416","title":"Aligning Individual and Collective Objectives in Multi-Agent Cooperation","created":"2024-02-19","cited_by_count":7,"area":null},{"id":"2512.08176","title":"Worst-case generation via minimax optimization in Wasserstein space","created":"2025-12-09","cited_by_count":7,"area":null},{"id":"2103.08270","title":"DIPPA: An improved Method for Bilinear Saddle Point Problems","created":"2021-03-15","cited_by_count":6,"area":null},{"id":"2106.03579","title":"Forward Looking Best-Response Multiplicative Weights Update Methods for Bilinear Zero-sum Games","created":"2021-06-07","cited_by_count":6,"area":null},{"id":"2201.07206","title":"Minimax Optimality (Probably) Doesn't Imply Distribution Learning for GANs","created":"2022-01-18","cited_by_count":6,"area":null},{"id":"2210.09371","title":"On Accelerated Perceptrons and Beyond","created":"2022-10-17","cited_by_count":6,"area":null},{"id":"2304.14197","title":"Logarithmic-Regret Quantum Learning Algorithms for Zero-Sum Games","created":"2023-04-27","cited_by_count":6,"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":"2311.00676","title":"Last-Iterate Convergence Properties of Regret-Matching Algorithms in Games","created":"2023-11-01","cited_by_count":6,"area":null},{"id":"2111.01262","title":"Minimax Optimization: The Case of Convex-Submodular","created":"2021-11-01","cited_by_count":5,"area":null},{"id":"2303.17192","title":"Sublinear Convergence Rates of Extragradient-Type Methods: A Survey on Classical and Recent Developments","created":"2023-03-30","cited_by_count":5,"area":null}],"next_cursor":"100"}