Coverage Analysis Of Multi-environment Q-learning Algorithms For Wireless Network Optimization
2024 Β· Talha Bozkus, Urbashi Mitra
Abstract
Q-learning is widely used to optimize wireless networks with unknown system dynamics. Recent advancements include ensemble multi-environment hybrid Q-learning algorithms, which utilize multiple Q-learning algorithms across structurally related but distinct Markovian environments and outperform existing Q-learning algorithms in terms of accuracy and complexity in large-scale wireless networks. We herein conduct a comprehensive coverage analysis to ensure optimal data coverage conditions for these algorithms. Initially, we establish upper bounds on the expectation and variance of different coverage coefficients. Leveraging these bounds, we present an algorithm for efficient initialization of these algorithms. We test our algorithm on two distinct real-world wireless networks. Numerical simulations show that our algorithm can achieve %50 less policy error and %40 less runtime complexity than state-of-the-art reinforcement learning algorithms. Furthermore, our algorithm exhibits robustness
Authors
(none)
Tags
Stats
Related papers
- A Multi-agent Multi-environment Mixed Q-learning For Partially Decentralized Wireless Network Optimization (2024)0.00
- Leveraging Digital Cousins For Ensemble Q-learning In Large-scale Wireless Networks (2024)6.77
- Implications Of Decentralized Q-learning Resource Allocation In Wireless Networks (2017)0.00
- Multi-timescale Ensemble Q-learning For Markov Decision Process Policy Optimization (2024)6.34
- Survey On Multi-agent Q-learning Frameworks For Resource Management In Wireless Sensor Network (2021)0.00
- Offline Reinforcement Learning For Wireless Network Optimization With Mixture Datasets (2023)9.59
- Multi-agent Actor-critic For Mixed Cooperative-competitive Environments (2017)0.00
- An Empirical Investigation Of Value-based Multi-objective Reinforcement Learning For Stochastic Environments (2024)0.00