{"total":18,"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":"2306.04923","title":"Unconstrained Online Learning with Unbounded Losses","created":"2023-06-08","cited_by_count":25,"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":"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":"2201.07427","title":"Lifted Primal-Dual Method for Bilinearly Coupled Smooth Minimax Optimization","created":"2022-01-19","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":"2505.01423","title":"Negative Stepsizes Make Gradient-Descent-Ascent Converge","created":"2025-05-02","cited_by_count":11,"area":null},{"id":"2208.13592","title":"Smooth Monotone Stochastic Variational Inequalities and Saddle Point Problems: A Survey","created":"2022-08-29","cited_by_count":10,"area":null},{"id":"2402.10475","title":"Fundamental Benefit of Alternating Updates in Minimax Optimization","created":"2024-02-16","cited_by_count":9,"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":"2103.00284","title":"On the Initialization for Convex-Concave Min-max Problems","created":"2021-02-27","cited_by_count":4,"area":null},{"id":"2206.08573","title":"Optimal Extragradient-Based Bilinearly-Coupled Saddle-Point Optimization","created":"2022-06-17","cited_by_count":4,"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.17550","title":"Nesterov Meets Optimism: Rate-Optimal Separable Minimax Optimization","created":"2022-10-31","cited_by_count":2,"area":null},{"id":"2211.04659","title":"When is Momentum Extragradient Optimal? A Polynomial-Based Analysis","created":"2022-11-09","cited_by_count":1,"area":null},{"id":"2511.03052","title":"Min-Max Optimization Is Strictly Easier Than Variational Inequalities","created":"2025-11-04","cited_by_count":1,"area":null},{"id":"2110.02457","title":"GDA-AM: On the effectiveness of solving minimax optimization via Anderson Acceleration","created":"2021-10-06","cited_by_count":0,"area":null},{"id":"2501.14652","title":"Decoupled SGDA for Games with Intermittent Strategy Communication","created":"2025-01-24","cited_by_count":0,"area":null}],"next_cursor":null}