FedSkipTwin: Digital-Twin-Guided Client Skipping for Communication-Efficient Federated Learning

• URL: http://arxiv.org/abs/2507.13624v1
• Date: Fri, 18 Jul 2025 03:39:08 GMT
• Title: FedSkipTwin: Digital-Twin-Guided Client Skipping for Communication-Efficient Federated Learning
• Abstract summary: Communication overhead remains a primary bottleneck in federated learning (FL)<n>This work introduces FedSkipTwin, a novel client-skipping algorithm driven by lightweight, server-side digital twins.<n>Experiments are conducted on the UCI-HAR and MNIST datasets with 10 clients under a non-IID data distribution.
• Score: 2.209918162717035
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Communication overhead remains a primary bottleneck in federated learning (FL), particularly for applications involving mobile and IoT devices with constrained bandwidth. This work introduces FedSkipTwin, a novel client-skipping algorithm driven by lightweight, server-side digital twins. Each twin, implemented as a simple LSTM, observes a client's historical sequence of gradient norms to forecast both the magnitude and the epistemic uncertainty of its next update. The server leverages these predictions, requesting communication only when either value exceeds a predefined threshold; otherwise, it instructs the client to skip the round, thereby saving bandwidth. Experiments are conducted on the UCI-HAR and MNIST datasets with 10 clients under a non-IID data distribution. The results demonstrate that FedSkipTwin reduces total communication by 12-15.5% across 20 rounds while simultaneously improving final model accuracy by up to 0.5 percentage points compared to the standard FedAvg algorithm. These findings establish that prediction-guided skipping is a practical and effective strategy for resource-aware FL in bandwidth-constrained edge environments.

Related papers

• FedLBW: A Loss-Based Weighting Strategy for Federated Learning on Non-IID Data in Wireless Networks [2.4851820343103035]
  Federated Learning (FL) enables collaborative machine learning (ML) across distributed clients while preserving privacy.<n>Traditional FL algorithms, such as FedAvg, rely solely on dataset size to weight client updates.<n>We propose Federated Learning with Loss-Based Weighting (FedLBW), a novel aggregation method that assigns each client's update a weight proportional to the inverse of its validation loss.
  arXiv  Detail & Related papers  (2026-08-07T09:21:37Z)
• FedEMA-Distill: Exponential Moving Average Guided Knowledge Distillation for Robust Federated Learning [1.1393603788068776]
  Federated learning (FL) often degrades when clients hold heterogeneous non-Independent and Identically Distributed (non-IID) data.<n>This paper proposes FedEMA-Distill, a server-side procedure that combines an exponential moving average (EMA) of the global model with ensemble knowledge distillation from client-uploaded prediction logits.
  arXiv  Detail & Related papers  (2026-02-15T01:40:45Z)
• Benchmarking Federated Learning for Throughput Prediction in 5G Live Streaming Applications [5.026196568145574]
  This paper presents the first comprehensive benchmarking of federated learning strategies for throughput prediction in realistic 5G edge scenarios.<n>It is found that FedBN consistently delivers robust performance under non-IID conditions.<n>LSTM and Transformer models outperform CNN-based baselines by up to 80% in R2 scores.
  arXiv  Detail & Related papers  (2025-08-11T21:27:40Z)
• ACCESS-FL: Agile Communication and Computation for Efficient Secure Aggregation in Stable Federated Learning Networks [26.002975401820887]
  Federated Learning (FL) is a distributed learning framework designed for privacy-aware applications. Traditional FL approaches risk exposing sensitive client data when plain model updates are transmitted to the server. Google's Secure Aggregation (SecAgg) protocol addresses this threat by employing a double-masking technique. We propose ACCESS-FL, a communication-and-computation-efficient secure aggregation method.
  arXiv  Detail & Related papers  (2024-09-03T09:03:38Z)
• Communication-Efficient Federated Learning with Adaptive Compression under Dynamic Bandwidth [6.300376113680886]
  Federated learning can train models without directly providing local data to the server. Recent scholars have achieved the communication efficiency of federated learning mainly by model compression. We show the performance of AdapComFL algorithm, and compare it with existing algorithms.
  arXiv  Detail & Related papers  (2024-05-06T08:00:43Z)
