{"list":"other","total":51,"rows":[{"id":"1512.03385","title":"Deep Residual Learning for Image Recognition","created":"2015-12-10","cited_by_count":52096},{"id":"1602.05629","title":"Communication-Efficient Learning of Deep Networks from Decentralized Data","created":"2016-02-17","cited_by_count":7669},{"id":"1708.07747","title":"Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithms","created":"2017-08-25","cited_by_count":4349},{"id":"1812.06127","title":"Federated Optimization in Heterogeneous Networks","created":"2018-12-14","cited_by_count":2987},{"id":"1903.12261","title":"Benchmarking Neural Network Robustness to Common Corruptions and Perturbations","created":"2019-03-28","cited_by_count":2877},{"id":"1706.02677","title":"Accurate, Large Minibatch SGD: Training ImageNet in 1 Hour","created":"2017-06-08","cited_by_count":1492},{"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":"1907.02189","title":"On the Convergence of FedAvg on Non-IID Data","created":"2019-07-04","cited_by_count":1229},{"id":"1712.05526","title":"Targeted Backdoor Attacks on Deep Learning Systems Using Data Poisoning","created":"2017-12-15","cited_by_count":1055},{"id":"1803.01498","title":"Byzantine-Robust Distributed Learning: Towards Optimal Statistical Rates","created":"2018-03-05","cited_by_count":711},{"id":"1805.09767","title":"Local SGD Converges Fast and Communicates Little","created":"2018-05-24","cited_by_count":605},{"id":"1802.04434","title":"signSGD: Compressed Optimisation for Non-Convex Problems","created":"2018-02-13","cited_by_count":571},{"id":"1608.04636","title":"Linear Convergence of Gradient and Proximal-Gradient Methods Under the Polyak-\\L{}ojasiewicz Condition","created":"2016-08-16","cited_by_count":539},{"id":"1811.00636","title":"Spectral Signatures in Backdoor Attacks","created":"2018-11-01","cited_by_count":484},{"id":"1809.07599","title":"Sparsified SGD with Memory","created":"2018-09-20","cited_by_count":376},{"id":"1611.01838","title":"Entropy-SGD: Biasing Gradient Descent Into Wide Valleys","created":"2016-11-06","cited_by_count":359},{"id":"1802.07927","title":"The Hidden Vulnerability of Distributed Learning in Byzantium","created":"2018-02-22","cited_by_count":329},{"id":"1912.13445","title":"Robust Aggregation for Federated Learning","created":"2019-12-31","cited_by_count":317},{"id":"1901.09847","title":"Error Feedback Fixes SignSGD and other Gradient Compression Schemes","created":"2019-01-28","cited_by_count":310},{"id":"2007.08432","title":"Data Poisoning Attacks Against Federated Learning Systems","created":"2020-07-16","cited_by_count":275},{"id":"1809.10505","title":"The Convergence of Sparsified Gradient Methods","created":"2018-09-27","cited_by_count":229},{"id":"1604.06443","title":"Robust Estimators in High Dimensions without the Computational Intractability","created":"2016-04-21","cited_by_count":209},{"id":"1906.02367","title":"Qsparse-local-SGD: Distributed SGD with Quantization, Sparsification, and Local Computations","created":"2019-06-06","cited_by_count":181},{"id":"2007.01154","title":"Federated Learning with Compression: Unified Analysis and Sharp Guarantees","created":"2020-07-02","cited_by_count":160},{"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":"1808.10307","title":"Backdoor Embedding in Convolutional Neural Network Models via Invisible Perturbation","created":"2018-08-30","cited_by_count":134},{"id":"1803.02815","title":"Sever: A Robust Meta-Algorithm for Stochastic Optimization","created":"2018-03-07","cited_by_count":125},{"id":"1911.05911","title":"Recent Advances in Algorithmic High-Dimensional Robust Statistics","created":"2019-11-14","cited_by_count":101},{"id":"1907.04232","title":"Unified Optimal Analysis of the (Stochastic) Gradient Method","created":"2019-07-09","cited_by_count":82},{"id":"1803.08917","title":"Byzantine Stochastic Gradient Descent","created":"2018-03-23","cited_by_count":81},{"id":"1912.12716","title":"Federated Variance-Reduced Stochastic Gradient Descent with Robustness to Byzantine Attacks","created":"2019-12-29","cited_by_count":79},{"id":"1803.09877","title":"DRACO: Byzantine-resilient Distributed Training via Redundant Gradients","created":"2018-03-27","cited_by_count":75},{"id":"1705.05491","title":"Distributed Statistical Machine Learning in Adversarial Settings: Byzantine Gradient Descent","created":"2017-05-16","cited_by_count":59},{"id":"1911.08772","title":"Understanding Top-k Sparsification in Distributed Deep Learning","created":"2019-11-20","cited_by_count":56},{"id":"2012.04061","title":"Faster Non-Convex Federated Learning via Global and Local Momentum","created":"2020-12-07","cited_by_count":48},{"id":"1908.08098","title":"BRIDGE: Byzantine-resilient Decentralized Gradient Descent","created":"2019-08-21","cited_by_count":45},{"id":"1703.04940","title":"Resilience: A Criterion for Learning in the Presence of Arbitrary Outliers","created":"2017-03-15","cited_by_count":43},{"id":"1506.00552","title":"Coordinate Descent Converges Faster with the Gauss-Southwell Rule Than Random Selection","created":"2015-06-01","cited_by_count":39},{"id":"1606.05225","title":"Geometric Median in Nearly Linear Time","created":"2016-06-16","cited_by_count":39},{"id":"1805.02632","title":"Stochastic Quasi-Gradient Methods: Variance Reduction via Jacobian Sketching","created":"2018-05-07","cited_by_count":34},{"id":"1512.09103","title":"Even Faster Accelerated Coordinate Descent Using Non-Uniform Sampling","created":"2015-12-30","cited_by_count":23},{"id":"1911.07956","title":"Implicit Regularization and Convergence for Weight Normalization","created":"2019-11-18","cited_by_count":20},{"id":"2005.07866","title":"Byzantine-Resilient SGD in High Dimensions on Heterogeneous Data","created":"2020-05-16","cited_by_count":17},{"id":"1409.5937","title":"Distributed Robust Learning","created":"2014-09-21","cited_by_count":13},{"id":"1909.04532","title":"Byzantine-Resilient Stochastic Gradient Descent for Distributed Learning: A Lipschitz-Inspired Coordinate-wise Median Approach","created":"2019-09-10","cited_by_count":13},{"id":"1305.2581","title":"Accelerated Mini-Batch Stochastic Dual Coordinate Ascent","created":"2013-05-12","cited_by_count":11},{"id":"1810.06999","title":"Efficient Greedy Coordinate Descent for Composite Problems","created":"2018-10-16","cited_by_count":8},{"id":"1505.04343","title":"Provably Correct Algorithms for Matrix Column Subset Selection with Selectively Sampled Data","created":"2015-05-17","cited_by_count":6},{"id":"2008.04699","title":"Byzantine Fault-Tolerant Distributed Machine Learning Using Stochastic Gradient Descent (SGD) and Norm-Based Comparative Gradient Elimination (CGE)","created":"2020-08-11","cited_by_count":4},{"id":"1606.00269","title":"New Analysis of Linear Convergence of Gradient-type Methods via Unifying Error Bound Conditions","created":"2016-06-01","cited_by_count":3},{"id":"1706.08427","title":"Approximate Steepest Coordinate Descent","created":"2017-06-26","cited_by_count":2}],"next_cursor":null}