{"list":"other","total":77,"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":"1812.06127","title":"Federated Optimization in Heterogeneous Networks","created":"2018-12-14","cited_by_count":2987},{"id":"1606.04838","title":"Optimization Methods for Large-Scale Machine Learning","created":"2016-06-15","cited_by_count":1150},{"id":"2007.07481","title":"Tackling the Objective Inconsistency Problem in Heterogeneous Federated Optimization","created":"2020-07-15","cited_by_count":906},{"id":"1309.5549","title":"Stochastic First- and Zeroth-order Methods for Nonconvex Stochastic Programming","created":"2013-09-22","cited_by_count":724},{"id":"1803.01498","title":"Byzantine-Robust Distributed Learning: Towards Optimal Statistical Rates","created":"2018-03-05","cited_by_count":711},{"id":"1809.07599","title":"Sparsified SGD with Memory","created":"2018-09-20","cited_by_count":376},{"id":"2003.10422","title":"A Unified Theory of Decentralized SGD with Changing Topology and Local Updates","created":"2020-03-23","cited_by_count":367},{"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":"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":"2010.01243","title":"Client Selection in Federated Learning: Convergence Analysis and Power-of-Choice Selection Strategies","created":"2020-10-03","cited_by_count":198},{"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":"2301.11235","title":"Handbook of Convergence Theorems for (Stochastic) Gradient Methods","created":"2023-01-26","cited_by_count":163},{"id":"2007.01154","title":"Federated Learning with Compression: Unified Analysis and Sharp Guarantees","created":"2020-07-02","cited_by_count":160},{"id":"2008.03606","title":"Mime: Mimicking Centralized Stochastic Algorithms in Federated Learning","created":"2020-08-08","cited_by_count":154},{"id":"1712.06559","title":"The Power of Interpolation: Understanding the Effectiveness of SGD in Modern Over-parametrized Learning","created":"2017-12-18","cited_by_count":150},{"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":"2005.11418","title":"FedPD: A Federated Learning Framework with Optimal Rates and Adaptivity to Non-IID Data","created":"2020-05-22","cited_by_count":144},{"id":"1810.07288","title":"Fast and Faster Convergence of SGD for Over-Parameterized Models and an Accelerated Perceptron","created":"2018-10-16","cited_by_count":143},{"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":"2006.09365","title":"Byzantine-Robust Learning on Heterogeneous Datasets via Bucketing","created":"2020-06-16","cited_by_count":128},{"id":"2010.13723","title":"Optimal Client Sampling for Federated Learning","created":"2020-10-26","cited_by_count":124},{"id":"1905.09997","title":"Painless Stochastic Gradient: Interpolation, Line-Search, and Convergence Rates","created":"2019-05-24","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":"1901.09269","title":"Distributed Learning with Compressed Gradient Differences","created":"2019-01-26","cited_by_count":112},{"id":"1805.11454","title":"Distributed Stochastic Gradient Tracking Methods","created":"2018-05-25","cited_by_count":106},{"id":"2308.08165","title":"Stochastic Controlled Averaging for Federated Learning with Communication Compression","created":"2023-08-16","cited_by_count":101},{"id":"2105.05883","title":"Clustered Sampling: Low-Variance and Improved Representativity for Clients Selection in Federated Learning","created":"2021-05-12","cited_by_count":93},{"id":"1803.08917","title":"Byzantine Stochastic Gradient Descent","created":"2018-03-23","cited_by_count":81},{"id":"2206.08307","title":"Sharper Convergence Guarantees for Asynchronous SGD for Distributed and Federated Learning","created":"2022-06-16","cited_by_count":79},{"id":"2106.10874","title":"FedCM: Federated Learning with Client-level Momentum","created":"2021-06-21","cited_by_count":77},{"id":"1803.09877","title":"DRACO: Byzantine-resilient Distributed Training via Redundant Gradients","created":"2018-03-27","cited_by_count":75},{"id":"2106.04159","title":"Fast Federated Learning in the Presence of Arbitrary Device Unavailability","created":"2021-06-08","cited_by_count":72},{"id":"2302.01772","title":"Fixing by Mixing: A Recipe for Optimal Byzantine ML under Heterogeneity","created":"2023-02-03","cited_by_count":65},{"id":"2207.14130","title":"FedVARP: Tackling the Variance Due to Partial Client Participation in Federated Learning","created":"2022-07-28","cited_by_count":64},{"id":"2205.12173","title":"Byzantine Machine Learning Made Easy by Resilient Averaging of Momentums","created":"2022-05-24","cited_by_count":63},{"id":"2206.07638","title":"Asynchronous SGD Beats Minibatch SGD Under Arbitrary Delays","created":"2022-06-15","cited_by_count":63},{"id":"2012.14368","title":"Byzantine-Resilient Non-Convex Stochastic Gradient Descent","created":"2020-12-28","cited_by_count":57},{"id":"1806.06573","title":"Distributed learning with compressed gradients","created":"2018-06-18","cited_by_count":55},{"id":"1308.6370","title":"Fast Convergence of Stochastic Gradient Descent under a Strong Growth Condition","created":"2013-08-29","cited_by_count":54},{"id":"1506.02186","title":"A Universal Catalyst for First-Order Optimization","created":"2015-06-06","cited_by_count":54},{"id":"2008.00742","title":"Collaborative Learning in the Jungle (Decentralized, Byzantine, Heterogeneous, Asynchronous and Nonconvex Learning)","created":"2020-08-03","cited_by_count":54},{"id":"1903.07020","title":"Zeno++: Robust Fully Asynchronous SGD","created":"2019-03-17","cited_by_count":53},{"id":"1812.04529","title":"On the Ineffectiveness of Variance Reduced Optimization for Deep Learning","created":"2018-12-11","cited_by_count":48},{"id":"2101.09545","title":"Acceleration Methods","created":"2021-01-23","cited_by_count":48},{"id":"2205.13648","title":"A Unified Analysis of Federated Learning with Arbitrary Client Participation","created":"2022-05-26","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":"2010.03246","title":"Optimal Gradient Compression for Distributed and Federated Learning","created":"2020-10-07","cited_by_count":39},{"id":"2306.16504","title":"Momentum Benefits Non-IID Federated Learning Simply and Provably","created":"2023-06-28","cited_by_count":38},{"id":"2202.01545","title":"Byzantine-Robust Decentralized Learning via ClippedGossip","created":"2022-02-03","cited_by_count":31},{"id":"2305.15155","title":"Momentum Provably Improves Error Feedback!","created":"2023-05-24","cited_by_count":31},{"id":"1605.09774","title":"Asynchrony begets Momentum, with an Application to Deep Learning","created":"2016-05-31","cited_by_count":30},{"id":"2205.11765","title":"Byzantine-Robust Federated Learning with Optimal Statistical Rates and Privacy Guarantees","created":"2022-05-24","cited_by_count":30},{"id":"2212.06325","title":"AFLGuard: Byzantine-robust Asynchronous Federated Learning","created":"2022-12-13","cited_by_count":29},{"id":"2006.13041","title":"Byzantine-Resilient High-Dimensional Federated Learning","created":"2020-06-22","cited_by_count":27},{"id":"2309.13591","title":"Robust Distributed Learning: Tight Error Bounds and Breakdown Point under Data Heterogeneity","created":"2023-09-24","cited_by_count":26},{"id":"2302.00620","title":"Local Exact-Diffusion for Decentralized Optimization and Learning","created":"2023-02-01","cited_by_count":24},{"id":"2106.08882","title":"Robust Training in High Dimensions via Block Coordinate Geometric Median Descent","created":"2021-06-16","cited_by_count":20},{"id":"2209.15505","title":"Momentum Tracking: Momentum Acceleration for Decentralized Deep Learning on Heterogeneous Data","created":"2022-09-30","cited_by_count":20},{"id":"1910.04920","title":"Fast and Furious Convergence: Stochastic Second Order Methods under Interpolation","created":"2019-10-11","cited_by_count":18},{"id":"2005.07866","title":"Byzantine-Resilient SGD in High Dimensions on Heterogeneous Data","created":"2020-05-16","cited_by_count":17},{"id":"1909.12340","title":"At Stability's Edge: How to Adjust Hyperparameters to Preserve Minima Selection in Asynchronous Training of Neural Networks?","created":"2019-09-26","cited_by_count":16},{"id":"2402.12780","title":"Byzantine-Robust Federated Learning: Impact of Client Subsampling and Local Updates","created":"2024-02-20","cited_by_count":14},{"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":"2107.12211","title":"A General Theory for Client Sampling in Federated Learning","created":"2021-07-26","cited_by_count":8},{"id":"2410.10418","title":"Unified Breakdown Analysis for Byzantine Robust Gossip","created":"2024-10-14","cited_by_count":8},{"id":"2407.07084","title":"Stabilized Proximal-Point Methods for Federated Optimization","created":"2024-07-09","cited_by_count":7},{"id":"2503.16337","title":"Optimal Complexity in Byzantine-Robust Distributed Stochastic Optimization with Data Heterogeneity","created":"2025-03-20","cited_by_count":6},{"id":"2311.14127","title":"Byzantine Robustness and Partial Participation Can Be Achieved at Once: Just Clip Gradient Differences","created":"2023-11-23","cited_by_count":5},{"id":"2407.19234","title":"Ordered Momentum for Asynchronous SGD","created":"2024-07-27","cited_by_count":5},{"id":"2003.00937","title":"Buffered Asynchronous SGD for Byzantine Learning","created":"2020-03-02","cited_by_count":4},{"id":"2405.14759","title":"Fault Tolerant ML: Efficient Meta-Aggregation and Synchronous Training","created":"2024-05-23","cited_by_count":3},{"id":"2501.09621","title":"Weight for Robustness: A Comprehensive Approach towards Optimal Fault-Tolerant Asynchronous ML","created":"2025-01-16","cited_by_count":2}],"next_cursor":null}