Optimally Sensing a Single Channel Without Prior Information: The Tiling Algorithm and Regret Bounds

Sarah Filippi (1) , Olivier Cappé (1) , Aurélien Garivier (1)

1 LTCI - Laboratoire Traitement et Communication de l'Information

We consider the task of optimally sensing a two-state Markovian channel with an observation cost and without any prior information regarding the channel's transition probabilities. This task is of interest in the field of cognitive radio as a model for opportunistic access to a communication network by a secondary user. The optimal sensing problem may be cast into the framework of model-based reinforcement learning in a specific class of Partially Observable Markov Decision Processes (POMDPs). We propose the Tiling Algorithm, an original method aimed at reaching an optimal tradeoff between the exploration (or estimation) and exploitation requirements. It is shown that this algorithm achieves finite horizon regret bounds that are as good as those recently obtained for multi-armed bandits and finite-state Markov Decision Processes (MDPs).

Mots clés: Cognitive Radio; Opportunistic Channel Access; POMDPs; Regret Bounds; Reinforcement learning; Restless Bandit.; Restless Bandit

Domaines: Machine Learning [stat.ML]; Apprentissage [cs.LG]; Intelligence artificielle [cs.AI]; Réseaux et télécommunications [cs.NI]

Sarah Filippi, Olivier Cappé, Aurélien Garivier. Optimally Sensing a Single Channel Without Prior Information: The Tiling Algorithm and Regret Bounds. IEEE Journal of Selected Topics in Signal Processing, 2010, 5 (1), pp.68 - 76. ⟨10.1109/JSTSP.2010.2058091⟩. ⟨hal-00408867v2⟩