{"total":28,"rows":[{"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.12928","title":"Exploration-Exploitation in Multi-Agent Competition: Convergence with Bounded Rationality","created":"2021-06-24","cited_by_count":21,"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":"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":"2102.07974","title":"Follow-the-Regularized-Leader Routes to Chaos in Routing Games","created":"2021-02-16","cited_by_count":10,"area":null},{"id":"2111.03377","title":"Online Learning in Periodic Zero-Sum Games","created":"2021-11-05","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":"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.14570","title":"Lyapunov Exponents for Diversity in Differentiable Games","created":"2021-12-24","cited_by_count":8,"area":null},{"id":"2103.00284","title":"On the Initialization for Convex-Concave Min-max Problems","created":"2021-02-27","cited_by_count":4,"area":null},{"id":"2112.11663","title":"Accelerated Proximal Alternating Gradient-Descent-Ascent for Nonconvex Minimax Machine Learning","created":"2021-12-22","cited_by_count":4,"area":null},{"id":"2203.14129","title":"Nash, Conley, and Computation: Impossibility and Incompleteness in Game Dynamics","created":"2022-03-26","cited_by_count":4,"area":null},{"id":"2106.04748","title":"Online Optimization in Games via Control Theory: Connecting Regret, Passivity and Poincar\\'e Recurrence","created":"2021-06-09","cited_by_count":3,"area":null},{"id":"2505.19537","title":"Continuous-Time Analysis of Heavy Ball Momentum in Min-Max Games","created":"2025-05-26","cited_by_count":3,"area":null},{"id":"2210.16482","title":"Recursive Reasoning in Minimax Games: A Level $k$ Gradient Play Method","created":"2022-10-29","cited_by_count":2,"area":null},{"id":"2501.17122","title":"Convergence of two-timescale gradient descent ascent dynamics: finite-dimensional and mean-field perspectives","created":"2025-01-28","cited_by_count":2,"area":null},{"id":"2506.16736","title":"Optimism Without Regularization: Constant Regret in Zero-Sum Games","created":"2025-06-20","cited_by_count":2,"area":null},{"id":"2608.24731","title":"Optimal Alternating Regret for Online Learning and Games","created":"2026-08-25","cited_by_count":2,"area":null},{"id":"2205.14232","title":"Competitive Gradient Optimization","created":"2022-05-27","cited_by_count":1,"area":null},{"id":"2109.03974","title":"Constants of Motion: The Antidote to Chaos in Optimization and Game Dynamics","created":"2021-09-08","cited_by_count":0,"area":null},{"id":"2305.17275","title":"Local Convergence of Gradient Methods for Min-Max Games: Partial Curvature Generically Suffices","created":"2023-05-26","cited_by_count":0,"area":null},{"id":"2306.01032","title":"Chaos persists in large-scale multi-agent learning despite adaptive learning rates","created":"2023-06-01","cited_by_count":0,"area":null},{"id":"2507.11366","title":"Characterizing Nash Equilibria in Zero-Sum Games: A Physics-Inspired, Parallelizable Approach with a Linear Number of Gradient Queries","created":"2025-07-15","cited_by_count":0,"area":null},{"id":"2605.19392","title":"Understanding Dynamics of Adam in Zero-Sum Games: An ODE Approach","created":"2026-05-19","cited_by_count":0,"area":null},{"id":"2606.21528","title":"Accelerated and Stable Convergence with Anchored Generalized Optimistic Method","created":"2026-06-19","cited_by_count":0,"area":null},{"id":"2608.25182","title":"Minimax Alternating Regret for the Experts Problem and Online Convex Optimization","created":"2026-08-25","cited_by_count":0,"area":null}],"next_cursor":null}