{"list":"other","total":70,"rows":[{"id":"1412.6980","title":"Adam: A Method for Stochastic Optimization","created":"2014-12-22","cited_by_count":37240},{"id":"1912.04977","title":"Advances and Open Problems in Federated Learning","created":"2019-12-10","cited_by_count":3046},{"id":"1610.05492","title":"Federated Learning: Strategies for Improving Communication Efficiency","created":"2016-10-18","cited_by_count":1475},{"id":"1609.04836","title":"On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minima","created":"2016-09-15","cited_by_count":1352},{"id":"2003.08119","title":"The Future of Digital Health with Federated Learning","created":"2020-03-18","cited_by_count":633},{"id":"1712.01887","title":"Deep Gradient Compression: Reducing the Communication Bandwidth for Distributed Training","created":"2017-12-05","cited_by_count":478},{"id":"1502.02551","title":"Deep Learning with Limited Numerical Precision","created":"2015-02-09","cited_by_count":376},{"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":"1912.02365","title":"Lower Bounds for Non-Convex Stochastic Optimization","created":"2019-12-05","cited_by_count":307},{"id":"1905.10018","title":"Momentum-Based Variance Reduction in Non-Convex SGD","created":"2019-05-24","cited_by_count":306},{"id":"1905.13727","title":"PowerSGD: Practical Low-Rank Gradient Compression for Distributed Optimization","created":"2019-05-31","cited_by_count":238},{"id":"1809.10505","title":"The Convergence of Sparsified Gradient Methods","created":"2018-09-27","cited_by_count":229},{"id":"1905.03817","title":"On the Linear Speedup Analysis of Communication Efficient Momentum SGD for Distributed Non-Convex Optimization","created":"2019-05-09","cited_by_count":180},{"id":"2008.03606","title":"Mime: Mimicking Centralized Stochastic Algorithms in Federated Learning","created":"2020-08-08","cited_by_count":154},{"id":"1610.02132","title":"QSGD: Communication-Efficient SGD via Gradient Quantization and Encoding","created":"2016-10-07","cited_by_count":147},{"id":"2002.12410","title":"On Biased Compression for Distributed Learning","created":"2020-02-27","cited_by_count":140},{"id":"2002.03305","title":"Momentum Improves Normalized SGD","created":"2020-02-09","cited_by_count":139},{"id":"2202.09357","title":"ProxSkip: Yes! Local Gradient Steps Provably Lead to Communication Acceleration! Finally!","created":"2022-02-18","cited_by_count":134},{"id":"2106.05203","title":"EF21: A New, Simpler, Theoretically Better, and Practically Faster Error Feedback","created":"2021-06-09","cited_by_count":133},{"id":"2007.07989","title":"An Improved Analysis of Stochastic Gradient Descent with Momentum","created":"2020-07-15","cited_by_count":119},{"id":"2008.10898","title":"PAGE: A Simple and Optimal Probabilistic Gradient Estimator for Nonconvex Optimization","created":"2020-08-25","cited_by_count":119},{"id":"1802.06175","title":"An Alternative View: When Does SGD Escape Local Minima?","created":"2018-02-17","cited_by_count":115},{"id":"1901.09269","title":"Distributed Learning with Compressed Gradient Differences","created":"2019-01-26","cited_by_count":112},{"id":"1907.09356","title":"Decentralized Deep Learning with Arbitrary Communication Compression","created":"2019-07-22","cited_by_count":111},{"id":"1905.05957","title":"DoubleSqueeze: Parallel Stochastic Gradient Descent with Double-Pass Error-Compensated Compression","created":"2019-05-15","cited_by_count":99},{"id":"1905.10988","title":"Natural Compression for Distributed Deep Learning","created":"2019-05-27","cited_by_count":90},{"id":"2002.11364","title":"Acceleration for Compressed Gradient Descent in Distributed and Federated Optimization","created":"2020-02-26","cited_by_count":90},{"id":"2106.14343","title":"High-probability Bounds for Non-Convex Stochastic Optimization with Heavy Tails","created":"2021-06-28","cited_by_count":80},{"id":"2102.07845","title":"MARINA: Faster Non-Convex Distributed Learning with Compression","created":"2021-02-15","cited_by_count":78},{"id":"1903.06701","title":"Scaling Distributed Machine Learning with In-Network Aggregation","created":"2019-02-22","cited_by_count":65},{"id":"1904.05115","title":"Stochastic Distributed Learning with Gradient Quantization and Variance Reduction","created":"2019-04-10","cited_by_count":65},{"id":"2204.02634","title":"Federated Reinforcement Learning with Environment Heterogeneity","created":"2022-04-06","cited_by_count":63},{"id":"1412.7457","title":"Global convergence of the Heavy-ball method for convex optimization","created":"2014-12-23","cited_by_count":61},{"id":"2007.14294","title":"A High Probability Analysis of Adaptive SGD with Momentum","created":"2020-07-28","cited_by_count":61},{"id":"2010.12292","title":"Linearly Converging Error Compensated SGD","created":"2020-10-23","cited_by_count":61},{"id":"2106.02969","title":"FedNL: Making Newton-Type Methods Applicable to Federated Learning","created":"2021-06-05","cited_by_count":52},{"id":"1905.10936","title":"Communication-Efficient Distributed Blockwise Momentum SGD with Error-Feedback","created":"2019-05-27","cited_by_count":50},{"id":"2006.14591","title":"Bidirectional compression in heterogeneous settings for distributed or federated learning with partial participation: tight convergence guarantees","created":"2020-06-25","cited_by_count":46},{"id":"2002.08958","title":"Uncertainty Principle for Communication Compression in Distributed and Federated Learning and the Search for an Optimal Compressor","created":"2020-02-20","cited_by_count":45},{"id":"2010.00091","title":"Error Compensated Distributed SGD Can Be Accelerated","created":"2020-09-30","cited_by_count":45},{"id":"2011.01697","title":"A Linearly Convergent Algorithm for Decentralized Optimization: Sending Less Bits for Free!","created":"2020-11-03","cited_by_count":42},{"id":"2108.00951","title":"Rethinking gradient sparsification as total error minimization","created":"2021-08-02","cited_by_count":41},{"id":"2201.13320","title":"BEER: Fast $O(1/T)$ Rate for Decentralized Nonconvex Optimization with Communication Compression","created":"2022-01-31","cited_by_count":41},{"id":"2207.05931","title":"Towards understanding how momentum improves generalization in deep learning","created":"2022-07-13","cited_by_count":40},{"id":"1604.03257","title":"Unified Convergence Analysis of Stochastic Momentum Methods for Convex and Non-convex Optimization","created":"2016-04-12","cited_by_count":37},{"id":"2206.03665","title":"Lower Bounds and Nearly Optimal Algorithms in Distributed Learning with Communication Compression","created":"2022-06-08","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":"2005.07041","title":"SQuARM-SGD: Communication-Efficient Momentum SGD for Decentralized Optimization","created":"2020-05-13","cited_by_count":31},{"id":"2209.15218","title":"EF21-P and Friends: Improved Theoretical Communication Complexity for Distributed Optimization with Bidirectional Compression","created":"2022-09-30","cited_by_count":28},{"id":"2302.00543","title":"DoCoFL: Downlink Compression for Cross-Device Federated Learning","created":"2023-02-01","cited_by_count":28},{"id":"2007.13221","title":"CSER: Communication-efficient SGD with Error Reset","created":"2020-07-26","cited_by_count":27},{"id":"2202.00998","title":"3PC: Three Point Compressors for Communication-Efficient Distributed Training and a Better Theory for Lazy Aggregation","created":"2022-02-02","cited_by_count":27},{"id":"2206.10185","title":"Federated Stochastic Approximation under Markov Noise and Heterogeneity: Applications in Reinforcement Learning","created":"2022-06-21","cited_by_count":27},{"id":"2305.12475","title":"Two Sides of One Coin: the Limits of Untuned SGD and the Power of Adaptive Methods","created":"2023-05-21","cited_by_count":23},{"id":"2107.05074","title":"SGD: The Role of Implicit Regularization, Batch-size and Multiple-epochs","created":"2021-07-11","cited_by_count":22},{"id":"2010.00406","title":"Momentum via Primal Averaging: Theoretical Insights and Learning Rate Schedules for Non-Convex Optimization","created":"2020-10-01","cited_by_count":21},{"id":"2209.15505","title":"Momentum Tracking: Momentum Acceleration for Decentralized Deep Learning on Heterogeneous Data","created":"2022-09-30","cited_by_count":20},{"id":"2205.05632","title":"On Distributed Adaptive Optimization with Gradient Compression","created":"2022-05-11","cited_by_count":19},{"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":"2211.00188","title":"Adaptive Compression for Communication-Efficient Distributed Training","created":"2022-10-31","cited_by_count":16},{"id":"2111.00705","title":"Communication-Compressed Adaptive Gradient Method for Distributed Nonconvex Optimization","created":"2021-11-01","cited_by_count":12},{"id":"2301.00944","title":"Temporal Difference Learning with Compressed Updates: Error-Feedback meets Reinforcement Learning","created":"2023-01-03","cited_by_count":12},{"id":"2206.03588","title":"Distributed Newton-Type Methods with Communication Compression and Bernoulli Aggregation","created":"2022-06-07","cited_by_count":11},{"id":"2102.07002","title":"On the Last Iterate Convergence of Momentum Methods","created":"2021-02-13","cited_by_count":10},{"id":"2004.05298","title":"Detached Error Feedback for Distributed SGD with Random Sparsification","created":"2020-04-11","cited_by_count":6},{"id":"2010.01449","title":"Quickly Finding a Benign Region via Heavy Ball Momentum in Non-Convex Optimization","created":"2020-10-04","cited_by_count":5},{"id":"2205.01774","title":"Efficient Algorithms for A Class of Stochastic Hidden Convex Optimization and Its Applications in Network Revenue Management","created":"2022-05-03","cited_by_count":5},{"id":"1907.02710","title":"Nesterov's acceleration and Polyak's heavy ball method in continuous time: convergence rate analysis under geometric conditions and perturbations","created":"2019-07-05","cited_by_count":1},{"id":"2211.06197","title":"A convergence study of SGD-type methods for stochastic optimization","created":"2022-11-11","cited_by_count":1}],"next_cursor":null}