{"list":"other","total":65,"rows":[{"id":"1412.6980","title":"Adam: A Method for Stochastic Optimization","created":"2014-12-22","cited_by_count":37240},{"id":"2203.00667","title":"Generative Adversarial Networks","created":"2022-03-01","cited_by_count":5627},{"id":"1703.00887","title":"How to Escape Saddle Points Efficiently","created":"2017-03-02","cited_by_count":285},{"id":"1906.00331","title":"On Gradient Descent Ascent for Nonconvex-Concave Minimax Problems","created":"2019-06-02","cited_by_count":270},{"id":"1503.02101","title":"Escaping From Saddle Points --- Online Stochastic Gradient for Tensor Decomposition","created":"2015-03-06","cited_by_count":243},{"id":"1810.00760","title":"Riemannian Adaptive Optimization Methods","created":"2018-10-01","cited_by_count":194},{"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":"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":"1807.02629","title":"Optimistic mirror descent in saddle-point problems: Going the extra (gradient) mile","created":"2018-07-07","cited_by_count":136},{"id":"1704.00708","title":"No Spurious Local Minima in Nonconvex Low Rank Problems: A Unified Geometric Analysis","created":"2017-04-03","cited_by_count":129},{"id":"2002.02417","title":"Near-Optimal Algorithms for Minimax Optimization","created":"2020-02-05","cited_by_count":119},{"id":"1802.05642","title":"The Mechanics of n-Player Differentiable Games","created":"2018-02-15","cited_by_count":118},{"id":"1308.5200","title":"Manopt, a Matlab toolbox for optimization on manifolds","created":"2013-08-23","cited_by_count":113},{"id":"1807.03907","title":"The Limit Points of (Optimistic) Gradient Descent in Min-Max Optimization","created":"2018-07-11","cited_by_count":101},{"id":"1807.04252","title":"Last-Iterate Convergence: Zero-Sum Games and Constrained Min-Max Optimization","created":"2018-07-11","cited_by_count":98},{"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":"1907.01543","title":"Efficient Algorithms for Smooth Minimax Optimization","created":"2019-07-02","cited_by_count":76},{"id":"1705.10412","title":"Gradient Descent Can Take Exponential Time to Escape Saddle Points","created":"2017-05-29","cited_by_count":74},{"id":"1806.04498","title":"The Unusual Effectiveness of Averaging in GAN Training","created":"2018-06-12","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":"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":"1807.04740","title":"Negative Momentum for Improved Game Dynamics","created":"2018-07-12","cited_by_count":60},{"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":"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":"1310.7780","title":"The Information Geometry of Mirror Descent","created":"2013-10-29","cited_by_count":54},{"id":"1711.01204","title":"Metrics for Deep Generative Models","created":"2017-11-03","cited_by_count":53},{"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":"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":"2105.06072","title":"Leveraging Non-uniformity in First-order Non-convex Optimization","created":"2021-05-13","cited_by_count":44},{"id":"1802.09128","title":"Averaging Stochastic Gradient Descent on Riemannian Manifolds","created":"2018-02-26","cited_by_count":39},{"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":"1906.05450","title":"A Brief Introduction to Manifold Optimization","created":"2019-06-13","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":"1810.10207","title":"First-order Convergence Theory for Weakly-Convex-Weakly-Concave Min-max Problems","created":"2018-10-24","cited_by_count":34},{"id":"2006.12301","title":"On Projection Robust Optimal Transport: Sample Complexity and Model Misspecification","created":"2020-06-22","cited_by_count":34},{"id":"1906.07355","title":"Escaping from saddle points on Riemannian manifolds","created":"2019-06-18","cited_by_count":33},{"id":"2106.00286","title":"On Riemannian Optimization over Positive Definite Matrices with the Bures-Wasserstein Geometry","created":"2021-06-01","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":"1605.06182","title":"Dimensionality Reduction on SPD Manifolds: The Emergence of Geometry-Aware Methods","created":"2016-05-20","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":"1805.05751","title":"Local Saddle Point Optimization: A Curvature Exploitation Approach","created":"2018-05-15","cited_by_count":28},{"id":"1912.07481","title":"On Lower Iteration Complexity Bounds for the Saddle Point Problems","created":"2019-12-16","cited_by_count":28},{"id":"1910.10782","title":"A Continuous-time Perspective for Modeling Acceleration in Riemannian Optimization","created":"2019-10-23","cited_by_count":25},{"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":"1602.05908","title":"Efficient approaches for escaping higher order saddle points in non-convex optimization","created":"2016-02-18","cited_by_count":23},{"id":"2101.04667","title":"Survival of the strictest: Stable and unstable equilibria under regularized learning with partial information","created":"2021-01-12","cited_by_count":23},{"id":"1603.09173","title":"Riemannian game dynamics","created":"2016-03-30","cited_by_count":19},{"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":"2011.01929","title":"The Complexity of Gradient Descent: CLS = PPAD $\\cap$ PLS","created":"2020-11-03","cited_by_count":17},{"id":"2010.06097","title":"Gradient Descent Ascent for Minimax Problems on Riemannian Manifolds","created":"2020-10-13","cited_by_count":16},{"id":"1910.13010","title":"Poincar\\'e Recurrence, Cycles and Spurious Equilibria in Gradient-Descent-Ascent for Non-Convex Non-Concave Zero-Sum Games","created":"2019-10-28","cited_by_count":15},{"id":"2008.02252","title":"An accelerated first-order method for non-convex optimization on manifolds","created":"2020-08-05","cited_by_count":15},{"id":"1709.01434","title":"A Generic Approach for Escaping Saddle points","created":"2017-09-05","cited_by_count":13},{"id":"2002.05683","title":"An Optimal Multistage Stochastic Gradient Method for Minimax Problems","created":"2020-02-13","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":"1809.09449","title":"Hessian barrier algorithms for linearly constrained optimization problems","created":"2018-09-25","cited_by_count":8},{"id":"2101.05248","title":"Solving Min-Max Optimization with Hidden Structure via Gradient Descent Ascent","created":"2021-01-13","cited_by_count":8},{"id":"1809.00452","title":"Structured Quasi-Newton Methods for Optimization with Orthogonality Constraints","created":"2018-09-03","cited_by_count":7},{"id":"1710.02236","title":"Primal-Dual Optimization Algorithms over Riemannian Manifolds: an Iteration Complexity Analysis","created":"2017-10-05","cited_by_count":6}],"next_cursor":null}