arXiv Machine Learning
Sep 3

Network-Aware Forecasting on Wireless Access Points

The paper investigates how enterprise wireless access points (APs) can run predictive machine learning models while sharing CPU and memory with essential networking tasks. It introduces the concept of network‑aware deployability, requiring models to qualify for the AP’s hardware and to be validated under real packet‑service constraints. Benchmarks reveal that models can run 6–19× slower and use up to 22% more memory on an AP compared to a Raspberry Pi 5, and that even similarly sized forecasting models can differ by 19× in latency, leading to significant increases in round‑trip time and throughput degradation under load.

By Niloo Bahadori, Swadhin Pradhan, Peiman Amini
arXiv AI
Jun 3

AUGUSTE: Online-Learning dApp for Predictive URLLC Scheduling

arXiv:2606. 03664v1 Announce Type: cross Abstract: Ultra Reliable and Low Latency Communications (URLLC) was one of the main motivations behind 5G, with 3GPP advertising 1-10 ms latency targets for applications such as industrial automation, Vehicle-To-Everything (V2X), tactical edge networking, and unmanned-system control.

By Maxime Elkael, Michele Polese, Yunseong Lee, Koichiro Furueda, Tommaso Melodia
arXiv Computation and Language
Sep 7

Cache-Aware Joint Router Adaptation for Memory-Efficient MoE Inference

The paper introduces a cache‑aware post‑training framework for Mixture‑of‑Experts (MoE) models that jointly adapts the MoE backbone and lightweight auxiliary cache routers while keeping the native Top‑K expert‑selection rule. Two modes are proposed: Temporal Router, which predicts same‑layer reuse and retains experts for future tokens, and Spatio‑Temporal Router, which adds a Spatio Router that refines the temporal cache using the causal predecessor’s hidden state. Experiments on Qwen3 and GPT‑OSS across GSM8K, MATH, and CommonsenseQA show that Temporal Router improves cache hit rates and reduces expert‑weight traffic, while Spatio‑Temporal Router achieves the best load‑adjusted efficiency, outperforming strong prefetching baselines.

By Zhenhe Wu, Yaping Jin, Qinghua Xing, Hang Zhou, Wei He, Xianjie Wu, Xianfu Cheng, Jian Yang, Hanting Chen
arXiv Machine Learning
Sep 14

Hidden in Rounds: Predicting the Time Cost of 802.11 Contention in Federated Learning

The paper investigates how the time cost of 802.11 contention affects federated learning. Using ns-3 simulations, the authors measure frame-delivery ratios and saturation throughput across various client densities and offered loads, then employ a FedAvg trainer that uses these ratios to estimate communication time. Across 720 runs with diverse datasets, partitions, densities, loads, and seeds, all models reached target accuracy within the round budget, with communication time-to-target increasing significantly as client density rose. The study also compares uniform and persistent heterogeneous participation, finding no statistically significant accuracy gap, though confidence intervals are wide. The results are specific to the evaluated configurations and do not generalize to all convergence or fairness scenarios.

By Satwat Bashir, Tasos Dagiuklas
arXiv Machine Learning
Jun 25

Adaptive Joint Compression and Synchronisation in Federated Split Learning for IoT Rainfall Prediction

arXiv:2606. 25003v1 Announce Type: new Abstract: Federated split learning (FSL) enables collaborative training across bandwidth-constrained IoT devices, but repeated activation and gradient exchange creates a communication bot-tleneck.

By Wenjie Ding, Yi Sin Lin, Jiale Liu, Baoyi Liu, Guanghua Liu, Zhuolu Li, Suleiman Sabo, Chuadhry Mujeeb Ahmed, Aydin Abadi, Rehmat Ullah, Rajiv Ranjan