{"list":"other","total":59,"rows":[{"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":"1809.07599","title":"Sparsified SGD with Memory","created":"2018-09-20","cited_by_count":376},{"id":"1901.09847","title":"Error Feedback Fixes SignSGD and other Gradient Compression Schemes","created":"2019-01-28","cited_by_count":310},{"id":"1705.07878","title":"TernGrad: Ternary Gradients to Reduce Communication in Distributed Deep Learning","created":"2017-05-22","cited_by_count":256},{"id":"1901.09401","title":"SGD: General Analysis and Improved Rates","created":"2019-01-27","cited_by_count":207},{"id":"1610.02132","title":"QSGD: Communication-Efficient SGD via Gradient Quantization and Encoding","created":"2016-10-07","cited_by_count":147},{"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":"2002.12410","title":"On Biased Compression for Distributed Learning","created":"2020-02-27","cited_by_count":140},{"id":"2106.05203","title":"EF21: A New, Simpler, Theoretically Better, and Practically Faster Error Feedback","created":"2021-06-09","cited_by_count":133},{"id":"1901.09269","title":"Distributed Learning with Compressed Gradient Differences","created":"2019-01-26","cited_by_count":112},{"id":"2011.00364","title":"Efficient Methods for Structured Nonconvex-Nonconcave Min-Max Optimization","created":"2020-10-31","cited_by_count":96},{"id":"2002.11364","title":"Acceleration for Compressed Gradient Descent in Distributed and Federated Optimization","created":"2020-02-26","cited_by_count":90},{"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":"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":"2102.07845","title":"MARINA: Faster Non-Convex Distributed Learning with Compression","created":"2021-02-15","cited_by_count":78},{"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":"2006.10311","title":"SGD for Structured Nonconvex Functions: Learning Rates, Minibatching and Interpolation","created":"2020-06-18","cited_by_count":67},{"id":"1904.05115","title":"Stochastic Distributed Learning with Gradient Quantization and Variance Reduction","created":"2019-04-10","cited_by_count":65},{"id":"1904.08598","title":"Reducing Noise in GAN Training with Variance Reduced Extragradient","created":"2019-04-18","cited_by_count":62},{"id":"2010.12292","title":"Linearly Converging Error Compensated SGD","created":"2020-10-23","cited_by_count":61},{"id":"1605.06398","title":"Stochastic Variance Reduction Methods for Saddle-Point Problems","created":"2016-05-20","cited_by_count":60},{"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":"2102.08352","title":"Stochastic Variance Reduction for Variational Inequality Methods","created":"2021-02-16","cited_by_count":47},{"id":"2010.00091","title":"Error Compensated Distributed SGD Can Be Accelerated","created":"2020-09-30","cited_by_count":45},{"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":"1506.03662","title":"Variance Reduced Stochastic Gradient Descent with Neighbors","created":"2015-06-11","cited_by_count":39},{"id":"1712.05654","title":"Catalyst Acceleration for First-order Convex Optimization: from Theory to Practice","created":"2017-12-15","cited_by_count":39},{"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":"1907.02056","title":"Variance Reduction for Matrix Games","created":"2019-07-03","cited_by_count":38},{"id":"1808.04162","title":"A Forward-Backward Splitting Method for Monotone Inclusions Without Cocoercivity","created":"2018-08-13","cited_by_count":36},{"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":"1504.01032","title":"A Three-Operator Splitting Scheme and its Optimization Applications","created":"2015-04-04","cited_by_count":34},{"id":"2007.04202","title":"Stochastic Hamiltonian Gradient Methods for Smooth Games","created":"2020-07-08","cited_by_count":32},{"id":"2111.08611","title":"Stochastic Extragradient: General Analysis and Improved Rates","created":"2021-11-16","cited_by_count":31},{"id":"1809.03054","title":"SEGA: Variance Reduction via Gradient Sketching","created":"2018-09-09","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":"2002.09806","title":"Finite-Time Last-Iterate Convergence for Multi-Agent Learning in Games","created":"2020-02-23","cited_by_count":26},{"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":"2001.07819","title":"Zeroth-Order Algorithms for Nonconvex Minimax Problems with Improved Complexities","created":"2020-01-22","cited_by_count":21},{"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":"2106.01761","title":"Near Optimal Stochastic Algorithms for Finite-Sum Unbalanced Convex-Concave Minimax Optimization","created":"2021-06-03","cited_by_count":16},{"id":"2110.03313","title":"Distributed Methods with Compressed Communication for Solving Variational Inequalities, with Theoretical Guarantees","created":"2021-10-07","cited_by_count":15},{"id":"1906.01481","title":"L-SVRG and L-Katyusha with Arbitrary Sampling","created":"2019-06-04","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":"2107.01906","title":"The Last-Iterate Convergence Rate of Optimistic Mirror Descent in Stochastic Variational Inequalities","created":"2021-07-05","cited_by_count":12},{"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":"2005.05913","title":"Gradient-Free Methods for Saddle-Point Problem","created":"2020-05-12","cited_by_count":9},{"id":"1903.07971","title":"Convergence Analysis of Inexact Randomized Iterative Methods","created":"2019-03-19","cited_by_count":8},{"id":"2009.09908","title":"Zeroth-Order Algorithms for Smooth Saddle-Point Problems","created":"2020-09-21","cited_by_count":7},{"id":"2103.00321","title":"One-Point Gradient-Free Methods for Smooth and Non-Smooth Saddle-Point Problems","created":"2021-02-27","cited_by_count":1}],"next_cursor":null}