PAC Subset Selection in Stochastic Multi-armed Bandits
暂无分享,去创建一个
Ambuj Tewari | Peter Stone | Peter Auer | Shivaram Kalyanakrishnan | P. Auer | P. Stone | Ambuj Tewari | Shivaram Kalyanakrishnan
[1] John N. Tsitsiklis,et al. The Sample Complexity of Exploration in the Multi-Armed Bandit Problem , 2004, J. Mach. Learn. Res..
[2] Peter Stone,et al. Efficient Selection of Multiple Bandit Arms: Theory and Practice , 2010, ICML.
[3] Dale Schuurmans,et al. Sequential PAC learning , 1995, COLT '95.
[4] Shivaram Kalyanakrishnan. Learning Methods for Sequential Decision Making with Imperfect Representations by Shivaram Kalyanakrishnan , 2011 .
[5] Csaba Szepesvári,et al. Empirical Bernstein stopping , 2008, ICML '08.
[6] W. Hoeffding. Probability Inequalities for sums of Bounded Random Variables , 1963 .
[7] Eli Upfal,et al. Multi-Armed Bandits in Metric Spaces ∗ , 2008 .
[8] H. Robbins. Some aspects of the sequential design of experiments , 1952 .
[9] Christian Igel,et al. Hoeffding and Bernstein races for selecting policies in evolutionary direct policy search , 2009, ICML '09.
[10] Shie Mannor,et al. Action Elimination and Stopping Conditions for the Multi-Armed Bandit and Reinforcement Learning Problems , 2006, J. Mach. Learn. Res..
[11] Peter Auer,et al. Finite-time Analysis of the Multiarmed Bandit Problem , 2002, Machine Learning.
[12] R. Munos,et al. Best Arm Identification in Multi-Armed Bandits , 2010, COLT.
[13] Shivaram Kalyanakrishnan,et al. Information Complexity in Bandit Subset Selection , 2013, COLT.
[14] Deepayan Chakrabarti,et al. Multi-armed bandit problems with dependent arms , 2007, ICML '07.
[15] Peter Auer,et al. The Nonstochastic Multiarmed Bandit Problem , 2002, SIAM J. Comput..