A Tutorial on Thompson Sampling
暂无分享,去创建一个
Benjamin Van Roy | Ian Osband | Daniel Russo | Abbas Kazerouni | Daniel Russo | Ian Osband | Abbas Kazerouni
[1] W. R. Thompson. ON THE LIKELIHOOD THAT ONE UNKNOWN PROBABILITY EXCEEDS ANOTHER IN VIEW OF THE EVIDENCE OF TWO SAMPLES , 1933 .
[2] W. R. Thompson. On the Theory of Apportionment , 1935 .
[3] J. Gittins,et al. A dynamic allocation index for the discounted multiarmed bandit problem , 1979 .
[4] Michael N. Katehakis,et al. The Multi-Armed Bandit Problem: Decomposition and Computation , 1987, Math. Oper. Res..
[5] Christian M. Ernst,et al. Multi-armed Bandit Allocation Indices , 1989 .
[6] J. Bather,et al. Multi‐Armed Bandit Allocation Indices , 1990 .
[7] G. Casella,et al. Explaining the Gibbs Sampler , 1992 .
[8] R. Tweedie,et al. Exponential convergence of Langevin distributions and their discrete approximations , 1996 .
[9] Jeremy Wyatt,et al. Exploration and inference in learning from reinforcement , 1998 .
[10] Richard S. Sutton,et al. Introduction to Reinforcement Learning , 1998 .
[11] J. Rosenthal,et al. Optimal scaling of discrete approximations to Langevin diffusions , 1998 .
[12] Malcolm J. A. Strens,et al. A Bayesian Framework for Reinforcement Learning , 2000, ICML.
[13] Jonathan C. Mattingly,et al. Ergodicity for SDEs and approximations: locally Lipschitz vector fields and degenerate noise , 2002 .
[14] Peter Auer,et al. Finite-time Analysis of the Multiarmed Bandit Problem , 2002, Machine Learning.
[15] Richard S. Sutton,et al. Reinforcement Learning: An Introduction , 1998, IEEE Trans. Neural Networks.
[16] Peter Auer,et al. Near-optimal Regret Bounds for Reinforcement Learning , 2008, J. Mach. Learn. Res..
[17] Nick Craswell,et al. An experimental comparison of click position-bias models , 2008, WSDM '08.
[18] Thomas P. Hayes,et al. Stochastic Linear Optimization under Bandit Feedback , 2008, COLT.
[19] Eli Upfal,et al. Multi-Armed Bandits in Metric Spaces ∗ , 2008 .
[20] Warren B. Powell,et al. A Knowledge-Gradient Policy for Sequential Information Collection , 2008, SIAM J. Control. Optim..
[21] Warren B. Powell,et al. The Knowledge-Gradient Policy for Correlated Normal Beliefs , 2009, INFORMS J. Comput..
[22] Joaquin Quiñonero Candela,et al. Web-Scale Bayesian Click-Through rate Prediction for Sponsored Search Advertising in Microsoft's Bing Search Engine , 2010, ICML.
[23] John N. Tsitsiklis,et al. Linearly Parameterized Bandits , 2008, Math. Oper. Res..
[24] Wei Chu,et al. A contextual-bandit approach to personalized news article recommendation , 2010, WWW '10.
[25] Steven L. Scott,et al. A modern Bayesian look at the multi-armed bandit , 2010 .
[26] Csaba Szepesvári,et al. –armed Bandits , 2022 .
[27] Csaba Szepesvári,et al. Improved Algorithms for Linear Stochastic Bandits , 2011, NIPS.
[28] Lihong Li,et al. An Empirical Evaluation of Thompson Sampling , 2011, NIPS.
[29] Yee Whye Teh,et al. Bayesian Learning via Stochastic Gradient Langevin Dynamics , 2011, ICML.
[30] Rémi Munos,et al. Thompson Sampling: An Asymptotically Optimal Finite-Time Analysis , 2012, ALT.
[31] Aurélien Garivier,et al. On Bayesian Upper Confidence Bounds for Bandit Problems , 2012, AISTATS.
[32] Sébastien Bubeck,et al. Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems , 2012, Found. Trends Mach. Learn..
[33] S. Kakade,et al. Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting , 2012, IEEE Transactions on Information Theory.
[34] Shipra Agrawal,et al. Analysis of Thompson Sampling for the Multi-armed Bandit Problem , 2011, COLT.
[35] Deepak Agarwal,et al. Computational advertising: the linkedin way , 2013, CIKM.
[36] R. Munos,et al. Kullback–Leibler upper confidence bounds for optimal sequential allocation , 2012, 1210.1136.
[37] Feng Wu,et al. Bayesian Mixture Modelling and Inference based Thompson Sampling in Monte-Carlo Tree Search , 2013, NIPS.
[38] Benjamin Van Roy,et al. (More) Efficient Reinforcement Learning via Posterior Sampling , 2013, NIPS.
[39] Shipra Agrawal,et al. Further Optimal Regret Bounds for Thompson Sampling , 2012, AISTATS.
[40] Shipra Agrawal,et al. Thompson Sampling for Contextual Bandits with Linear Payoffs , 2012, ICML.
[41] Benjamin Van Roy,et al. Eluder Dimension and the Sample Complexity of Optimistic Exploration , 2013, NIPS.
[42] Benjamin Van Roy,et al. Near-optimal Reinforcement Learning in Factored MDPs , 2014, NIPS.
[43] Deepak Agarwal,et al. LASER: a scalable response prediction platform for online advertising , 2014, WSDM.
[44] Akimichi Takemura,et al. Optimality of Thompson Sampling for Gaussian Bandits Depends on Priors , 2013, AISTATS.
[45] Omar Besbes,et al. Stochastic Multi-Armed-Bandit Problem with Non-stationary Rewards , 2014, NIPS.
[46] Benjamin Van Roy,et al. Learning to Optimize via Posterior Sampling , 2013, Math. Oper. Res..
[47] Shie Mannor,et al. Thompson Sampling for Complex Online Problems , 2013, ICML.
[48] Benjamin Van Roy,et al. Model-based Reinforcement Learning and the Eluder Dimension , 2014, NIPS.
[49] Dean Eckles,et al. Thompson sampling with the online bootstrap , 2014, ArXiv.
[50] Benjamin Van Roy,et al. Learning to Optimize via Information-Directed Sampling , 2014, NIPS.
[51] Shie Mannor,et al. Bayesian Reinforcement Learning: A Survey , 2015, Found. Trends Mach. Learn..
[52] Zheng Wen,et al. Cascading Bandits: Learning to Rank in the Cascade Model , 2015, ICML.
[53] Shie Mannor,et al. Thompson Sampling for Learning Parameterized Markov Decision Processes , 2014, COLT.
[54] Long Tran-Thanh,et al. Efficient Thompson Sampling for Online Matrix-Factorization Recommendation , 2015, NIPS.
[55] Steven L. Scott,et al. Multi-armed bandit experiments in the online service economy , 2015 .
[56] Michael L. Littman,et al. Reinforcement learning improves behaviour from evaluative feedback , 2015, Nature.
[57] Benjamin Van Roy,et al. Generalization and Exploration via Randomized Value Functions , 2014, ICML.
[58] Benjamin Van Roy,et al. Deep Exploration via Bootstrapped DQN , 2016, NIPS.
[59] É. Moulines,et al. Sampling from a strongly log-concave distribution with the Unadjusted Langevin Algorithm , 2016 .
[60] C. Gomez-Uribe. Online Algorithms For Parameter Mean And Variance Estimation In Dynamic Regression Models , 2016, 1605.05697.
[61] Daniel Russo,et al. Simple Bayesian Algorithms for Best Arm Identification , 2016, COLT.
[62] Yee Whye Teh,et al. Consistency and Fluctuations For Stochastic Gradient Langevin Dynamics , 2014, J. Mach. Learn. Res..
[63] Benjamin Van Roy,et al. An Information-Theoretic Analysis of Thompson Sampling , 2014, J. Mach. Learn. Res..
[64] Sébastien Bubeck,et al. Multi-scale exploration of convex functions and bandit convex optimization , 2015, COLT.
[65] Benjamin Van Roy,et al. On Optimistic versus Randomized Exploration in Reinforcement Learning , 2017, ArXiv.
[66] Peter S. Fader,et al. Customer Acquisition via Display Advertising Using Multi-Armed Bandit Experiments , 2016, Mark. Sci..
[67] Benjamin Van Roy,et al. Learning to Price with Reference Effects , 2017, ArXiv.
[68] Benjamin Van Roy,et al. Ensemble Sampling , 2017, NIPS.
[69] Alessandro Lazaric,et al. Linear Thompson Sampling Revisited , 2016, AISTATS.
[70] Benjamin Van Roy,et al. Why is Posterior Sampling Better than Optimism for Reinforcement Learning? , 2016, ICML.
[71] David Tse,et al. Time-Sensitive Bandit Learning and Satisficing Thompson Sampling , 2017, ArXiv.
[72] Michael Jong Kim,et al. Thompson Sampling for Stochastic Control: The Finite Parameter Case , 2017, IEEE Transactions on Automatic Control.
[73] Kirthevasan Kandasamy,et al. Asynchronous Parallel Bayesian Optimisation via Thompson Sampling , 2017, ArXiv.
[74] Vashist Avadhanula,et al. Thompson Sampling for the MNL-Bandit , 2017, COLT.
[75] Yi Liu,et al. An Efficient Bandit Algorithm for Realtime Multivariate Optimization , 2017, KDD.
[76] Yi Ouyang,et al. Learning Unknown Markov Decision Processes: A Thompson Sampling Approach , 2017, NIPS.
[77] Khashayar Khosravi,et al. Exploiting the Natural Exploration In Contextual Bandits , 2017, ArXiv.
[78] Fang Liu,et al. Information Directed Sampling for Stochastic Bandits with Graph Feedback , 2017, AAAI.
[79] Peter L. Bartlett,et al. Convergence of Langevin MCMC in KL-divergence , 2017, ALT.
[80] Sébastien Bubeck,et al. Sampling from a Log-Concave Distribution with Projected Langevin Monte Carlo , 2015, Discrete & Computational Geometry.
[81] Kirthevasan Kandasamy,et al. Parallelised Bayesian Optimisation via Thompson Sampling , 2018, AISTATS.
[82] David Simchi-Levi,et al. Online Network Revenue Management Using Thompson Sampling , 2017, Oper. Res..
[83] Alain Durmus,et al. High-dimensional Bayesian inference via the unadjusted Langevin algorithm , 2016, Bernoulli.
[84] Zheng Wen,et al. Deep Exploration via Randomized Value Functions , 2017, J. Mach. Learn. Res..
[85] Benjamin Van Roy,et al. Satisficing in Time-Sensitive Bandit Learning , 2018, Math. Oper. Res..
[86] T. L. Lai Andherbertrobbins. Asymptotically Efficient Adaptive Allocation Rules , 2022 .