🤖 AI Summary
To address the low caching efficiency and unfair user experience arising from concurrent ultra-low latency, high-fidelity transmission requirements, and statistical heterogeneity among users and base stations in wireless VR networks, this paper proposes a decentralized multi-task fair federated learning caching framework. The framework enables collaborative training of personalized field-of-view (FoV) prediction models at base stations to achieve accurate content prefetching. It innovatively integrates multi-task learning with fairness constraints to jointly optimize inter-user QoE fairness and robustness to statistical heterogeneity. A PAC-learnable generalization error bound is theoretically established via Rademacher complexity analysis. Evaluated on real-world VR head-motion traces, the framework achieves a 23.6% improvement in cache hit ratio, a 31.4% reduction in end-to-end latency, and a 47.2% decrease in user QoE variance over baseline methods, significantly enabling high-quality, real-time wireless VR services.
📝 Abstract
Wireless connectivity promises to unshackle virtual reality (VR) experiences, allowing users to engage from anywhere, anytime. However, delivering seamless, high-quality, real-time VR video wirelessly is challenging due to the stringent quality of experience requirements, low latency constraints, and limited VR device capabilities. This paper addresses these challenges by introducing a novel decentralized multi task fair federated learning (DMTFL) based caching that caches and prefetches each VR user's field of view (FOV) at base stations (BSs) based on the caching strategies tailored to each BS. In federated learning (FL) in its naive form, often biases toward certain users, and a single global model fails to capture the statistical heterogeneity across users and BSs. In contrast, the proposed DMTFL algorithm personalizes content delivery by learning individual caching models at each BS. These models are further optimized to perform well under any target distribution, while providing theoretical guarantees via Rademacher complexity and a probably approximately correct (PAC) bound on the loss. Using a realistic VR head-tracking dataset, our simulations demonstrate the superiority of our proposed DMTFL algorithm compared to baseline algorithms.