暂无分享,去创建一个
Matthew Malloy | Robert D. Nowak | Sébastien Bubeck | Kevin G. Jamieson | Sébastien Bubeck | R. Nowak | Matthew Malloy
[1] Robert E. Bechhofer,et al. A Sequential Multiple-Decision Procedure for Selecting the Best One of Several Normal Populations with a Common Unknown Variance, and Its Use with Various Experimental Designs , 1958 .
[2] E. Paulson. A Sequential Procedure for Selecting the Population with the Largest Mean from $k$ Normal Populations , 1964 .
[3] R. H. Farrell. Asymptotic Behavior of Expected Sample Size in Certain One Sided Tests , 1964 .
[4] H. Robbins,et al. Iterated logarithm inequalities. , 1967, Proceedings of the National Academy of Sciences of the United States of America.
[5] Shie Mannor,et al. PAC Bounds for Multi-armed Bandit and Markov Decision Processes , 2002, COLT.
[6] John N. Tsitsiklis,et al. The Sample Complexity of Exploration in the Multi-Armed Bandit Problem , 2004, J. Mach. Learn. Res..
[7] Peter Auer,et al. Finite-time Analysis of the Multiarmed Bandit Problem , 2002, Machine Learning.
[8] Rémi Munos,et al. Pure Exploration in Multi-armed Bandits Problems , 2009, ALT.
[9] Dominik D. Freydenberger,et al. Can We Learn to Gamble Efficiently? , 2010, COLT.
[10] Csaba Szepesvári,et al. Improved Algorithms for Linear Stochastic Bandits , 2011, NIPS.
[11] Ambuj Tewari,et al. PAC Subset Selection in Stochastic Multi-armed Bandits , 2012, ICML.
[12] Alessandro Lazaric,et al. Best Arm Identification: A Unified Approach to Fixed Budget and Fixed Confidence , 2012, NIPS.
[13] Oren Somekh,et al. Almost Optimal Exploration in Multi-Armed Bandits , 2013, ICML.
[14] Matthew Malloy,et al. On Finding the Largest Mean Among Many , 2013, ArXiv.
[15] Shivaram Kalyanakrishnan,et al. Information Complexity in Bandit Subset Selection , 2013, COLT.
[16] Sébastien Bubeck,et al. Multiple Identifications in Multi-Armed Bandits , 2012, ICML.