Online learning for stochastic linear optimization problems

2012 Information Theory and Applications Workshop, ITA 2012 - Conference Proceedings

Volumn , Issue , 2012, Pages 363-367

  Liu, Keqin ^a   Zhao, Qing ^a  

^a Davis   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACTION SPACES; COMPACT SUBSETS; COST MODELS; EXPECTED VALUES; LINEAR FUNCTIONS; LINEAR OPTIMIZATION PROBLEMS; ONLINE LEARNING; PERFORMANCE TRADE-OFF; POLYTOPES; PROBLEM SIZE; SHORTEST PATH ROUTING; SPECIAL CLASS; SUBLINEAR; TIME HORIZONS; TOTAL COSTS;

COSTS; INFORMATION THEORY; OPTIMIZATION;

STOCHASTIC SYSTEMS;

EID: 84860460204     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITA.2012.6181775     Document Type: Conference Paper

References (15)

1. V. Dani, T. Hayes, S. Kakade, "Stochastic Linear Optimization under Bandit Feedback," in Proc. of the 21st Annual Conference on Learning Theory, 2008.
2. H. Robbins, "Some Aspects of the Sequential Design of Experiments,"Bull. Amer. Math. Soc., vol. 58, no. 5, pp. 527-535, 1952.
3. T. Lai and H. Robbins, "Asymptotically Efficient Adaptive Allocation Rules," Advances in Applied Mathematics, vol. 6, no. 1, pp. 4-22, 1985.
4. T. Lai, "Adaptive Treatment Allocation and The Multi-Armed Bandit Problem," Ann. Statist., vol 15, pp. 1091-1114, 1987.
5. R. Agrawal, "Sample Mean Based Index Policies with O(logn) Regret for the Multi-armed Bandit Problem," Advances in Applied Probability, vol. 27, pp. 1054-1078, 1995.
6. P. Auer, N. Cesa-Bianchi, P. Fischer, "Finite-time Analysis of the Multiarmed Bandit Problem," Machine Learning, vol. 47, pp. 235-256, 2002.
7. K. Liu and Q. Zhao, "Multi-Armed Bandit Problems with Heavy Tail Reward Distributions," in Proc. of Allerton Conference on Communications, Control, and Computing, September, 2011.
8. R. Agrawal, "The Continuum-Armed Bandit Problem," SIAM J. Control and Optimization, vol. 33, no. 6, pp. 1926-1951, 1995.
9. R. Kleinberg, "Nearly Tight Bounds for the Continuum-Armed Bandit Problem," Advances in Neural Information Processing Systems 17 (NIPS), pp. 697-704, 2004.
10. P. Auer, R. Ortner, C. Szepesvári, "Improved Rates for the Stochastic Continuum-Armed Bandit Problem," Lecture Notes in Computer Science, vol. 4539, pp. 454-468, 2007.
11. E.W. Cope, "Regret and Convergence Bounds for a Class of Continuum-Armed Bandit Problems," IEEE Transactions on Automatic Control, vol. 54, no. 6, Jun. 2009.
12. B. Awerbuch, R. Kleinberg, "Online Linear Optimization and Adaptive Routing," Journal of Computer and System Sciences, pp. 97-114, 2008.
13. P. Chareka, O. Chareka, S. Kennendy, "Locally Sub-Gaussian Random Variable and the Strong Law of Large Numbers," Atlantic Electronic Journal of Mathematics, vol. 1, no. 1, pp. 75-81, 2006.
14. Y. Gai, B. Krishnamachari, and R. Jain, "Combinatorial Network Optimization with Unknown Variables: Multi-Armed Bandits with Linear Rewards," USC Technical Report, CENG-2010-9.
15. K. Liu and Q. Zhao, "Adaptive Shortest-Path Routing and Stochastic Online Linear Optimization," Available at http://arxiv.org/abs/1201.4906.