mlsanityData to 14 Oct 2026

AdaptCL: Efficient Collaborative Learning with Dynamic and Adaptive Pruning

arXiv 2106.14126 ↗First posted 27 Jun 2021cs.LG cs.DCcited by 4

Not on the map. Why?

Abstract (arXiv)

In multi-party collaborative learning, the parameter server sends a global model to each data holder for local training and then aggregates committed models globally to achieve privacy protection. However, both the dragger issue of synchronous collaborative learning and the staleness issue of asynchronous collaborative learning make collaborative learning inefficient in real-world heterogeneous environments. We propose a novel and efficient collaborative learning framework named AdaptCL, which generates an adaptive sub-model dynamically from the global base model for each data holder, without any prior information about worker capability. All workers (data holders) achieve approximately identical update time as the fastest worker by equipping them with capability-adapted pruned models. Thus the training process can be dramatically accelerated. Besides, we tailor the efficient pruned rate learning algorithm and pruning approach for AdaptCL. Meanwhile, AdaptCL provides a mechanism for handling the trade-off between accuracy and time overhead and can be combined with other techniques to accelerate training further. Empirical results show that AdaptCL introduces little computing and communication overhead. AdaptCL achieves time savings of more than 41% on average and improves accuracy in a low heterogeneous environment. In a highly heterogeneous environment, AdaptCL achieves a training speedup of 6.2x with a slight loss of accuracy.

Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 43 of its 58 references that are in the map. First posted on arXiv 27 Jun 2021.

Builds on

43 of 58 references.

References · 43

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
  3. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,669
  4. 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 7,005
  5. 2017MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applicationscited by 3,845
  6. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
  7. 2016Federated Learning: Strategies for Improving Communication Efficiencycited by 1,475
  8. 2019On the Convergence of FedAvg on Non-IID Datacited by 1,229
  9. 2017ShuffleNet: An Extremely Efficient Convolutional Neural Network for Mobile Devicescited by 1,200
  10. 2016Pruning Filters for Efficient ConvNetscited by 1,143
  11. 2018ShuffleNet V2: Practical Guidelines for Efficient CNN Architecture Designcited by 1,136
  12. 2017Learning Efficient Convolutional Networks through Network Slimmingcited by 676
31 more
  1. 2017Deep Gradient Compression: Reducing the Communication Bandwidth for Distributed Trainingcited by 478
  2. 2018Adaptive Federated Learning in Resource Constrained Edge Computing Systemscited by 409
  3. 2018Filter Pruning via Geometric Median for Deep Convolutional Neural Networks Accelerationcited by 367
  4. 2020HeteroFL: Computation and Communication Efficient Federated Learning for Heterogeneous Clientscited by 337
  5. 2018Soft Filter Pruning for Accelerating Deep Convolutional Neural Networkscited by 315
  6. 2016EIE: Efficient Inference Engine on Compressed Deep Neural Networkcited by 295
  7. 2020HRank: Filter Pruning using High-Rank Feature Mapcited by 292
  8. 2018Parallel Restarted SGD with Faster Convergence and Less Communication: Demystifying Why Model Averaging Works for Deep Learningcited by 278
  9. 2019Asynchronous Federated Optimizationcited by 267
  10. 2017TernGrad: Ternary Gradients to Reduce Communication in Distributed Deep Learningcited by 256
  11. 2020Understanding the Role of Individual Units in a Deep Neural Networkcited by 255
  12. 2016Network Trimming: A Data-Driven Neuron Pruning Approach towards Efficient Deep Architecturescited by 221
  13. 2019Deconstructing Lottery Tickets: Zeros, Signs, and the Supermaskcited by 207
  14. 2017Data-Driven Sparse Structure Selection for Deep Neural Networkscited by 181
  15. 2018Expanding the Reach of Federated Learning by Reducing Client Resource Requirementscited by 163
  16. 2020Soft Threshold Weight Reparameterization for Learnable Sparsitycited by 151
  17. 2019Towards Optimal Structured CNN Pruning via Generative Adversarial Learningcited by 146
  18. 2018Learning Scheduling Algorithms for Data Processing Clusterscited by 134
  19. 2020Dynamic Model Pruning with Feedbackcited by 125
  20. 2019Gate Decorator: Global Filter Pruning Method for Accelerating Deep Convolutional Neural Networkscited by 118
  21. 2018Rethinking the Smaller-Norm-Less-Informative Assumption in Channel Pruning of Convolution Layerscited by 112
  22. 2016Asynchronous Stochastic Gradient Descent with Delay Compensationcited by 99
  23. 2019Towards Efficient Model Compression via Learned Global Rankingcited by 75
  24. 2020Lookahead: A Far-Sighted Alternative of Magnitude-based Pruningcited by 61
  25. 2019PruneTrain: Fast Neural Network Training by Dynamic Sparse Model Reconfigurationcited by 41
  26. 2016Faster CNNs with Direct Sparse Convolutions and Guided Pruningcited by 39
  27. 2020Synthetic Learning: Learn From Distributed Asynchronized Discriminator GAN Without Sharing Medical Image Datacited by 38
  28. 2019Learning Sparse Sharing Architectures for Multiple Taskscited by 31
  29. 2020Towards Non-I.I.D. and Invisible Data with FedNAS: Federated Deep Learning via Neural Architecture Searchcited by 30
  30. 2018Toward Understanding the Impact of Staleness in Distributed Machine Learningcited by 29
  31. 2014High-Performance Distributed ML at Scale through Parameter Server Consistency Modelscited by 10

Built on by

Cited by year

Citing papers per year: 2021: 2; 2022: 0; 2023: 0; 2024: 2.

4 papers.