arXiv:2607. 04218v1 Announce Type: new Abstract: The growing demand for privacy-preserving, data-intensive applications such as IoT, augmented reality, and autonomous systems positions Federated Learning (FL) as a key enabler in 6G networks.
By Zubaida Fatima, Zubair Shaban, Yusuf Jamal, Nazreen Shah, Ranjitha Prasad, B. N. Bharath
The paper introduces FedSWE, a federated learning algorithm designed to handle non‑stationary and heterogeneous client availability without requiring prior real‑time knowledge of which devices are online. FedSWE compensates for missed computations, stabilizes global updates, and mixes local updates through implicit gossiping, all while adding only modest memory and computational overhead. The authors prove that FedSWE converges to a stationary point for non‑convex objectives and achieves linear speedup in certain scenarios, and they validate these claims with experiments on real‑world datasets featuring diverse client unavailability patterns.
By Ming Xiang, Stratis Ioannidis, Edmund Yeh, Carlee Joe-Wong, Lili Su
arXiv:2607. 04170v1 Announce Type: new Abstract: Federated Learning (FL) enables decentralized training without data sharing, but suffers from statistical heterogeneity across clients, leading to client drift, poor generalization, and sharp minima compared to centralized training.
By Liyang Yuan, Yibo Yang, Dandan Guo
arXiv:2608. 07007v1 Announce Type: new Abstract: Federated Learning (FL) enables collaborative machine learning (ML) across distributed clients while preserving privacy.
By Majid Kundroo, Tinku Singh, Taehong Kim
arXiv:2608. 01426v1 Announce Type: new Abstract: Federated learning (FL) enables distributed optimization and learning across decentralized edge devices while preserving data privacy, but its performance is fundamentally constrained by heterogeneous data distributions, limited communication resources, and energy availability.
By Furkan Bagci, Busra Tegin, Mohammad Kazemi, Tolga M. Duman
The paper investigates federated learning over multiple‑access fading channels with a multi‑antenna base station, focusing on user‑level differential privacy (DP). It shows that DP can be achieved as a natural benefit of channel noise without adding artificial noise, deriving new DP and convergence bounds for general bounded‑domain models and non‑convex loss functions. The authors further optimize beamforming and power allocation to characterize the trade‑off between privacy and convergence, providing theoretical insights and numerical validation.
By Hao Liang, Haifeng Wen, Kaishun Wu, Khaled B. Letaief, Hong Xing