{"list":"other","total":74,"rows":[{"id":"1606.04838","title":"Optimization Methods for Large-Scale Machine Learning","created":"2016-06-15","cited_by_count":1150},{"id":"1705.08039","title":"Poincar\\'e Embeddings for Learning Hierarchical Representations","created":"2017-05-22","cited_by_count":684},{"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":"1905.10018","title":"Momentum-Based Variance Reduction in Non-Convex SGD","created":"2019-05-24","cited_by_count":306},{"id":"1807.01695","title":"SPIDER: Near-Optimal Non-Convex Optimization via Stochastic Path Integrated Differential Estimator","created":"2018-07-04","cited_by_count":287},{"id":"1809.10505","title":"The Convergence of Sparsified Gradient Methods","created":"2018-09-27","cited_by_count":229},{"id":"1901.09401","title":"SGD: General Analysis and Improved Rates","created":"2019-01-27","cited_by_count":207},{"id":"1710.09854","title":"Gradient Sparsification for Communication-Efficient Distributed Optimization","created":"2017-10-26","cited_by_count":201},{"id":"1309.2388","title":"Minimizing Finite Sums with the Stochastic Average Gradient","created":"2013-09-10","cited_by_count":164},{"id":"2002.03329","title":"Better Theory for SGD in the Nonconvex World","created":"2020-02-09","cited_by_count":158},{"id":"1603.06160","title":"Stochastic Variance Reduction for Nonconvex Optimization","created":"2016-03-19","cited_by_count":145},{"id":"1603.05953","title":"Katyusha: The First Direct Acceleration of Stochastic Gradient Methods","created":"2016-03-18","cited_by_count":135},{"id":"2106.05203","title":"EF21: A New, Simpler, Theoretically Better, and Practically Faster Error Feedback","created":"2021-06-09","cited_by_count":133},{"id":"2008.10898","title":"PAGE: A Simple and Optimal Probabilistic Gradient Estimator for Nonconvex Optimization","created":"2020-08-25","cited_by_count":119},{"id":"1901.09269","title":"Distributed Learning with Compressed Gradient Differences","created":"2019-01-26","cited_by_count":112},{"id":"1603.03236","title":"Pymanopt: A Python Toolbox for Optimization on Manifolds using Automatic Differentiation","created":"2016-03-10","cited_by_count":94},{"id":"1602.06053","title":"First-order Methods for Geodesically Convex Optimization","created":"2016-02-19","cited_by_count":93},{"id":"2002.11364","title":"Acceleration for Compressed Gradient Descent in Distributed and Federated Optimization","created":"2020-02-26","cited_by_count":90},{"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":"2008.00051","title":"On the Convergence of SGD with Biased Gradients","created":"2020-07-31","cited_by_count":83},{"id":"1903.04488","title":"Communication-efficient distributed SGD with Sketching","created":"2019-03-12","cited_by_count":81},{"id":"2010.00892","title":"Variance-Reduced Methods for Machine Learning","created":"2020-10-02","cited_by_count":79},{"id":"2102.07845","title":"MARINA: Faster Non-Convex Distributed Learning with Compression","created":"2021-02-15","cited_by_count":78},{"id":"1603.05643","title":"Variance Reduction for Faster Non-Convex Optimization","created":"2016-03-17","cited_by_count":72},{"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":"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":"1805.08768","title":"Sparse Binary Compression: Towards Distributed Deep Learning with minimal Communication","created":"2018-05-22","cited_by_count":51},{"id":"2010.00091","title":"Error Compensated Distributed SGD Can Be Accelerated","created":"2020-09-30","cited_by_count":45},{"id":"2305.16296","title":"A Guide Through the Zoo of Biased SGD","created":"2023-05-25","cited_by_count":40},{"id":"1506.03662","title":"Variance Reduced Stochastic Gradient Descent with Neighbors","created":"2015-06-11","cited_by_count":39},{"id":"1802.09128","title":"Averaging Stochastic Gradient Descent on Riemannian Manifolds","created":"2018-02-26","cited_by_count":39},{"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":"2102.04396","title":"SGD in the Large: Average-case Analysis, Asymptotics, and Stepsize Criticality","created":"2021-02-08","cited_by_count":35},{"id":"2207.04338","title":"Variance Reduced ProxSkip: Algorithm, Theory and Application to Federated Learning","created":"2022-07-09","cited_by_count":33},{"id":"2110.03300","title":"Permutation Compressors for Provably Faster Distributed Nonconvex Optimization","created":"2021-10-07","cited_by_count":32},{"id":"1809.03054","title":"SEGA: Variance Reduction via Gradient Sketching","created":"2018-09-09","cited_by_count":29},{"id":"1507.02772","title":"Riemannian Dictionary Learning and Sparse Coding for Positive Definite Matrices","created":"2015-07-10","cited_by_count":24},{"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":"1605.08257","title":"Low-rank tensor completion: a Riemannian manifold preconditioning approach","created":"2016-05-26","cited_by_count":19},{"id":"2006.10281","title":"Variance Reduction via Accelerated Dual Averaging for Finite-Sum Optimization","created":"2020-06-18","cited_by_count":19},{"id":"2104.09342","title":"Random Reshuffling with Variance Reduction: New Analysis and Better Rates","created":"2021-04-19","cited_by_count":19},{"id":"2104.09813","title":"Fast Stochastic Bregman Gradient Methods: Sharp Analysis and Variance Reduction","created":"2021-04-20","cited_by_count":19},{"id":"1409.2848","title":"A Stochastic PCA and SVD Algorithm with an Exponential Convergence Rate","created":"2014-09-09","cited_by_count":18},{"id":"1506.06840","title":"On Variance Reduction in Stochastic Gradient Descent and its Asynchronous Variants","created":"2015-06-23","cited_by_count":18},{"id":"2206.07021","title":"Federated Optimization Algorithms with Random Reshuffling and Gradient Compression","created":"2022-06-14","cited_by_count":18},{"id":"1509.05647","title":"Fast and Simple PCA via Convex Optimization","created":"2015-09-18","cited_by_count":16},{"id":"2002.05359","title":"Adaptivity of Stochastic Gradient Methods for Nonconvex Optimization","created":"2020-02-13","cited_by_count":16},{"id":"2202.01268","title":"DASHA: Distributed Nonconvex Optimization with Communication Compression, Optimal Oracle Complexity, and No Client Synchronization","created":"2022-02-02","cited_by_count":16},{"id":"1802.03866","title":"Katyusha X: Practical Momentum Method for Stochastic Sum-of-Nonconvex Optimization","created":"2018-02-12","cited_by_count":15},{"id":"2211.01851","title":"Adaptive Stochastic Variance Reduction for Non-convex Finite-Sum Minimization","created":"2022-11-03","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":"1312.1666","title":"Semi-Stochastic Gradient Descent Methods","created":"2013-12-05","cited_by_count":13},{"id":"2104.12112","title":"Improved Analysis and Rates for Variance Reduction under Without-replacement Sampling Orders","created":"2021-04-25","cited_by_count":13},{"id":"2206.05668","title":"Federated Learning on Riemannian Manifolds","created":"2022-06-12","cited_by_count":13},{"id":"1811.08109","title":"Faster First-Order Methods for Stochastic Non-Convex Optimization on Riemannian Manifolds","created":"2018-11-20","cited_by_count":12},{"id":"2205.03914","title":"Federated Random Reshuffling with Compression and Variance Reduction","created":"2022-05-08","cited_by_count":12},{"id":"2310.09804","title":"Communication Compression for Byzantine Robust Learning: New Efficient Algorithms and Improved Rates","created":"2023-10-15","cited_by_count":12},{"id":"1306.2672","title":"R3MC: A Riemannian three-factor algorithm for low-rank matrix completion","created":"2013-06-11","cited_by_count":11},{"id":"2012.03618","title":"Global Riemannian Acceleration in Hyperbolic and Spherical Spaces","created":"2020-12-07","cited_by_count":10},{"id":"2002.04670","title":"Variance Reduced Coordinate Descent with Acceleration: New Method With a Surprising Application to Finite-Sum Problems","created":"2020-02-11","cited_by_count":8},{"id":"2306.03240","title":"Improving Accelerated Federated Learning with Compression and Importance Sampling","created":"2023-06-05","cited_by_count":8},{"id":"1802.09932","title":"VR-SGD: A Simple Stochastic Variance Reduction Method for Machine Learning","created":"2018-02-26","cited_by_count":7},{"id":"1510.08896","title":"Robust Shift-and-Invert Preconditioning: Faster and More Sample Efficient Algorithms for Eigenvector Computation","created":"2015-10-29","cited_by_count":5},{"id":"1711.04416","title":"Variance Reduced methods for Non-convex Composition Optimization","created":"2017-11-13","cited_by_count":5},{"id":"1605.07367","title":"Riemannian stochastic variance reduced gradient on Grassmann manifold","created":"2016-05-24","cited_by_count":4},{"id":"1811.04194","title":"R-SPIDER: A Fast Riemannian Stochastic Optimization Algorithm with Curvature Independent Rate","created":"2018-11-10","cited_by_count":4},{"id":"2211.14645","title":"Accelerated Riemannian Optimization: Handling Constraints with a Prox to Bound Geometric Penalties","created":"2022-11-26","cited_by_count":4},{"id":"2401.05518","title":"Correlated Quantization for Faster Nonconvex Distributed Optimization","created":"2024-01-10","cited_by_count":3},{"id":"1910.11217","title":"Katyusha Acceleration for Convex Finite-Sum Compositional Optimization","created":"2019-10-24","cited_by_count":2},{"id":"2112.04291","title":"FastSGD: A Fast Compressed SGD Framework for Distributed Machine Learning","created":"2021-12-08","cited_by_count":2},{"id":"2112.07836","title":"Communication-Efficient Distributed SGD with Compressed Sensing","created":"2021-12-15","cited_by_count":1}],"next_cursor":null}