{"list":"other","total":62,"rows":[{"id":"1706.06083","title":"Towards Deep Learning Models Resistant to Adversarial Attacks","created":"2017-06-19","cited_by_count":6415},{"id":"1911.10635","title":"Multi-Agent Reinforcement Learning: A Selective Overview of Theories and Algorithms","created":"2019-11-24","cited_by_count":567},{"id":"1905.11881","title":"Why gradient clipping accelerates training: A theoretical justification for adaptivity","created":"2019-05-28","cited_by_count":341},{"id":"1311.1869","title":"Optimization, Learning, and Games with Predictable Sequences","created":"2013-11-08","cited_by_count":188},{"id":"1802.10551","title":"A Variational Inequality Perspective on Generative Adversarial Networks","created":"2018-02-28","cited_by_count":144},{"id":"1901.08511","title":"A Unified Analysis of Extra-gradient and Optimistic Gradient Methods for Saddle Point Problems: Proximal Point Approach","created":"2019-01-24","cited_by_count":143},{"id":"2002.10542","title":"Stochastic Polyak Step-size for SGD: An Adaptive Learning Rate for Fast Convergence","created":"2020-02-24","cited_by_count":137},{"id":"1807.02629","title":"Optimistic mirror descent in saddle-point problems: Going the extra (gradient) mile","created":"2018-07-07","cited_by_count":136},{"id":"1905.09997","title":"Painless Stochastic Gradient: Interpolation, Line-Search, and Convergence Rates","created":"2019-05-24","cited_by_count":119},{"id":"2011.00364","title":"Efficient Methods for Structured Nonconvex-Nonconcave Min-Max Optimization","created":"2020-10-31","cited_by_count":96},{"id":"1908.08465","title":"On the convergence of single-call stochastic extra-gradient methods","created":"2019-08-22","cited_by_count":89},{"id":"2102.07922","title":"Accelerated Algorithms for Smooth Convex-Concave Minimax Problems with $\\mathcal{O}(1/k^2)$ Rate on Squared Gradient Norm","created":"2021-02-16","cited_by_count":73},{"id":"1702.03999","title":"A First Order Method for Solving Convex Bi-Level Optimization Problems","created":"2017-02-13","cited_by_count":67},{"id":"2006.10311","title":"SGD for Structured Nonconvex Functions: Learning Rates, Minibatching and Interpolation","created":"2020-06-18","cited_by_count":67},{"id":"2206.05825","title":"A Unified Approach to Reinforcement Learning, Quantal Response Equilibria, and Two-Player Zero-Sum Games","created":"2022-06-12","cited_by_count":66},{"id":"1904.08598","title":"Reducing Noise in GAN Training with Variance Reduced Extragradient","created":"2019-04-18","cited_by_count":62},{"id":"2106.02326","title":"Fast Extra Gradient Methods for Smooth Structured Nonconvex-Nonconcave Minimax Problems","created":"2021-06-04","cited_by_count":62},{"id":"2002.08872","title":"Halpern Iteration for Near-Optimal and Parameter-Free Monotone Inclusion and Strong Solutions to Variational Inequalities","created":"2020-02-20","cited_by_count":61},{"id":"1905.00313","title":"Revisiting the Polyak step size","created":"2019-05-01","cited_by_count":55},{"id":"2003.10162","title":"Explore Aggressively, Update Conservatively: Stochastic Extragradient Methods with Variable Stepsize Scaling","created":"2020-03-23","cited_by_count":49},{"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},{"id":"2205.04583","title":"Dynamics of SGD with Stochastic Polyak Stepsizes: Truly Adaptive Variants and Convergence to Exact Solution","created":"2022-05-09","cited_by_count":40},{"id":"2110.04261","title":"Extragradient Method: $O(1/K)$ Last-Iterate Convergence for Monotone Variational Inequalities and Connections With Cocoercivity","created":"2021-10-08","cited_by_count":39},{"id":"1905.11373","title":"Revisiting Stochastic Extragradient","created":"2019-05-27","cited_by_count":35},{"id":"2205.08446","title":"Last-Iterate Convergence of Optimistic Gradient Method for Monotone Variational Inequalities","created":"2022-05-17","cited_by_count":33},{"id":"2007.04202","title":"Stochastic Hamiltonian Gradient Methods for Smooth Games","created":"2020-07-08","cited_by_count":32},{"id":"2210.03096","title":"Accelerated Single-Call Methods for Constrained Min-Max Optimization","created":"2022-10-06","cited_by_count":32},{"id":"2111.08611","title":"Stochastic Extragradient: General Analysis and Improved Rates","created":"2021-11-16","cited_by_count":31},{"id":"2010.12100","title":"Adaptive extra-gradient methods for min-max optimization and games","created":"2020-10-22","cited_by_count":30},{"id":"1311.2776","title":"On the Convergence Properties of Non-Euclidean Extragradient Methods for Variational Inequalities with Generalized Monotone Operators","created":"2013-11-12","cited_by_count":29},{"id":"2110.15412","title":"Stochastic Mirror Descent: Convergence Analysis and Adaptive Variants via the Mirror Stochastic Polyak Stepsize","created":"2021-10-28","cited_by_count":22},{"id":"2110.08150","title":"Halpern-Type Accelerated and Splitting Algorithms For Monotone Inclusions","created":"2021-10-15","cited_by_count":21},{"id":"2302.09831","title":"Escaping limit cycles: Global convergence for constrained nonconvex-nonconcave minimax problems","created":"2023-02-20","cited_by_count":21},{"id":"2203.04869","title":"From Halpern's Fixed-Point Iterations to Nesterov's Accelerated Interpretations for Root-Finding Problems","created":"2022-03-09","cited_by_count":20},{"id":"2208.05925","title":"Near-Optimal Algorithms for Making the Gradient Small in Stochastic Minimax Optimization","created":"2022-08-11","cited_by_count":20},{"id":"1410.1628","title":"Optimal stochastic extragradient schemes for pseudomonotone stochastic variational inequality problems and their variants","created":"2014-10-07","cited_by_count":19},{"id":"2106.11851","title":"Stochastic Polyak Stepsize with a Moving Target","created":"2021-06-22","cited_by_count":19},{"id":"2203.09436","title":"Stochastic Halpern Iteration with Variance Reduction for Stochastic Monotone Inclusions","created":"2022-03-17","cited_by_count":19},{"id":"2210.13831","title":"Convergence of Proximal Point and Extragradient-Based Methods Beyond Monotonicity: the Case of Negative Comonotonicity","created":"2022-10-25","cited_by_count":16},{"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},{"id":"2406.04142","title":"Stochastic Polyak Step-sizes and Momentum: Convergence Guarantees and Practical Performance","created":"2024-06-06","cited_by_count":13},{"id":"2108.10969","title":"Optimal error bounds for nonexpansive fixed-point iterations in normed spaces","created":"2021-08-24","cited_by_count":12},{"id":"2310.02987","title":"Variance Reduced Halpern Iteration for Finite-Sum Monotone Inclusions","created":"2023-10-04","cited_by_count":11},{"id":"2203.10947","title":"Fast Optimistic Gradient Descent Ascent (OGDA) method in continuous and discrete time","created":"2022-03-21","cited_by_count":10},{"id":"2205.11093","title":"Accelerated Minimax Algorithms Flock Together","created":"2022-05-23","cited_by_count":9},{"id":"2301.03113","title":"Randomized Block-Coordinate Optimistic Gradient Algorithms for Root-Finding Problems","created":"2023-01-08","cited_by_count":9},{"id":"2404.13228","title":"Optimal Acceleration for Minimax and Fixed-Point Problems is Not Unique","created":"2024-04-20","cited_by_count":7},{"id":"1610.08195","title":"On stochastic mirror-prox algorithms for stochastic Cartesian variational inequalities: randomized block coordinate and optimal averaging schemes","created":"2016-10-26","cited_by_count":5},{"id":"2504.01898","title":"Analysis of an Idealized Stochastic Polyak Method and its Application to Black-Box Model Distillation","created":"2025-04-02","cited_by_count":5},{"id":"2605.02231","title":"A Theory of Composition and Duality of Extremal Optimal Fixed-Point Algorithms","created":"2026-05-04","cited_by_count":5},{"id":"1908.07449","title":"Nonlinear Forward-Backward Splitting with Projection Correction","created":"2019-08-20","cited_by_count":4},{"id":"2608.12043","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","created":"2026-08-12","cited_by_count":4},{"id":"2307.11281","title":"A Fast Optimistic Method for Monotone Variational Inequalities","created":"2023-07-21","cited_by_count":3},{"id":"2406.02413","title":"Variance-Reduced Fast Krasnoselkii-Mann Methods for Finite-Sum Root-Finding Problems","created":"2024-06-04","cited_by_count":3},{"id":"2510.22421","title":"Extragradient Method for $(L_0, L_1)$-Lipschitz Root-finding Problems","created":"2025-10-25","cited_by_count":3},{"id":"2511.14915","title":"H-invariance theory: A complete characterization of minimax optimal fixed-point algorithms","created":"2025-11-18","cited_by_count":3},{"id":"2510.16468","title":"Frank-Wolfe Algorithms for (L0, L1)-smooth functions","created":"2025-10-18","cited_by_count":2},{"id":"2511.07767","title":"Taking the Road Less Scheduled with Adaptive Polyak Steps","created":"2025-11-11","cited_by_count":2},{"id":"2512.02342","title":"Safeguarded Stochastic Polyak Step Sizes for Non-smooth Optimization: Robust Performance Without Small (Sub)Gradients","created":"2025-12-02","cited_by_count":2},{"id":"2407.17519","title":"Universal methods for variational inequalities: deterministic and stochastic cases","created":"2024-07-17","cited_by_count":1},{"id":"2606.01827","title":"Adaptive Sharpness-Aware Minimization with a Polyak-type Step size: A Theory-Grounded Scheduler","created":"2026-06-01","cited_by_count":1},{"id":"2606.22392","title":"Convergence Rates of Tseng's Splitting Method and Its Acceleration Schemes for Monotone Inclusion Problem with a Sum of H\\\"older Continuous Operators","created":"2026-06-21","cited_by_count":1}],"next_cursor":null}