• Fed-CVLC: Compressing Federated Learning Communications with Variable-Length Codes [54.18186259484828]
  In Federated Learning (FL) paradigm, a parameter server (PS) concurrently communicates with distributed participating clients for model collection, update aggregation, and model distribution over multiple rounds. We show strong evidences that variable-length is beneficial for compression in FL. We present Fed-CVLC (Federated Learning Compression with Variable-Length Codes), which fine-tunes the code length in response to the dynamics of model updates.
  arXiv  Detail & Related papers  (2024-02-06T07:25:21Z)
• FedCode: Communication-Efficient Federated Learning via Transferring Codebooks [3.004066195320147]
  Federated Learning (FL) is a distributed machine learning paradigm that enables learning models from decentralized local data. Existing approaches rely on model compression techniques, such as pruning and weight clustering to tackle this. We propose FedCode where clients transmit only codebooks, i.e., the cluster centers of updated model weight values.
  arXiv  Detail & Related papers  (2023-11-15T12:06:32Z)
• Towards Instance-adaptive Inference for Federated Learning [80.38701896056828]
  Federated learning (FL) is a distributed learning paradigm that enables multiple clients to learn a powerful global model by aggregating local training. In this paper, we present a novel FL algorithm, i.e., FedIns, to handle intra-client data heterogeneity by enabling instance-adaptive inference in the FL framework. Our experiments show that our FedIns outperforms state-of-the-art FL algorithms, e.g., a 6.64% improvement against the top-performing method with less than 15% communication cost on Tiny-ImageNet.
  arXiv  Detail & Related papers  (2023-08-11T09:58:47Z)
• FedCliP: Federated Learning with Client Pruning [3.796320380104124]
  Federated learning (FL) is a newly emerging distributed learning paradigm. One fundamental bottleneck in FL is the heavy communication overheads between the distributed clients and the central server. We propose FedCliP, the first communication efficient FL training framework from a macro perspective.
  arXiv  Detail & Related papers  (2023-01-17T09:15:37Z)
• ResFed: Communication Efficient Federated Learning by Transmitting Deep Compressed Residuals [24.13593410107805]
  Federated learning enables cooperative training among massively distributed clients by sharing their learned local model parameters. We introduce a residual-based federated learning framework (ResFed), where residuals rather than model parameters are transmitted in communication networks for training. By employing a common prediction rule, both locally and globally updated models are always fully recoverable in clients and the server.
  arXiv  Detail & Related papers  (2022-12-11T20:34:52Z)
• Attention-based Feature Compression for CNN Inference Offloading in Edge Computing [93.67044879636093]
  This paper studies the computational offloading of CNN inference in device-edge co-inference systems. We propose a novel autoencoder-based CNN architecture (AECNN) for effective feature extraction at end-device. Experiments show that AECNN can compress the intermediate data by more than 256x with only about 4% accuracy loss.
  arXiv  Detail & Related papers  (2022-11-24T18:10:01Z)
• Federated Dynamic Sparse Training: Computing Less, Communicating Less, Yet Learning Better [88.28293442298015]
  Federated learning (FL) enables distribution of machine learning workloads from the cloud to resource-limited edge devices. We develop, implement, and experimentally validate a novel FL framework termed Federated Dynamic Sparse Training (FedDST) FedDST is a dynamic process that extracts and trains sparse sub-networks from the target full network.
  arXiv  Detail & Related papers  (2021-12-18T02:26:38Z)
• Faster Non-Convex Federated Learning via Global and Local Momentum [57.52663209739171]
  textttFedGLOMO is the first (first-order) FLtexttFedGLOMO algorithm. Our algorithm is provably optimal even with communication between the clients and the server.
  arXiv  Detail & Related papers  (2020-12-07T21:05:31Z)
• Multi-Armed Bandit Based Client Scheduling for Federated Learning [91.91224642616882]
  federated learning (FL) features ubiquitous properties such as reduction of communication overhead and preserving data privacy. In each communication round of FL, the clients update local models based on their own data and upload their local updates via wireless channels. This work provides a multi-armed bandit-based framework for online client scheduling (CS) in FL without knowing wireless channel state information and statistical characteristics of clients.
  arXiv  Detail & Related papers  (2020-07-05T12:32:32Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.