Bandit Algorithms Book [pdf]

I skimmed through this and have already found a bunch of interesting sections, but there's also a ton of background information on topics related to bandit algorithms.

The authors say that this is the first draft of the book submitted to the publisher, so I suppose it's nearly complete? More details available at the site they put up, http://banditalgs.com/

Cool, nice to see that Tor was a student at ANU.

I really appreciate sharing the book. However, to everyone in charge with naming these files, please don't call it "book.pdf". It makes everyone go to their computer and rename the file after downloading it so that they can find it later. Give it a more intuitive name.

Thanks

Never heard of bandit algorithms before! Or if I did I didn't recognize it as something different from probability. What have people around here used them for?

You can use it when determining the best solution being tested in as few trials as possible.

Say you are selling a product and you are AB testing something related to buying the product. When a user visits the site you ideally want to give him the version you are more confident is better. By using a bandit approach you can determine if say option A is currently better (w.r.t. some confidence bounds). After each visit you can update the bounds and after sufficiently many visits you have a winner. The main difference to more traditional AB testing is that the process is more adaptive and less time is wasted on exposing an inferior product to the user.