{"total":59,"rows":[{"id":"2103.15888","title":"The Complexity of Nonconvex-Strongly-Concave Minimax Optimization","created":"2021-03-29","cited_by_count":45,"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":"2110.08150","title":"Halpern-Type Accelerated and Splitting Algorithms For Monotone Inclusions","created":"2021-10-15","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":"2203.09436","title":"Stochastic Halpern Iteration with Variance Reduction for Stochastic Monotone Inclusions","created":"2022-03-17","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":"2504.09951","title":"Towards Weaker Variance Assumptions for Stochastic Optimization","created":"2025-04-14","cited_by_count":17,"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":"2202.04640","title":"Sharper Rates for Separable Minimax and Finite Sum Optimization via Primal-Dual Extragradient Methods","created":"2022-02-09","cited_by_count":15,"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.16569","title":"Accelerating Value Iteration with Anchoring","created":"2023-05-26","cited_by_count":11,"area":null},{"id":"2310.02987","title":"Variance Reduced Halpern Iteration for Finite-Sum Monotone Inclusions","created":"2023-10-04","cited_by_count":11,"area":null},{"id":"2102.13643","title":"Variance Reduction via Primal-Dual Accelerated Dual Averaging for Nonsmooth Convex Finite-Sums","created":"2021-02-26","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":"2204.03132","title":"First-Order Algorithms for Nonlinear Generalized Nash Equilibrium Problems","created":"2022-04-07","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":"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":"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":"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},{"id":"2411.04845","title":"Asymptotic regularity of a generalised stochastic Halpern scheme","created":"2024-11-07","cited_by_count":5,"area":null},{"id":"2501.08263","title":"Multiplayer Federated Learning: Reaching Equilibrium with Less Communication","created":"2025-01-14","cited_by_count":5,"area":null},{"id":"2604.16620","title":"Lower Bounds and Proximally Anchored SGD for Non-Convex Minimization Under Unbounded Variance","created":"2026-04-17","cited_by_count":5,"area":null},{"id":"2101.12101","title":"Potential Function-based Framework for Making the Gradients Small in Convex and Min-Max Optimization","created":"2021-01-28","cited_by_count":4,"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":"2301.03931","title":"Min-Max Optimization Made Simple: Approximating the Proximal Point Method via Contraction Maps","created":"2023-01-10","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":"2608.12043","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","created":"2026-08-12","cited_by_count":4,"area":null},{"id":"2206.10575","title":"Solving Constrained Variational Inequalities via a First-order Interior Point-based Method","created":"2022-06-21","cited_by_count":3,"area":null},{"id":"2310.13459","title":"Stable Nonconvex-Nonconcave Training via Linear Interpolation","created":"2023-10-20","cited_by_count":3,"area":null},{"id":"2403.12859","title":"Primal Methods for Variational Inequality Problems with Functional Constraints","created":"2024-03-19","cited_by_count":3,"area":null},{"id":"2406.02413","title":"Variance-Reduced Fast Krasnoselkii-Mann Methods for Finite-Sum Root-Finding Problems","created":"2024-06-04","cited_by_count":3,"area":null},{"id":"2510.22421","title":"Extragradient Method for $(L_0, L_1)$-Lipschitz Root-finding Problems","created":"2025-10-25","cited_by_count":3,"area":null},{"id":"2604.03782","title":"An Improved Last-Iterate Convergence Rate for Anchored Gradient Descent Ascent","created":"2026-04-04","cited_by_count":3,"area":null},{"id":"2607.09097","title":"Solving Stochastic Fixed-Point Equations with High Probability","created":"2026-07-10","cited_by_count":3,"area":null},{"id":"2402.06033","title":"An Inexact Halpern Iteration with Application to Distributionally Robust Optimization","created":"2024-02-08","cited_by_count":2,"area":null},{"id":"2601.20180","title":"On the Computational Complexity of Performative Prediction","created":"2026-01-28","cited_by_count":2,"area":null},{"id":"2609.08380","title":"How to Make the Gradient Mapping Small for Constrained Stochastic Min-Max Problems and Beyond","created":"2026-09-08","cited_by_count":2,"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":"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":"2512.13547","title":"A Class of Accelerated Fixed-Point-Based Methods with Delayed Inexact Oracles and Its Applications","created":"2025-12-15","cited_by_count":1,"area":null},{"id":"2603.22155","title":"RAMPAGE: RAndomized Mid-Point for debiAsed Gradient Extrapolation","created":"2026-03-23","cited_by_count":1,"area":null},{"id":"2608.08463","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","created":"2026-08-09","cited_by_count":1,"area":null},{"id":"2608.15966","title":"A Banach-Space Theory of Markovian Halpern Iteration for Non-Expansive Maps","created":"2026-08-16","cited_by_count":1,"area":null},{"id":"2302.04099","title":"Extragradient-Type Methods with $\\mathcal{O} (1/k)$ Last-Iterate Convergence Rates for Co-Hypomonotone Inclusions","created":"2023-02-08","cited_by_count":0,"area":null},{"id":"2304.04778","title":"First-order methods for Stochastic Variational Inequality problems with Function Constraints","created":"2023-04-10","cited_by_count":0,"area":null},{"id":"2407.13120","title":"HPPP: Halpern-type Preconditioned Proximal Point Algorithms and Applications to Image Restoration","created":"2024-07-18","cited_by_count":0,"area":null},{"id":"2509.21653","title":"A regret minimization approach to fixed-point iterations","created":"2025-09-25","cited_by_count":0,"area":null},{"id":"2601.18409","title":"Frequency-Based Hyperparameter Selection in Games","created":"2026-01-26","cited_by_count":0,"area":null},{"id":"2603.29128","title":"Adaptive Delayed-Update Cyclic Algorithm for Variational Inequalities","created":"2026-03-31","cited_by_count":0,"area":null},{"id":"2605.30905","title":"A Unifying View of Anchoring via Operator-Side Tikhonov Regularization","created":"2026-05-29","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.06182","title":"On Same-Sample and Independent-Sample Stochastic Extragradient for Monotone Variational Inequalities","created":"2026-08-06","cited_by_count":0,"area":null},{"id":"2608.09022","title":"Provable Parameter-Free Fixed-Point Algorithms with Linear Convergence Rates","created":"2026-08-10","cited_by_count":0,"area":null},{"id":"2609.09524","title":"Oracle Complexity of Stochastic Fixed-Point Equations with Nonexpansive Maps","created":"2026-09-08","cited_by_count":0,"area":null},{"id":"2609.23557","title":"Optimal High-Order Methods for Solving Monotone Variational Inequalities","created":"2026-09-20","cited_by_count":0,"area":null},{"id":"2609.26581","title":"Polyak-Type Extragradient Methods for Monotone Root-Finding Problems","created":"2026-09-22","cited_by_count":0,"area":null},{"id":"2609.36033","title":"Dual-Anchor Acceleration Is Near-Optimal for Stochastic Monotone Root-Finding","created":"2026-09-28","cited_by_count":0,"area":null},{"id":"2610.05038","title":"Optimal Oracle Complexity for Finite-Sum Monotone Inclusions","created":"2026-10-04","cited_by_count":0,"area":null}],"next_cursor":null}