{"list":"other","total":54,"rows":[{"id":"1602.05629","title":"Communication-Efficient Learning of Deep Networks from Decentralized Data","created":"2016-02-17","cited_by_count":7669},{"id":"1912.04977","title":"Advances and Open Problems in Federated Learning","created":"2019-12-10","cited_by_count":3046},{"id":"1908.07873","title":"Federated Learning: Challenges, Methods, and Future Directions","created":"2019-08-21","cited_by_count":1538},{"id":"1610.05492","title":"Federated Learning: Strategies for Improving Communication Efficiency","created":"2016-10-18","cited_by_count":1475},{"id":"1805.09767","title":"Local SGD Converges Fast and Communicates Little","created":"2018-05-24","cited_by_count":605},{"id":"1610.02527","title":"Federated Optimization: Distributed Machine Learning for On-Device Intelligence","created":"2016-10-08","cited_by_count":564},{"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":"1809.10505","title":"The Convergence of Sparsified Gradient Methods","created":"2018-09-27","cited_by_count":229},{"id":"1902.00340","title":"Decentralized Stochastic Optimization and Gossip Algorithms with Compressed Communication","created":"2019-02-01","cited_by_count":221},{"id":"1710.09854","title":"Gradient Sparsification for Communication-Efficient Distributed Optimization","created":"2017-10-26","cited_by_count":201},{"id":"2101.11203","title":"Achieving Linear Speedup with Partial Worker Participation in Non-IID Federated Learning","created":"2021-01-27","cited_by_count":193},{"id":"1910.06378","title":"SCAFFOLD: Stochastic Controlled Averaging for Federated Learning","created":"2019-10-14","cited_by_count":175},{"id":"2002.12410","title":"On Biased Compression for Distributed Learning","created":"2020-02-27","cited_by_count":140},{"id":"2012.10333","title":"Learning from History for Byzantine Robust Optimization","created":"2020-12-18","cited_by_count":137},{"id":"1603.05953","title":"Katyusha: The First Direct Acceleration of Stochastic Gradient Methods","created":"2016-03-18","cited_by_count":135},{"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":"1312.7853","title":"Communication Efficient Distributed Optimization using an Approximate Newton-type Method","created":"2013-12-30","cited_by_count":132},{"id":"2006.09365","title":"Byzantine-Robust Learning on Heterogeneous Datasets via Bucketing","created":"2020-06-16","cited_by_count":128},{"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":"1805.09965","title":"LAG: Lazily Aggregated Gradient for Communication-Efficient Distributed Learning","created":"2018-05-25","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":"2011.02828","title":"Local SGD: Unified Theory and New Efficient Methods","created":"2020-11-03","cited_by_count":88},{"id":"2102.07845","title":"MARINA: Faster Non-Convex Distributed Learning with Compression","created":"2021-02-15","cited_by_count":78},{"id":"1904.05115","title":"Stochastic Distributed Learning with Gradient Quantization and Variance Reduction","created":"2019-04-10","cited_by_count":65},{"id":"2106.02969","title":"FedNL: Making Newton-Type Methods Applicable to Federated Learning","created":"2021-06-05","cited_by_count":52},{"id":"2010.00091","title":"Error Compensated Distributed SGD Can Be Accelerated","created":"2020-09-30","cited_by_count":45},{"id":"1709.03528","title":"GIANT: Globally Improved Approximate Newton Method for Distributed Optimization","created":"2017-09-11","cited_by_count":44},{"id":"1608.06879","title":"AIDE: Fast and Communication Efficient Distributed Optimization","created":"2016-08-24","cited_by_count":43},{"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":"1910.12308","title":"Asynchronous Decentralized SGD with Quantized and Local Updates","created":"2019-10-27","cited_by_count":36},{"id":"1909.07588","title":"Communication-Efficient Distributed Learning via Lazily Aggregated Quantized Gradients","created":"2019-09-17","cited_by_count":32},{"id":"1809.03054","title":"SEGA: Variance Reduction via Gradient Sketching","created":"2018-09-09","cited_by_count":29},{"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":"2102.07158","title":"Distributed Second Order Methods with Fast Rates and Compressed Communication","created":"2021-02-14","cited_by_count":25},{"id":"1912.01597","title":"Stochastic Newton and Cubic Newton Methods with Simple Local Linear-Quadratic Rates","created":"2019-12-03","cited_by_count":24},{"id":"2002.09526","title":"Stochastic Subspace Cubic Newton Method","created":"2020-02-21","cited_by_count":21},{"id":"1901.05134","title":"DINGO: Distributed Newton-Type Method for Gradient-Norm Optimization","created":"2019-01-16","cited_by_count":20},{"id":"2006.08737","title":"Distributed Newton Can Communicate Less and Resist Byzantine Workers","created":"2020-06-15","cited_by_count":20},{"id":"2109.04522","title":"Asynchronous Iterations in Optimization: New Sequence Results and Sharper Algorithmic Guarantees","created":"2021-09-09","cited_by_count":17},{"id":"1706.01108","title":"Stochastic Reformulations of Linear Systems: Algorithms and Convergence Theory","created":"2017-06-04","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":"2105.07320","title":"LocalNewton: Reducing Communication Bottleneck for Distributed Learning","created":"2021-05-16","cited_by_count":15},{"id":"2111.01847","title":"Basis Matters: Better Communication-Efficient Second Order Methods for Federated Learning","created":"2021-11-02","cited_by_count":15},{"id":"1905.02671","title":"Minimizing Uniformly Convex Functions by Cubic Regularization of Newton Method","created":"2019-05-07","cited_by_count":12},{"id":"2202.05800","title":"SHED: A Newton-type algorithm for federated learning based on incremental Hessian eigenvector sharing","created":"2022-02-11","cited_by_count":11},{"id":"1512.06890","title":"Stochastic Dual Ascent for Solving Linear Systems","created":"2015-12-21","cited_by_count":8},{"id":"2102.07214","title":"Communication-Efficient Distributed Optimization with Quantized Preconditioners","created":"2021-02-14","cited_by_count":8},{"id":"1905.12648","title":"Convergence of Distributed Stochastic Variance Reduced Methods without Sampling Extra Data","created":"2019-05-29","cited_by_count":7},{"id":"2103.09424","title":"Escaping Saddle Points in Distributed Newton's Method with Communication Efficiency and Byzantine Resilience","created":"2021-03-17","cited_by_count":3}],"next_cursor":null}