{"list":"other","total":55,"rows":[{"id":"1602.05629","title":"Communication-Efficient Learning of Deep Networks from Decentralized Data","created":"2016-02-17","cited_by_count":7669},{"id":"1605.07146","title":"Wide Residual Networks","created":"2016-05-23","cited_by_count":3070},{"id":"1803.03635","title":"The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networks","created":"2018-03-09","cited_by_count":2262},{"id":"1506.02626","title":"Learning both Weights and Connections for Efficient Neural Networks","created":"2015-06-08","cited_by_count":2031},{"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":"1907.02189","title":"On the Convergence of FedAvg on Non-IID Data","created":"2019-07-04","cited_by_count":1229},{"id":"1802.01548","title":"Regularized Evolution for Image Classifier Architecture Search","created":"2018-02-05","cited_by_count":909},{"id":"1902.01046","title":"Towards Federated Learning at Scale: System Design","created":"2019-02-04","cited_by_count":832},{"id":"1810.02340","title":"SNIP: Single-shot Network Pruning based on Connection Sensitivity","created":"2018-10-04","cited_by_count":812},{"id":"1805.09767","title":"Local SGD Converges Fast and Communicates Little","created":"2018-05-24","cited_by_count":605},{"id":"1710.01878","title":"To prune, or not to prune: exploring the efficacy of pruning for model compression","created":"2017-10-05","cited_by_count":603},{"id":"1810.05270","title":"Rethinking the Value of Network Pruning","created":"2018-10-11","cited_by_count":599},{"id":"2003.03033","title":"What is the State of Neural Network Pruning?","created":"2020-03-06","cited_by_count":583},{"id":"1911.11134","title":"Rigging the Lottery: Making All Tickets Winners","created":"2019-11-25","cited_by_count":495},{"id":"1804.05271","title":"Adaptive Federated Learning in Resource Constrained Edge Computing Systems","created":"2018-04-14","cited_by_count":409},{"id":"1909.11875","title":"Federated Learning in Mobile Edge Networks: A Comprehensive Survey","created":"2019-09-26","cited_by_count":408},{"id":"2010.01264","title":"HeteroFL: Computation and Communication Efficient Federated Learning for Heterogeneous Clients","created":"2020-10-03","cited_by_count":337},{"id":"2004.12088","title":"SplitFed: When Federated Learning Meets Split Learning","created":"2020-04-25","cited_by_count":310},{"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":"1608.04493","title":"Dynamic Network Surgery for Efficient DNNs","created":"2016-08-16","cited_by_count":233},{"id":"1711.05908","title":"NISP: Pruning Networks using Neuron Importance Score Propagation","created":"2017-11-16","cited_by_count":228},{"id":"1909.12326","title":"Model Pruning Enables Efficient Federated Learning on Edge Devices","created":"2019-09-26","cited_by_count":222},{"id":"2102.13451","title":"FjORD: Fair and Accurate Federated Learning under heterogeneous targets with Ordered Dropout","created":"2021-02-26","cited_by_count":192},{"id":"1902.05967","title":"Parameter Efficient Training of Deep Convolutional Neural Networks by Dynamic Sparse Reparameterization","created":"2019-02-15","cited_by_count":189},{"id":"1812.07210","title":"Expanding the Reach of Federated Learning by Reducing Client Resource Requirements","created":"2018-12-18","cited_by_count":163},{"id":"1711.05136","title":"Deep Rewiring: Training very sparse deep networks","created":"2017-11-14","cited_by_count":139},{"id":"2006.07253","title":"Dynamic Model Pruning with Feedback","created":"2020-06-12","cited_by_count":125},{"id":"1808.07576","title":"Cooperative SGD: A unified Framework for the Design and Analysis of Communication-Efficient SGD Algorithms","created":"2018-08-22","cited_by_count":106},{"id":"1906.02773","title":"One ticket to win them all: generalizing lottery ticket initializations across datasets and optimizers","created":"2019-06-06","cited_by_count":102},{"id":"2212.01548","title":"FedRolex: Model-Heterogeneous Federated Learning with Rolling Sub-Model Extraction","created":"2022-12-03","cited_by_count":102},{"id":"1903.04488","title":"Communication-efficient distributed SGD with Sketching","created":"2019-03-12","cited_by_count":81},{"id":"2001.04756","title":"Adaptive Gradient Sparsification for Efficient Federated Learning: An Online Learning Approach","created":"2020-01-14","cited_by_count":81},{"id":"1810.08313","title":"Adaptive Communication Strategies to Achieve the Best Error-Runtime Trade-off in Local-Update SGD","created":"2018-10-19","cited_by_count":77},{"id":"1704.05119","title":"Exploring Sparsity in Recurrent Neural Networks","created":"2017-04-17","cited_by_count":75},{"id":"2012.08336","title":"Cost-Effective Federated Learning Design","created":"2020-12-15","cited_by_count":62},{"id":"2205.13648","title":"A Unified Analysis of Federated Learning with Arbitrary Client Participation","created":"2022-05-26","cited_by_count":45},{"id":"2212.00974","title":"Faster Adaptive Federated Learning","created":"2022-12-02","cited_by_count":35},{"id":"1805.10222","title":"Graph Oracle Models, Lower Bounds, and Gaps for Parallel Stochastic Optimization","created":"2018-05-25","cited_by_count":34},{"id":"2111.14655","title":"FedHM: Efficient Federated Learning for Heterogeneous Models via Low-rank Factorization","created":"2021-11-29","cited_by_count":31},{"id":"2201.02932","title":"A Multi-agent Reinforcement Learning Approach for Efficient Client Selection in Federated Learning","created":"2022-01-09","cited_by_count":31},{"id":"2106.09857","title":"Effective Model Sparsification by Scheduled Grow-and-Prune Methods","created":"2021-06-18","cited_by_count":26},{"id":"2302.10418","title":"MAC-PO: Multi-Agent Experience Replay via Collective Priority Optimization","created":"2023-02-21","cited_by_count":20},{"id":"2210.01969","title":"Option-Aware Adversarial Inverse Reinforcement Learning for Robotic Control","created":"2022-10-05","cited_by_count":16},{"id":"1912.01684","title":"Helios: Heterogeneity-Aware Federated Learning with Dynamically Balanced Collaboration","created":"2019-12-03","cited_by_count":15},{"id":"2201.01247","title":"Value Functions Factorization with Latent State Information Sharing in Decentralized Multi-Agent Policy Gradients","created":"2022-01-04","cited_by_count":12},{"id":"2210.06635","title":"A Bayesian Optimization Framework for Finding Local Optima in Expensive Multi-Modal Functions","created":"2022-10-13","cited_by_count":12},{"id":"2208.09432","title":"Federated Select: A Primitive for Communication- and Memory-Efficient Federated Learning","created":"2022-08-19","cited_by_count":11},{"id":"2306.07542","title":"A Versatile Multi-Agent Reinforcement Learning Benchmark for Inventory Management","created":"2023-06-13","cited_by_count":10},{"id":"2310.03613","title":"Solving a Class of Non-Convex Minimax Optimization in Federated Learning","created":"2023-10-05","cited_by_count":10},{"id":"2307.11629","title":"Scalable Multi-agent Covering Option Discovery based on Kronecker Graphs","created":"2023-07-21","cited_by_count":9},{"id":"2306.00187","title":"AccMER: Accelerating Multi-Agent Experience Replay with Cache Locality-aware Prioritization","created":"2023-05-31","cited_by_count":7},{"id":"2212.07684","title":"Multi-Agent Reinforcement Learning with Shared Resources for Inventory Management","created":"2022-12-15","cited_by_count":5},{"id":"2310.02524","title":"Federated Conditional Stochastic Optimization","created":"2023-10-04","cited_by_count":4},{"id":"2308.03035","title":"Serverless Federated AUPRC Optimization for Multi-Party Collaborative Imbalanced Data Mining","created":"2023-08-06","cited_by_count":3}],"next_cursor":null}