{"list":"other","total":78,"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":"1407.0202","title":"SAGA: A Fast Incremental Gradient Method With Support for Non-Strongly Convex Composite Objectives","created":"2014-07-01","cited_by_count":402},{"id":"1901.09401","title":"SGD: General Analysis and Improved Rates","created":"2019-01-27","cited_by_count":207},{"id":"1703.06182","title":"Deep Decentralized Multi-task Multi-Agent Reinforcement Learning under Partial Observability","created":"2017-03-17","cited_by_count":148},{"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.02417","title":"Near-Optimal Algorithms for Minimax Optimization","created":"2020-02-05","cited_by_count":119},{"id":"2005.10785","title":"Stochastic Optimization with Heavy-Tailed Noise via Accelerated Gradient Clipping","created":"2020-05-21","cited_by_count":104},{"id":"1908.08465","title":"On the convergence of single-call stochastic extra-gradient methods","created":"2019-08-22","cited_by_count":89},{"id":"1905.11261","title":"A Unified Theory of SGD: Variance Reduction, Sampling, Quantization and Coordinate Descent","created":"2019-05-27","cited_by_count":84},{"id":"1808.02901","title":"Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems","created":"2018-08-08","cited_by_count":76},{"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":"1901.08689","title":"Don't Jump Through Hoops and Remove Those Loops: SVRG and Katyusha are Better Without the Outer Loop","created":"2019-01-24","cited_by_count":68},{"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":"1605.06398","title":"Stochastic Variance Reduction Methods for Saddle-Point Problems","created":"2016-05-20","cited_by_count":60},{"id":"1807.04740","title":"Negative Momentum for Improved Game Dynamics","created":"2018-07-12","cited_by_count":60},{"id":"1801.02982","title":"How To Make the Gradients Small Stochastically: Even Faster Convex and Nonconvex SGD","created":"2018-01-08","cited_by_count":57},{"id":"1506.02186","title":"A Universal Catalyst for First-Order Optimization","created":"2015-06-06","cited_by_count":54},{"id":"2008.12776","title":"Efficiently Solving MDPs with Stochastic Mirror Descent","created":"2020-08-28","cited_by_count":53},{"id":"2003.10162","title":"Explore Aggressively, Update Conservatively: Stochastic Extragradient Methods with Variable Stepsize Scaling","created":"2020-03-23","cited_by_count":49},{"id":"2102.08352","title":"Stochastic Variance Reduction for Variational Inequality Methods","created":"2021-02-16","cited_by_count":47},{"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":"1907.02056","title":"Variance Reduction for Matrix Games","created":"2019-07-03","cited_by_count":38},{"id":"2202.07262","title":"Stochastic Gradient Descent-Ascent: Unified Theory and New Efficient Methods","created":"2022-02-15","cited_by_count":37},{"id":"1808.04162","title":"A Forward-Backward Splitting Method for Monotone Inclusions Without Cocoercivity","created":"2018-08-13","cited_by_count":36},{"id":"1905.11373","title":"Revisiting Stochastic Extragradient","created":"2019-05-27","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":"1902.04686","title":"The Complexity of Making the Gradient Small in Stochastic Convex Optimization","created":"2019-02-13","cited_by_count":34},{"id":"2102.09468","title":"Near-optimal Local Convergence of Alternating Gradient Descent-Ascent for Minimax Optimization","created":"2021-02-18","cited_by_count":31},{"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":"1912.11940","title":"Towards Better Understanding of Adaptive Gradient Algorithms in Generative Adversarial Nets","created":"2019-12-26","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":"1902.01637","title":"A Universal Algorithm for Variational Inequalities Adaptive to Smoothness and Noise","created":"2019-02-05","cited_by_count":26},{"id":"2106.08315","title":"Decentralized Local Stochastic Extra-Gradient for Variational Inequalities","created":"2021-06-15","cited_by_count":25},{"id":"2103.08280","title":"Lower Complexity Bounds of Finite-Sum Optimization Problems: The Results and Construction","created":"2021-03-15","cited_by_count":24},{"id":"2205.15371","title":"Optimal and Adaptive Monteiro-Svaiter Acceleration","created":"2022-05-30","cited_by_count":24},{"id":"2011.08434","title":"Simple and optimal methods for stochastic variational inequalities, II: Markovian noise and policy evaluation in reinforcement learning","created":"2020-11-15","cited_by_count":23},{"id":"2205.05653","title":"The First Optimal Algorithm for Smooth and Strongly-Convex-Strongly-Concave Minimax Optimization","created":"2022-05-11","cited_by_count":20},{"id":"2205.09647","title":"The First Optimal Acceleration of High-Order Methods in Smooth Convex Optimization","created":"2022-05-19","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":"2207.03957","title":"Communication Acceleration of Local Gradient Methods via an Accelerated Primal-Dual Algorithm with Inexact Prox","created":"2022-07-08","cited_by_count":19},{"id":"2001.00602","title":"Accelerating Smooth Games by Manipulating Spectral Shapes","created":"2020-01-02","cited_by_count":18},{"id":"2007.08840","title":"Adaptive Gradient Methods for Constrained Convex Optimization and Variational Inequalities","created":"2020-07-17","cited_by_count":18},{"id":"2011.06572","title":"Relative Lipschitzness in Extragradient Methods and a Direct Recipe for Acceleration","created":"2020-11-12","cited_by_count":18},{"id":"2106.01761","title":"Near Optimal Stochastic Algorithms for Finite-Sum Unbalanced Convex-Concave Minimax Optimization","created":"2021-06-03","cited_by_count":16},{"id":"2112.15199","title":"Accelerated Primal-Dual Gradient Method for Smooth and Convex-Concave Saddle-Point Problems with Bilinear Coupling","created":"2021-12-30","cited_by_count":16},{"id":"2009.08447","title":"Coordinate Methods for Matrix Games","created":"2020-09-17","cited_by_count":15},{"id":"2202.04640","title":"Sharper Rates for Separable Minimax and Finite Sum Optimization via Primal-Dual Extragradient Methods","created":"2022-02-09","cited_by_count":15},{"id":"1803.06600","title":"Optimizing the Efficiency of First-Order Methods for Decreasing the Gradient of Smooth Convex Functions","created":"2018-03-18","cited_by_count":14},{"id":"1809.05895","title":"Primal-dual accelerated gradient methods with small-dimensional relaxation oracle","created":"2018-09-16","cited_by_count":14},{"id":"2010.13112","title":"Distributed Saddle-Point Problems: Lower Bounds, Near-Optimal and Robust Algorithms","created":"2020-10-25","cited_by_count":14},{"id":"2202.02771","title":"Optimal Algorithms for Decentralized Stochastic Variational Inequalities","created":"2022-02-06","cited_by_count":14},{"id":"2206.01095","title":"Clipped Stochastic Methods for Variational Inequalities with Heavy-Tailed Noise","created":"2022-06-02","cited_by_count":14},{"id":"2103.09344","title":"On Accelerated Methods for Saddle-Point Problems with Composite Structure","created":"2021-03-16","cited_by_count":13},{"id":"2201.07427","title":"Lifted Primal-Dual Method for Bilinearly Coupled Smooth Minimax Optimization","created":"2022-01-19","cited_by_count":13},{"id":"2010.07799","title":"Adaptive and Universal Algorithms for Variational Inequalities with Optimal Convergence","created":"2020-10-15","cited_by_count":12},{"id":"2102.07758","title":"Decentralized Distributed Optimization for Saddle Point Problems","created":"2021-02-15","cited_by_count":10},{"id":"2102.13643","title":"Variance Reduction via Primal-Dual Accelerated Dual Averaging for Nonsmooth Convex Finite-Sums","created":"2021-02-26","cited_by_count":10},{"id":"2111.01842","title":"Coordinate Linear Variance Reduction for Generalized Linear Programming","created":"2021-11-02","cited_by_count":10},{"id":"2111.02708","title":"Quasi-Newton Methods for Saddle Point Problems and Beyond","created":"2021-11-04","cited_by_count":10},{"id":"2111.12743","title":"Robust Accelerated Primal-Dual Methods for Computing Saddle Points","created":"2021-11-24","cited_by_count":10},{"id":"2205.15136","title":"Optimal Gradient Sliding and its Application to Distributed Optimization Under Similarity","created":"2022-05-30","cited_by_count":10},{"id":"2109.14213","title":"On the One-sided Convergence of Adam-type Algorithms in Non-convex Non-concave Min-max Optimization","created":"2021-09-29","cited_by_count":9},{"id":"1902.00990","title":"Inexact Model: A Framework for Optimization and Variational Inequalities","created":"2019-02-03","cited_by_count":8},{"id":"2206.08627","title":"RECAPP: Crafting a More Efficient Catalyst for Convex Optimization","created":"2022-06-17","cited_by_count":8},{"id":"2107.05957","title":"Near-Optimal Decentralized Algorithms for Saddle Point Problems over Time-Varying Networks","created":"2021-07-13","cited_by_count":7},{"id":"2103.00434","title":"Solving smooth min-min and min-max problems by mixed oracle algorithms","created":"2021-02-28","cited_by_count":4},{"id":"2201.12206","title":"A Unified Analysis of Variational Inequality Methods: Variance Reduction, Sampling, Quantization and Coordinate Descent","created":"2022-01-28","cited_by_count":4},{"id":"2206.00090","title":"Decentralized Saddle-Point Problems with Different Constants of Strong Convexity and Strong Concavity","created":"2022-05-31","cited_by_count":4},{"id":"2206.08573","title":"Optimal Extragradient-Based Bilinearly-Coupled Saddle-Point Optimization","created":"2022-06-17","cited_by_count":4},{"id":"2109.01974","title":"Explicit Superlinear Convergence Rates of Broyden's Methods in Nonlinear Equations","created":"2021-09-05","cited_by_count":3},{"id":"2110.08572","title":"Greedy and Random Broyden's Methods with Explicit Superlinear Convergence Rates in Nonlinear Equations","created":"2021-10-16","cited_by_count":3},{"id":"2206.08303","title":"On Scaled Methods for Saddle Point Problems","created":"2022-06-16","cited_by_count":3},{"id":"2010.02280","title":"Solving strongly convex-concave composite saddle point problems with a small dimension of one of the variables","created":"2020-10-05","cited_by_count":2},{"id":"2207.09544","title":"Some Adaptive First-order Methods for Variational Inequalities with Relatively Strongly Monotone Operators and Generalized Smoothness","created":"2022-07-19","cited_by_count":1}],"next_cursor":null}