Sign inGet started
Paper · arXiv

Selecting Offline Reinforcement Learning Algorithms for Stochastic Network Control

Offline Reinforcement Learning (RL) is a promising approach for next-generation wireless networks, where online exploration is unsafe and large amounts of operational data can be reused across the model lifecycle. However, the behavior of offline RL algorithms under genuinely stochastic dynamics -- inherent to wireless systems due to fading, noise, and traffic mobility -- remains insufficiently understood. We address this gap by evaluating Bellman-based (Conservative Q-Learning), sequence-based (Decision Transformers), and hybrid (Critic-Guided Decision Transformers) offline RL methods in an open-access stochastic telecom environment (mobile-env). Our results show that Conservative Q-Lear...

AuthorsNicolas Helson, Pegah Alizadeh, Anastasios Giovanidis
Primary categorycs.NI
Published4 March 2026
Last updated at source4 March 2026
cs.NIcs.AIcs.LGcs.PFeess.SY
Embed this entry
<iframe src="https://silytics.si/embed/item/cc8a3875-9e77-464a-83e7-170f8e44b14e" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.