Artificial Intelligence Blog

We're blogging machines!

Home
About
Most popular posts
100 Theorems

Subscribe to feed

‹ 4 x 4 Minesweeper as an MDP • Optimal coding ›

Good multi armed bandit algorithms — slides

July 19, 2012 in Multi-Armed Bandit Problem by hundalhh | Permalink

Several multi-armed bandit algorithms with logarithmic regret.

Related Posts via Categories

Link/Book(pdf): “Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems”
Link: AlphaGo Wins against one of the best Go Players on the Planet
Ted Dunning on Bandits
“Stochastic Superoptimization” and “Programming by Optimization”
“Generalized Thompson sampling for sequential decision-making and causal inference”
“Trustworthy Online Controlled Experiments: Five Puzzling Outcomes Explained”
“An Empirical Evaluation of Thompson Sampling”
“Linear Bandits in High Dimension and Recommendation Systems”
“A Survey of Monte Carlo Tree Search Methods”
Schwarzenegger Bandit Success Formula

Categories

Archives

Subscribe to ArtEnt via Email

Search this site

Subscribe to feed

Powered by WordPress and Tarski