{"list":"other","total":53,"rows":[{"id":"1706.06083","title":"Towards Deep Learning Models Resistant to Adversarial Attacks","created":"2017-06-19","cited_by_count":6415},{"id":"1711.00141","title":"Training GANs with Optimism","created":"2017-10-31","cited_by_count":217},{"id":"1810.00760","title":"Riemannian Adaptive Optimization Methods","created":"2018-10-01","cited_by_count":194},{"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":"1709.02738","title":"Cycles in adversarial regularized learning","created":"2017-09-08","cited_by_count":124},{"id":"1308.5200","title":"Manopt, a Matlab toolbox for optimization on manifolds","created":"2013-08-23","cited_by_count":113},{"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":"1602.06053","title":"First-order Methods for Geodesically Convex Optimization","created":"2016-02-19","cited_by_count":93},{"id":"1709.06079","title":"Orthogonal Weight Normalization: Solution to Optimization over Multiple Dependent Stiefel Manifolds in Deep Neural Networks","created":"2017-09-16","cited_by_count":92},{"id":"2006.07201","title":"Minimax Estimation of Conditional Moment Models","created":"2020-06-12","cited_by_count":83},{"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":"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":"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":"1605.07147","title":"Riemannian SVRG: Fast Stochastic Optimization on Riemannian Manifolds","created":"2016-05-23","cited_by_count":64},{"id":"1605.08101","title":"Global rates of convergence for nonconvex optimization on manifolds","created":"2016-05-25","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.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":"2104.12761","title":"Adaptive Learning in Continuous Games: Optimal Regret Bounds and Convergence to Nash Equilibrium","created":"2021-04-26","cited_by_count":51},{"id":"2010.09514","title":"No-regret learning and mixed Nash equilibria: They do not mix","created":"2020-10-19","cited_by_count":50},{"id":"1511.03607","title":"Complete Dictionary Recovery over the Sphere I: Overview and the Geometric Picture","created":"2015-11-11","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":"1804.05464","title":"On Gradient-Based Learning in Continuous Games","created":"2018-04-16","cited_by_count":48},{"id":"2006.07458","title":"Projection Robust Wasserstein Distance and Riemannian Optimization","created":"2020-06-12","cited_by_count":45},{"id":"1802.09128","title":"Averaging Stochastic Gradient Descent on Riemannian Manifolds","created":"2018-02-26","cited_by_count":39},{"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":"2011.02987","title":"Simple and optimal methods for stochastic variational inequalities, I: operator extrapolation","created":"2020-11-05","cited_by_count":35},{"id":"1906.07355","title":"Escaping from saddle points on Riemannian manifolds","created":"2019-06-18","cited_by_count":33},{"id":"2210.03096","title":"Accelerated Single-Call Methods for Constrained Min-Max Optimization","created":"2022-10-06","cited_by_count":32},{"id":"1605.06182","title":"Dimensionality Reduction on SPD Manifolds: The Emergence of Geometry-Aware Methods","created":"2016-05-20","cited_by_count":29},{"id":"2012.05199","title":"A Riemannian Block Coordinate Descent Method for Computing the Projection Robust Wasserstein Distance","created":"2020-12-09","cited_by_count":27},{"id":"1511.04777","title":"Complete Dictionary Recovery over the Sphere II: Recovery by Riemannian Trust-region Method","created":"2015-11-15","cited_by_count":24},{"id":"1906.04321","title":"Efficiently escaping saddle points on manifolds","created":"2019-06-10","cited_by_count":24},{"id":"2206.03922","title":"A unified stochastic approximation framework for learning in games","created":"2022-06-08","cited_by_count":23},{"id":"1710.10770","title":"Riemannian Optimization via Frank-Wolfe Methods","created":"2017-10-30","cited_by_count":21},{"id":"2002.06768","title":"Last iterate convergence in no-regret learning: constrained min-max optimization for convex-concave landscapes","created":"2020-02-17","cited_by_count":21},{"id":"2302.09029","title":"Solving stochastic weak Minty variational inequalities without increasing batch size","created":"2023-02-17","cited_by_count":21},{"id":"2206.05248","title":"Accelerated Algorithms for Constrained Nonconvex-Nonconcave Min-Max Optimization and Comonotone Inclusion","created":"2022-06-10","cited_by_count":20},{"id":"2109.11196","title":"Fast and Efficient MMD-based Fair PCA via Optimization over Stiefel Manifold","created":"2021-09-23","cited_by_count":18},{"id":"2010.06097","title":"Gradient Descent Ascent for Minimax Problems on Riemannian Manifolds","created":"2020-10-13","cited_by_count":16},{"id":"2008.02252","title":"An accelerated first-order method for non-convex optimization on manifolds","created":"2020-08-05","cited_by_count":15},{"id":"2301.13120","title":"Doubly Optimal No-Regret Learning in Monotone Games","created":"2023-01-30","cited_by_count":14},{"id":"1908.05699","title":"Convergence of Gradient Methods on Bilinear Zero-Sum Games","created":"2019-08-15","cited_by_count":12},{"id":"2204.11418","title":"Riemannian Hamiltonian methods for min-max optimization on manifolds","created":"2022-04-25","cited_by_count":12},{"id":"2202.02036","title":"Accelerated Gradient Methods for Geodesically Convex Optimization: Tractable Algorithms and Convergence Analysis","created":"2022-02-04","cited_by_count":10},{"id":"2206.02041","title":"First-Order Algorithms for Min-Max Optimization in Geodesic Metric Spaces","created":"2022-06-04","cited_by_count":10},{"id":"2004.09863","title":"A novel embedded min-max approach for feature selection in nonlinear support vector machine classification","created":"2020-04-21","cited_by_count":9},{"id":"2202.06950","title":"Sion's Minimax Theorem in Geodesic Metric Spaces and a Riemannian Extragradient Algorithm","created":"2022-02-13","cited_by_count":9},{"id":"2101.05248","title":"Solving Min-Max Optimization with Hidden Structure via Gradient Descent Ascent","created":"2021-01-13","cited_by_count":8},{"id":"2305.16186","title":"Accelerated Methods for Riemannian Min-Max Optimization Ensuring Bounded Geometric Penalties","created":"2023-05-25","cited_by_count":4},{"id":"2111.02763","title":"Understanding Riemannian Acceleration via a Proximal Extragradient Framework","created":"2021-11-04","cited_by_count":3}],"next_cursor":null}