A comprehensive system model is established that jointly incorporates the convergence behavior of the FUN algorithm, local device computation dynamics, and a worst-case robust transmission model operating under bounded channel state information (CSI) error to solve the resulting non-convex joint resource allocation problem.
Abstract
To comply with stringent data privacy regulations, federated unlearning (FU) has emerged as a critical paradigm. However, its implementation over wireless networks introduces severe communication latency and reliability challenges due to iterative calibration requirements and physical-layer channel uncertainties. In this paper, we investigate the problem of delay minimization for federated unlearning networks (FUN). Specifically, we establish a comprehensive system model that jointly incorporates the convergence behavior of the FUN algorithm, local device computation dynamics, and a worst-case robust transmission model operating under bounded channel state information (CSI) error. To solve the resulting non-convex joint resource allocation problem, we propose an efficient iterative algorithm. By exploiting the monotonicity and convexity properties of the system constraints, the problem is decomposed via a uniform scan over the local accuracy parameter, within which the optimal delay, bandwidth, power, and computation frequency are determined utilizing nested bisection and golden-section searches. Both theoretical analysis and extensive numerical results demonstrate that the proposed algorithm achieves polynomial complexity and significantly reduces the overall unlearning completion time compared to conventional baseline schemes.
Over-the-air computation has emerged as a scalable and efficient solution for deploying federated learning algorithms in wireless networks by exploiting waveform superposition for simultaneous model aggregation. Most existing work struggles with heterogeneous fading channels. These approaches either enforce unbiased up...
Ming Xiang, Nicolò Michelusi, Y. Eldar et al.· 0 citations
A federated random walk averaging framework is proposed, which is a variant of federated averaging (FedAvg) that mitigates data heterogeneity by updating models along random walk (RW) paths and aggregating them at the server and reduces the problem to a general form agnostic to task type and model architecture.
Chang-Heng Wang, Xian-Chao Zhang, Zhi-Qing Wei et al.· 0 citations
Federated learning in Open Radio Access Networks (O-RAN) enables privacy-preserving distributed training, yet regulatory mandates such as the General Data Protection Regulation (GDPR) require verifiable erasure of client data influence from trained models. Existing federated unlearning schemes assume ideal channels, re...
Syed Danial Ali Shah, Zeinab Nezami, S. A. Hoseini· IEEE Wireless Communications...· 0 citations
Federated learning (FL) enables multiple devices to collaboratively train a global model without sharing local data. However, due to limited local computing capability and communication bandwidth, FL suffers from high learning latency, especially when the model size is large. To address these issues, we propose APQ-FL,...
Xiao-Dong Li, Yulong Gao, C. Chiasserini et al.· IEEE Transactions on Cogniti...· 0 citations
Experimental results on heterogeneous MNIST and CIFAR-10 settings show that QEF-GT-AdamW consistently improves robustness and convergence performance over representative DecL baselines while achieving favorable accuracy-communication trade-offs under limited wireless resources.
Thieu Van Nguyen, T. Nguyen, Ons Aouedi et al.· 0 citations
To mitigate the scalability bottleneck in the radio access network (RAN) in federated edge learning (FEEL), over-the-air federated learning (AirFL) exploits waveform superposition over multiple-access channels (MACs) for analog model aggregation. However, coherent AirFL typically relies on stringent PHY-layer condition...
Hai-Feng Wen, Nicolò Michelusi, Osvaldo Simeone et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.