mlsanityData to 7 Oct 2026

Training Latency Minimization for Model-Splitting Allowed Federated Edge Learning

arXiv 2307.11532 ↗First posted 21 Jul 2023cs.LG cs.CY cs.DCcited by 3

Not on the map. Why?

Abstract (arXiv)

To alleviate the shortage of computing power faced by clients in training deep neural networks (DNNs) using federated learning (FL), we leverage the edge computing and split learning to propose a model-splitting allowed FL (SFL) framework, with the aim to minimize the training latency without loss of test accuracy. Under the synchronized global update setting, the latency to complete a round of global training is determined by the maximum latency for the clients to complete a local training session. Therefore, the training latency minimization problem (TLMP) is modelled as a minimizing-maximum problem. To solve this mixed integer nonlinear programming problem, we first propose a regression method to fit the quantitative-relationship between the cut-layer and other parameters of an AI-model, and thus, transform the TLMP into a continuous problem. Considering that the two subproblems involved in the TLMP, namely, the cut-layer selection problem for the clients and the computing resource allocation problem for the parameter-server are relative independence, an alternate-optimization-based algorithm with polynomial time complexity is developed to obtain a high-quality solution to the TLMP. Extensive experiments are performed on a popular DNN-model EfficientNetV2 using dataset MNIST, and the results verify the validity and improved performance of the proposed SFL framework.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 21 of its 46 references that are in the map. First posted on arXiv 21 Jul 2023.

Builds on

21 of 46 references.

References · 21

  1. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
  2. 2021Convex optimizationcited by 2,479
  3. 2021EfficientNetV2: Smaller Models and Faster Trainingcited by 1,127
  4. 2019Measuring the Effects of Non-Identical Data Distribution for Federated Visual Classificationcited by 836
  5. 2016Federated Optimization: Distributed Machine Learning for On-Device Intelligencecited by 558
  6. 2018Split learning for health: Distributed deep learning without sharing raw patient datacited by 391
  7. 2018Client Selection for Federated Learning with Heterogeneous Resources in Mobile Edgecited by 347
  8. 2018Distributed learning of deep neural network over multiple agentscited by 277
  9. 2019Federated Learning over Wireless Networks: Convergence Analysis and Resource Allocationcited by 93
  10. 2018JointDNN: An Efficient Training and Inference Engine for Intelligent Mobile Cloud Computing Servicescited by 79
  11. 2022Split Learning over Wireless Networks: Parallel Design and Resource Managementcited by 74
  12. 2020An Efficiency-boosting Client Selection Scheme for Federated Learning with Fairness Guaranteecited by 61
9 more
  1. 2021Federated Dropout -- A Simple Approach for Enabling Federated Learning on Resource Constrained Devicescited by 56
  2. 2021UnSplit: Data-Oblivious Model Inversion, Model Stealing, and Label Inference Attacks Against Split Learningcited by 52
  3. 2021FedAdapt: Adaptive Offloading for IoT Devices in Federated Learningcited by 26
  4. 2022Low-latency Federated Learning with DNN Partition in Distributed Industrial IoT Networkscited by 13
  5. 2022Synthesizing Dysarthric Speech Using Multi-talker TTS for Dysarthric Speech Recognitioncited by 10
  6. 2021Energy-Efficient Model Compression and Splitting for Collaborative Inference Over Time-Varying Channelscited by 4
  7. 2022Privacy-preserving Online AutoML for Domain-Specific Face Detectioncited by 4
  8. 2021JMSNAS: Joint Model Split and Neural Architecture Search for Learning over Mobile Edge Networkscited by 3
  9. 2021Private and Utility Enhanced Recommendations with Local Differential Privacy and Gaussian Mixture Modelcited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 1; 2025: 1; 2026: 1.

3 papers.