{"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":"1704.00028","title":"Improved Training of Wasserstein GANs","created":"2017-03-31","cited_by_count":2235},{"id":"1901.08573","title":"Theoretically Principled Trade-off between Robustness and Accuracy","created":"2019-01-24","cited_by_count":1517},{"id":"2010.01412","title":"Sharpness-Aware Minimization for Efficiently Improving Generalization","created":"2020-10-03","cited_by_count":1417},{"id":"1911.08731","title":"Distributionally Robust Neural Networks for Group Shifts: On the Importance of Regularization for Worst-Case Generalization","created":"2019-11-20","cited_by_count":1247},{"id":"1801.07593","title":"Mitigating Unwanted Biases with Adversarial Learning","created":"2018-01-22","cited_by_count":663},{"id":"1608.04636","title":"Linear Convergence of Gradient and Proximal-Gradient Methods Under the Polyak-\\L{}ojasiewicz Condition","created":"2016-08-16","cited_by_count":539},{"id":"1606.00709","title":"f-GAN: Training Generative Neural Samplers using Variational Divergence Minimization","created":"2016-06-02","cited_by_count":506},{"id":"2002.11569","title":"Overfitting in adversarially robust deep learning","created":"2020-02-26","cited_by_count":506},{"id":"1710.10571","title":"Certifying Some Distributional Robustness with Principled Adversarial Training","created":"2017-10-29","cited_by_count":337},{"id":"1906.00331","title":"On Gradient Descent Ascent for Nonconvex-Concave Minimax Problems","created":"2019-06-02","cited_by_count":270},{"id":"1805.11202","title":"FairGAN: Fairness-aware Generative Adversarial Networks","created":"2018-05-28","cited_by_count":164},{"id":"1803.06523","title":"Stochastic model-based minimization of weakly convex functions","created":"2018-03-17","cited_by_count":159},{"id":"1902.08297","title":"Solving a Class of Non-Convex Min-Max Games Using Iterative First Order Methods","created":"2019-02-21","cited_by_count":148},{"id":"2002.02417","title":"Near-Optimal Algorithms for Minimax Optimization","created":"2020-02-05","cited_by_count":119},{"id":"1705.10461","title":"The Numerics of GANs","created":"2017-05-30","cited_by_count":105},{"id":"1807.04252","title":"Last-Iterate Convergence: Zero-Sum Games and Constrained Min-Max Optimization","created":"2018-07-11","cited_by_count":98},{"id":"2011.00364","title":"Efficient Methods for Structured Nonconvex-Nonconcave Min-Max Optimization","created":"2020-10-31","cited_by_count":96},{"id":"2009.09623","title":"The Complexity of Constrained Min-Max Optimization","created":"2020-09-21","cited_by_count":82},{"id":"1907.01543","title":"Efficient Algorithms for Smooth Minimax Optimization","created":"2019-07-02","cited_by_count":76},{"id":"1802.06132","title":"Interaction Matters: A Note on Non-asymptotic Local Convergence of Generative Adversarial Networks","created":"2018-02-16","cited_by_count":68},{"id":"1810.02060","title":"Weakly-Convex Concave Min-Max Optimization: Provable Algorithms and Applications in Machine Learning","created":"2018-10-04","cited_by_count":63},{"id":"2002.00057","title":"Last Iterate is Slower than Averaged Iterate in Smooth Convex-Concave Saddle Point Problems","created":"2020-01-31","cited_by_count":60},{"id":"2010.15768","title":"A Single-Loop Smoothed Gradient Descent-Ascent Algorithm for Nonconvex-Concave Min-Max Problems","created":"2020-10-29","cited_by_count":58},{"id":"1902.08294","title":"Hybrid Block Successive Approximation for One-Sided Non-Convex Min-Max Problems: Algorithms and Applications","created":"2019-02-21","cited_by_count":55},{"id":"1802.08249","title":"On the Convergence and Robustness of Training GANs with Regularized Optimal Transport","created":"2018-02-22","cited_by_count":51},{"id":"2006.09065","title":"The limits of min-max optimization algorithms: convergence to spurious non-critical sets","created":"2020-06-16","cited_by_count":50},{"id":"2103.15888","title":"The Complexity of Nonconvex-Strongly-Concave Minimax Optimization","created":"2021-03-29","cited_by_count":45},{"id":"2002.07919","title":"Efficient Search of First-Order Nash Equilibria in Nonconvex-Concave Smooth Min-Max Problems","created":"2020-02-18","cited_by_count":39},{"id":"2006.08141","title":"Non-convex Min-Max Optimization: Applications, Challenges, and Recent Theoretical Advances","created":"2020-06-15","cited_by_count":38},{"id":"2104.08708","title":"Complexity Lower Bounds for Nonconvex-Strongly-Concave Min-Max Optimization","created":"2021-04-18","cited_by_count":36},{"id":"1901.00838","title":"On Finding Local Nash Equilibria (and Only Local Nash Equilibria) in Zero-Sum Games","created":"2019-01-03","cited_by_count":35},{"id":"1805.07588","title":"Robust Optimization over Multiple Domains","created":"2018-05-19","cited_by_count":34},{"id":"1910.07512","title":"On Solving Minimax Optimization Locally: A Follow-the-Ridge Approach","created":"2019-10-16","cited_by_count":34},{"id":"2006.06359","title":"Improved Algorithms for Convex-Concave Minimax Optimization","created":"2020-06-11","cited_by_count":34},{"id":"1906.12005","title":"R\\'enyi Fair Inference","created":"2019-06-28","cited_by_count":33},{"id":"1802.02988","title":"Stochastic subgradient method converges at the rate $O(k^{-1/4})$ on weakly convex functions","created":"2018-02-08","cited_by_count":32},{"id":"1905.13433","title":"An accelerated inexact proximal point method for solving nonconvex-concave min-max problems","created":"2019-05-31","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":"2103.04410","title":"Optimistic Dual Extrapolation for Coherent Non-monotone Variational Inequalities","created":"2021-03-07","cited_by_count":29},{"id":"1912.07481","title":"On Lower Iteration Complexity Bounds for the Saddle Point Problems","created":"2019-12-16","cited_by_count":28},{"id":"2002.06277","title":"A mean-field analysis of two-player zero-sum games","created":"2020-02-14","cited_by_count":28},{"id":"1906.02027","title":"Last-iterate convergence rates for min-max optimization","created":"2019-06-05","cited_by_count":25},{"id":"2002.09124","title":"GANs May Have No Nash Equilibria","created":"2020-02-21","cited_by_count":20},{"id":"1910.14380","title":"A Decentralized Proximal Point-type Method for Saddle Point Problems","created":"2019-10-31","cited_by_count":17},{"id":"2003.04546","title":"First-Order Methods for Nonconvex Quadratic Minimization","created":"2020-03-10","cited_by_count":10},{"id":"2003.08093","title":"Solving Non-Convex Non-Differentiable Min-Max Games using Proximal Gradient Method","created":"2020-03-18","cited_by_count":10},{"id":"2009.14820","title":"Gradient Descent-Ascent Provably Converges to Strict Local Minmax Equilibria with a Finite Timescale Separation","created":"2020-09-30","cited_by_count":10},{"id":"2104.12676","title":"Solving a class of non-convex min-max games using adaptive momentum methods","created":"2021-04-26","cited_by_count":10},{"id":"2106.01488","title":"Minimax Optimization with Smooth Algorithmic Adversaries","created":"2021-06-02","cited_by_count":8},{"id":"1311.1098","title":"Mirror Prox Algorithm for Multi-Term Composite Minimization and Semi-Separable Problems","created":"2013-11-05","cited_by_count":7},{"id":"2105.15042","title":"Semi-Anchored Multi-Step Gradient Descent Ascent Method for Structured Nonconvex-Nonconcave Composite Minimax Problems","created":"2021-05-31","cited_by_count":6},{"id":"1312.1073","title":"Solving Variational Inequalities with Monotone Operators on Domains Given by Linear Minimization Oracles","created":"2013-12-04","cited_by_count":5},{"id":"1605.07747","title":"NESTT: A Nonconvex Primal-Dual Splitting Method for Distributed and Stochastic Optimization","created":"2016-05-25","cited_by_count":5},{"id":"2102.01002","title":"On Well-Structured Convex-Concave Saddle Point Problems and Variational Inequalities with Monotone Operators","created":"2021-02-01","cited_by_count":4},{"id":"2104.00102","title":"Robust Experimentation in the Continuous Time Bandit Problem","created":"2021-03-31","cited_by_count":3},{"id":"1506.02444","title":"Decomposition Techniques for Bilinear Saddle Point Problems and Variational Inequalities with Affine Monotone Operators on Domains Given by Linear Minimization Oracles","created":"2015-06-08","cited_by_count":1},{"id":"1507.01476","title":"Semi-proximal Mirror-Prox for Nonsmooth Composite Minimization","created":"2015-07-06","cited_by_count":1},{"id":"2006.08667","title":"The Landscape of the Proximal Point Method for Nonconvex-Nonconcave Minimax Optimization","created":"2020-06-15","cited_by_count":1}],"next_cursor":null}