NDLI: Online learning for multi-channel opportunistic access over unknown Markovian channels

Content Provider	IEEE Xplore Digital Library
Author	Wenhan Dai Yi Gai Krishnamachari, B.
Copyright Year	2014
Description	Author affiliation: Massachusetts Inst. of Technol., Cambridge, MA, USA (Wenhan Dai) \|\| Univ. of Southern California, Los Angeles, CA, USA (Yi Gai; Krishnamachari, B.)
Abstract	A fundamental theoretical problem in opportunistic spectrum access is the following: a single secondary user must choose a channel to sense and access at each time, with the availability of each channel (due to primary user behavior) described by a Markov Chain. The problem of maximizing the expected channel usage can be formulated as a restless multi-armed bandit. We present in this paper an online learning algorithm with the best known results to date for this problem in the case when channels are homogeneous and the channel statistics are unknown a priori. Specifically, we show that this policy, that we refer to as CSE, achieves a regret (the gap between the rewards accumulated by a model-aware Genie and the policy) that is bounded in finite time by a function that scales as O(log t). By explicitly learning the underlying statistics over time, this novel policy outperforms a previously proposed scheme shown to provide near-logarithmic regret.
Starting Page	64
Ending Page	71
File Size	561095
Page Count	8
File Format	PDF
ISBN	9781479946570
DOI	10.1109/SAHCN.2014.6990328
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2014-06-30
Publisher Place	Singapore
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Sensors Bayes methods Vectors Tin Conferences Markov processes Throughput Online Learning Restless Multi-Armed Bandit Logarithmic Regret
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Libarray of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

The non-Bayesian restless multi-armed bandit: A case of near-logarithmic regret

Multi-channel opportunistic spectrum access in unslotted primary systems with unknown models

Logarithmic Weak Regret of Non-Bayesian Restless Multi-Armed Bandit (2011)

A Channel Allocation Algorithm for Cognitive Radio Systems Using Restless Multi-Armed Bandit

Logarithmic weak regret of non-Bayesian restless multi-armed bandit

1 learning in a changing world: restless multi-armed bandit with unknown dynamics.

Efficient online learning for opportunistic spectrum access.

Online Learning for Multi-Channel Opportunistic Access over Unknown Markovian Channels

The Restless Multi-Armed Bandit Formulation of the Cognitive Compressive Sensing Problem

Online learning for multi-channel opportunistic access over unknown Markovian channels

Similar Documents

The non-Bayesian restless multi-armed bandit: A case of near-logarithmic regret

Multi-channel opportunistic spectrum access in unslotted primary systems with unknown models

Logarithmic Weak Regret of Non-Bayesian Restless Multi-Armed Bandit (2011)

A Channel Allocation Algorithm for Cognitive Radio Systems Using Restless Multi-Armed Bandit

Logarithmic weak regret of non-Bayesian restless multi-armed bandit

1 learning in a changing world: restless multi-armed bandit with unknown dynamics.

Efficient online learning for opportunistic spectrum access.

Online Learning for Multi-Channel Opportunistic Access over Unknown Markovian Channels

The Restless Multi-Armed Bandit Formulation of the Cognitive Compressive Sensing Problem

Online learning for multi-channel opportunistic access over unknown Markovian channels