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

ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

Volumn , Issue , 2011, Pages 2940-2943

  Dai, Wenhan ^a   Gai, Yi ^b   Krishnamachari, Bhaskar ^b   Zhao, Qing ^c  

^a TSINGHUA UNIVERSITY   (China)

^b University of Southern California ^*  (United States)

^c University of California   (United States)

Author keywords

learning; non Bayesian; opportunistic spectrum access; regret; restless bandit

Indexed keywords

LEARNING; NON-BAYESIAN; OPPORTUNISTIC SPECTRUM ACCESS; REGRET; RESTLESS BANDIT;

MARKOV PROCESSES; OPTIMIZATION; SET THEORY; SIGNAL PROCESSING; SPECTROSCOPY; TESTBEDS;

SPEECH COMMUNICATION;

EID: 80051623306     PISSN: 15206149     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICASSP.2011.5946273     Document Type: Conference Paper

References (9)

1. P. Whittle, "Restless Bandits: Activity Allocation in a Changing World," Journal of Applied Probability, vol. 25, 1988.
2. C. H. Papadimitriou and J. N. Tsitsiklis, "The Complexity Of Optimal Queueing Network Control," Mathematics of Operations Research, vol. 24, no. 2, 1999.
3. K. Liu and Q. Zhao, "Indexability of restless bandit problems and optimality of Whittle index for dynamic multichannel access," IEEE Transactions on Information Theory, vol. 56, no. 11, 2010.
4. Q. Zhao, B. Krishnamachari, and K. Liu, "On myopic sensing for multi-channel opportunistic access: structure, optimality, and performance," IEEE Transactions on Wireless Communications, vol. 7, no. 12, 2008.
5. S. Ahmad, M. Liu, T. Javidi, Q. Zhao, and B. Krishnamachari, "Optimality of myopic sensing in multi-channel opportunistic access," IEEE Transactions on Information Theory, vol. 55, no. 9, 2009.
6. T. Lai and H. Robbins, "Asymptotically efficient adaptive allocation rules," Advances in Applied Mathematics, vol. 6, no. 1, 1985.
7. P. Auer, N. Cesa-Bianchi, and P. Fischer, "Finite-time Analysis of the Multiarmed Bandit Problem", Machine Learning, vol. 47, No.2-3, 2002.
8. C. Tekin and M. Liu, "Online Learning in Opportunistic Spectrum Access: A Restless Bandit Approach," in Proc. of IEEE International Conference on Computer Communications ( INFOCOM), April, 2011.
9. H. Liu, K. Liu and Q. Zhao, "Logrithmic Weak Regret of Non-Bayesian Restless Multi-Armed Bandit," in Proc. of IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP), May, 2011.