{"list":"other","total":56,"rows":[{"id":"1512.03385","title":"Deep Residual Learning for Image Recognition","created":"2015-12-10","cited_by_count":52096},{"id":"1810.04805","title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","created":"2018-10-11","cited_by_count":40399},{"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":"1607.00133","title":"Deep Learning with Differential Privacy","created":"2016-07-01","cited_by_count":2728},{"id":"1610.05492","title":"Federated Learning: Strategies for Improving Communication Efficiency","created":"2016-10-18","cited_by_count":1475},{"id":"1906.08935","title":"Deep Leakage from Gradients","created":"2019-06-21","cited_by_count":1021},{"id":"1803.01498","title":"Byzantine-Robust Distributed Learning: Towards Optimal Statistical Rates","created":"2018-03-05","cited_by_count":711},{"id":"1705.09056","title":"Can Decentralized Algorithms Outperform Centralized Algorithms? A Case Study for Decentralized Parallel Stochastic Gradient Descent","created":"2017-05-25","cited_by_count":502},{"id":"1712.01887","title":"Deep Gradient Compression: Reducing the Communication Bandwidth for Distributed Training","created":"2017-12-05","cited_by_count":478},{"id":"1809.07599","title":"Sparsified SGD with Memory","created":"2018-09-20","cited_by_count":376},{"id":"1912.13445","title":"Robust Aggregation for Federated Learning","created":"2019-12-31","cited_by_count":317},{"id":"1902.06156","title":"A Little Is Enough: Circumventing Defenses For Distributed Learning","created":"2019-02-16","cited_by_count":288},{"id":"1807.06629","title":"Parallel Restarted SGD with Faster Convergence and Less Communication: Demystifying Why Model Averaging Works for Deep Learning","created":"2018-07-17","cited_by_count":278},{"id":"1705.07878","title":"TernGrad: Ternary Gradients to Reduce Communication in Distributed Deep Learning","created":"2017-05-22","cited_by_count":256},{"id":"1704.05021","title":"Sparse Communication for Distributed Gradient Descent","created":"2017-04-17","cited_by_count":249},{"id":"1710.09854","title":"Gradient Sparsification for Communication-Efficient Distributed Optimization","created":"2017-10-26","cited_by_count":201},{"id":"1906.02367","title":"Qsparse-local-SGD: Distributed SGD with Quantization, Sparsification, and Local Computations","created":"2019-06-06","cited_by_count":181},{"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":"2007.07682","title":"FetchSGD: Communication-Efficient Federated Learning with Sketching","created":"2020-07-15","cited_by_count":179},{"id":"1811.03761","title":"RSA: Byzantine-Robust Stochastic Aggregation Methods for Distributed Learning from Heterogeneous Datasets","created":"2018-11-09","cited_by_count":149},{"id":"1610.02132","title":"QSGD: Communication-Efficient SGD via Gradient Quantization and Encoding","created":"2016-10-07","cited_by_count":147},{"id":"1903.03936","title":"Fall of Empires: Breaking Byzantine-tolerant SGD by Inner Product Manipulation","created":"2019-03-10","cited_by_count":141},{"id":"2012.10333","title":"Learning from History for Byzantine Robust Optimization","created":"2020-12-18","cited_by_count":137},{"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":"1905.05957","title":"DoubleSqueeze: Parallel Stochastic Gradient Descent with Double-Pass Error-Compensated Compression","created":"2019-05-15","cited_by_count":99},{"id":"1803.08917","title":"Byzantine Stochastic Gradient Descent","created":"2018-03-23","cited_by_count":81},{"id":"1806.08054","title":"Error Compensated Quantized SGD and its Applications to Large-scale Distributed Optimization","created":"2018-06-21","cited_by_count":76},{"id":"1803.09877","title":"DRACO: Byzantine-resilient Distributed Training via Redundant Gradients","created":"2018-03-27","cited_by_count":75},{"id":"2010.12292","title":"Linearly Converging Error Compensated SGD","created":"2020-10-23","cited_by_count":61},{"id":"1705.05491","title":"Distributed Statistical Machine Learning in Adversarial Settings: Byzantine Gradient Descent","created":"2017-05-16","cited_by_count":59},{"id":"2012.14368","title":"Byzantine-Resilient Non-Convex Stochastic Gradient Descent","created":"2020-12-28","cited_by_count":57},{"id":"1903.07020","title":"Zeno++: Robust Fully Asynchronous SGD","created":"2019-03-17","cited_by_count":53},{"id":"1905.12938","title":"Stochastic Sign Descent Methods: New Algorithms and Better Theory","created":"2019-05-30","cited_by_count":49},{"id":"2010.12460","title":"Adaptive Gradient Quantization for Data-Parallel SGD","created":"2020-10-23","cited_by_count":45},{"id":"1907.12205","title":"DETOX: A Redundancy-based Framework for Faster and More Robust Gradient Aggregation","created":"2019-07-29","cited_by_count":44},{"id":"2003.10637","title":"FedSel: Federated SGD under Local Differential Privacy with Top-k Dimension Selection","created":"2020-03-24","cited_by_count":36},{"id":"1806.05358","title":"Defending Against Saddle Point Attack in Byzantine-Robust Distributed Learning","created":"2018-06-14","cited_by_count":32},{"id":"1409.1458","title":"Communication-Efficient Distributed Dual Coordinate Ascent","created":"2014-09-04","cited_by_count":31},{"id":"2007.13221","title":"CSER: Communication-efficient SGD with Error Reset","created":"2020-07-26","cited_by_count":27},{"id":"2104.11125","title":"ScaleCom: Scalable Sparsified Gradient Compression for Communication-Efficient Distributed Training","created":"2021-04-21","cited_by_count":22},{"id":"1910.06093","title":"Election Coding for Distributed Learning: Protecting SignSGD against Byzantine Attacks","created":"2019-10-14","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":"2012.05433","title":"Communication-Computation Efficient Secure Aggregation for Federated Learning","created":"2020-12-10","cited_by_count":18},{"id":"1911.09721","title":"Communication-Efficient and Byzantine-Robust Distributed Learning with Error Feedback","created":"2019-11-21","cited_by_count":15},{"id":"2110.02940","title":"Secure Byzantine-Robust Distributed Learning via Clustering","created":"2021-10-06","cited_by_count":12},{"id":"1704.03540","title":"Distributed Proximal Gradient Algorithm for Partially Asynchronous Computer Clusters","created":"2017-04-11","cited_by_count":10},{"id":"2003.00010","title":"Distributed Momentum for Byzantine-resilient Learning","created":"2020-02-28","cited_by_count":10},{"id":"2010.04902","title":"ByzShield: An Efficient and Robust System for Distributed Training","created":"2020-10-10","cited_by_count":8},{"id":"2112.12872","title":"Sparsified Secure Aggregation for Privacy-Preserving Federated Learning","created":"2021-12-23","cited_by_count":8},{"id":"1909.11201","title":"Matrix Sketching for Secure Collaborative Machine Learning","created":"2019-09-24","cited_by_count":7},{"id":"1911.01812","title":"Enhancing the Privacy of Federated Learning with Sketching","created":"2019-11-05","cited_by_count":4},{"id":"1803.05621","title":"Proximal SCOPE for Distributed Sparse Learning: Better Data Partition Implies Faster Convergence Rate","created":"2018-03-15","cited_by_count":3},{"id":"1602.00133","title":"SCOPE: Scalable Composite Optimization for Learning on Spark","created":"2016-01-30","cited_by_count":2},{"id":"2010.01175","title":"Towards Bidirectional Protection in Federated Learning","created":"2020-10-02","cited_by_count":2}],"next_cursor":null}