{"list":"other","total":59,"rows":[{"id":"1706.06083","title":"Towards Deep Learning Models Resistant to Adversarial Attacks","created":"2017-06-19","cited_by_count":6415},{"id":"1905.13655","title":"Implicit Regularization in Deep Matrix Factorization","created":"2019-05-31","cited_by_count":405},{"id":"1906.00331","title":"On Gradient Descent Ascent for Nonconvex-Concave Minimax Problems","created":"2019-06-02","cited_by_count":270},{"id":"1901.09401","title":"SGD: General Analysis and Improved Rates","created":"2019-01-27","cited_by_count":207},{"id":"1802.10551","title":"A Variational Inequality Perspective on Generative Adversarial Networks","created":"2018-02-28","cited_by_count":144},{"id":"1810.07288","title":"Fast and Faster Convergence of SGD for Over-Parameterized Models and an Accelerated Perceptron","created":"2018-10-16","cited_by_count":143},{"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":"2007.13544","title":"Combining Deep Reinforcement Learning and Search for Imperfect-Information Games","created":"2020-07-27","cited_by_count":114},{"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":"1907.04232","title":"Unified Optimal Analysis of the (Stochastic) Gradient Method","created":"2019-07-09","cited_by_count":82},{"id":"2009.09623","title":"The Complexity of Constrained Min-Max Optimization","created":"2020-09-21","cited_by_count":82},{"id":"1608.07310","title":"Learning in games with continuous action sets and unknown payoff functions","created":"2016-08-25","cited_by_count":81},{"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":"2106.02326","title":"Fast Extra Gradient Methods for Smooth Structured Nonconvex-Nonconcave Minimax Problems","created":"2021-06-04","cited_by_count":62},{"id":"1712.09677","title":"Momentum and Stochastic Momentum for Stochastic Gradient, Newton, Proximal Point and Subspace Descent Methods","created":"2017-12-27","cited_by_count":49},{"id":"2003.10162","title":"Explore Aggressively, Update Conservatively: Stochastic Extragradient Methods with Variable Stepsize Scaling","created":"2020-03-23","cited_by_count":49},{"id":"2010.13724","title":"Tight last-iterate convergence rates for no-regret learning in multi-player games","created":"2020-10-26","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":"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":"2202.07262","title":"Stochastic Gradient Descent-Ascent: Unified Theory and New Efficient Methods","created":"2022-02-15","cited_by_count":37},{"id":"2006.11573","title":"Unified Analysis of Stochastic Gradient Methods for Composite Convex and Smooth Optimization","created":"2020-06-20","cited_by_count":36},{"id":"1905.11373","title":"Revisiting Stochastic Extragradient","created":"2019-05-27","cited_by_count":35},{"id":"1810.10207","title":"First-order Convergence Theory for Weakly-Convex-Weakly-Concave Min-max Problems","created":"2018-10-24","cited_by_count":34},{"id":"1906.03563","title":"Adversarial Attack Generation Empowered by Min-Max Optimization","created":"2019-06-09","cited_by_count":32},{"id":"2007.04202","title":"Stochastic Hamiltonian Gradient Methods for Smooth Games","created":"2020-07-08","cited_by_count":32},{"id":"2110.03300","title":"Permutation Compressors for Provably Faster Distributed Nonconvex Optimization","created":"2021-10-07","cited_by_count":32},{"id":"2111.08611","title":"Stochastic Extragradient: General Analysis and Improved Rates","created":"2021-11-16","cited_by_count":31},{"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":"1912.11940","title":"Towards Better Understanding of Adaptive Gradient Algorithms in Generative Adversarial Nets","created":"2019-12-26","cited_by_count":29},{"id":"2103.04410","title":"Optimistic Dual Extrapolation for Coherent Non-monotone Variational Inequalities","created":"2021-03-07","cited_by_count":29},{"id":"1902.09827","title":"Generalized monotone operators and their averaged resolvents","created":"2019-02-26","cited_by_count":27},{"id":"2201.12247","title":"Solving Nonconvex-Nonconcave Min-Max Problems exhibiting Weak Minty Solutions","created":"2022-01-28","cited_by_count":27},{"id":"1802.05074","title":"L4: Practical loss-based stepsize adaptation for deep learning","created":"2018-02-14","cited_by_count":26},{"id":"2002.09806","title":"Finite-Time Last-Iterate Convergence for Multi-Agent Learning in Games","created":"2020-02-23","cited_by_count":26},{"id":"1906.02027","title":"Last-iterate convergence rates for min-max optimization","created":"2019-06-05","cited_by_count":25},{"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":"2302.09029","title":"Solving stochastic weak Minty variational inequalities without increasing batch size","created":"2023-02-17","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":"2104.13326","title":"Fast Distributionally Robust Learning with Variance Reduced Min-Max Optimization","created":"2021-04-27","cited_by_count":19},{"id":"1905.10899","title":"ODE Analysis of Stochastic Gradient Methods with Optimism and Anchoring for Minimax Problems","created":"2019-05-26","cited_by_count":18},{"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},{"id":"1706.01108","title":"Stochastic Reformulations of Linear Systems: Algorithms and Convergence Theory","created":"2017-06-04","cited_by_count":16},{"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":"1310.3438","title":"On Optimal Probabilities in Stochastic Coordinate Descent Methods","created":"2013-10-13","cited_by_count":14},{"id":"1412.8060","title":"Coordinate Descent with Arbitrary Sampling I: Algorithms and Complexity","created":"2014-12-27","cited_by_count":14},{"id":"1809.04146","title":"Nonconvex Variance Reduced Optimization with Arbitrary Sampling","created":"2018-09-11","cited_by_count":14},{"id":"1809.09354","title":"Accelerated Coordinate Descent with Arbitrary Sampling and Best Rates for Minibatches","created":"2018-09-25","cited_by_count":11},{"id":"1901.08669","title":"SAGA with Arbitrary Sampling","created":"2019-01-24","cited_by_count":10},{"id":"2208.13592","title":"Smooth Monotone Stochastic Variational Inequalities and Saddle Point Problems: A Survey","created":"2022-08-29","cited_by_count":10},{"id":"1903.07971","title":"Convergence Analysis of Inexact Randomized Iterative Methods","created":"2019-03-19","cited_by_count":8},{"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},{"id":"1908.02725","title":"Towards closing the gap between the theory and practice of SVRG","created":"2019-07-31","cited_by_count":6},{"id":"1905.08645","title":"Revisiting Randomized Gossip Algorithms: General Framework, Convergence Rates and Novel Block and Accelerated Protocols","created":"2019-05-20","cited_by_count":5},{"id":"1610.04714","title":"A New Perspective on Randomized Gossip Algorithms","created":"2016-10-15","cited_by_count":4}],"next_cursor":null}