arXiv Machine Learning

KISS: Keeping it Simple and Slotted when Learning to Communicate over Wireless

arXiv:2606. 00266v1 Announce Type: cross Abstract: A long-standing challenge in distributed wireless systems is ensuring efficient and fair random channel access.

arXiv Machine Learning
Sep 18

Robust Federated Q-Learning with Almost No Communication

The paper introduces Robust Fed-Q, a federated Q‑learning algorithm designed for settings where multiple agents interact with a shared Markov Decision Process and communicate through a central server. It combines model‑based and model‑free reinforcement learning techniques with a median‑of‑means strategy from robust statistics to handle a small fraction of adversarial agents. The authors prove that Robust Fed-Q achieves exact convergence to the optimal value function with high probability, attains near‑optimal finite‑time rates that benefit from collaboration, and requires only “~O(1)” communication rounds per guarantee.

By Sreejeet Maity, Aritra Mitra
arXiv Machine Learning
Jun 19

Utility-Aware DRL-Based TXOP Adaptation for NR-U and Wi-Fi Coexistence Networks

arXiv:2605. 00457v4 Announce Type: replace-cross Abstract: The coexistence of NR-U and Wi-Fi in the unlicensed spectrum introduces a challenging resource management problem, where heterogeneous channel access mechanisms can lead to unbalanced spectrum utilization and severe Wi-Fi performance degradation.

By Po-Heng Chou, Yi-Fang Yu, Shou-Yu Chen, Chiapin Wang
arXiv Machine Learning
Aug 27

FedQoS: Federated QoS-Risk Learning for Heterogeneous Indoor-Outdoor Access Selection

FedQoS is a federated learning framework that predicts future QoS failure probabilities for candidate access links in dynamic indoor‑outdoor environments, enabling reliable access‑node selection without centralizing user data. Each access node trains locally on its network logs, while a global QoS‑risk predictor is built through federated aggregation. Simulations using physics‑based synthetic datasets show that FedQoS reduces QoS‑failure rates compared to signal‑based and historical‑QoS heuristics, achieving near‑centralized performance even under non‑IID data conditions.

By Nguyen Van Thieu, Ti Ti Nguyen, Ons Aouedi, Zerihun Huruy, Vu Nguyen Ha, Symeon Chatzinotas
arXiv Machine Learning
Jun 10

Inverse Probability Weighting and Age-of-Information Aggregation for Decentralized Federated Learning under Partial Reception

arXiv:2606. 10774v1 Announce Type: new Abstract: Decentralized Federated Learning (DFL) over lossy wireless networks faces two key challenges: selection bias, where updates from poor-quality links are systematically underrepresented due to partial model reception, and update staleness, where asynchronous nodes contribute outdated information.

By Chanuka A. S. Hewa Kaluannakkage, Rajkumar Buyya