Andere Kunden interessierten sich auch für
![Explaining the Success of Nearest Neighbor Methods in Prediction]( "Explaining the Success of Nearest Neighbor Methods in Prediction")
Explaining the Success of Nearest Neighbor Methods in Prediction106,99 €![Introduction to Multi-Armed Bandits]( "Introduction to Multi-Armed Bandits")
Introduction to Multi-Armed Bandits105,99 €![Elements of Sequential Monte Carlo]( "Elements of Sequential Monte Carlo")
Elements of Sequential Monte Carlo96,99 €![An Introduction to Deep Reinforcement Learning]( "An Introduction to Deep Reinforcement Learning")
An Introduction to Deep Reinforcement Learning105,99 €![An Introduction to Wishart Matrix Moments]( "An Introduction to Wishart Matrix Moments")
An Introduction to Wishart Matrix Moments96,99 €![The AI Expedition]( "The AI Expedition")
The AI Expedition31,99 €![Experimental Studies on Wire Electric Discharge Machining of Superalloys]( "Experimental Studies on Wire Electric Discharge Machining of Superalloys")
Experimental Studies on Wire Electric Discharge Machining of Superalloys27,99 €
Thompson sampling is an algorithm for online decision problems where actions are taken sequentially in a manner that must balance between exploiting what is known to maximize immediate performance and investing to accumulate new information that may improve future performance. The algorithm addresses a broad range of problems in a computationally efficient manner and is therefore enjoying wide use. A Tutorial on Thompson Sampling covers the algorithm and its application, illustrating concepts through a range of examples, including Bernoulli bandit problems, shortest path problems, product recommendation, assortment, active learning with neural networks, and reinforcement learning in Markov decision processes. Most of these problems involve complex information structures, where information revealed by taking an action informs beliefs about other actions. It also discusses when and why Thompson sampling is or is not effective and relations to alternative algorithms.