Live data from Hacker News

Lines of code that beat A/B testing (2012)

stevehanov.ca

1–10 of 180 posts

Re: Lines of code that beat A/B testing (2012)

#5
As one of the comments below the article states, the probabilistic alternative to epsilon-greedy is worth exploring ad well. Take the "bayesian bandit", which is not much more complex but a lot more powerful.

If you crave more bandits: https://jamesrledoux.com/algorithms/bandit-algorithms-epsilo...

Re: Lines of code that beat A/B testing (2012)

#9

As one of the comments below the article states, the probabilistic alternative to epsilon-greedy is worth exploring ad well. Take the "bayesian bandit", which is not much more complex but a lot more powerful. If you crave more bandits: https://jamesrledoux.com/algorithms/bandit-algorithms-epsilo...

We've been happy using Thompson sampling in production with this library https://github.com/bayesianbandits/bayesianbandits

Re: Lines of code that beat A/B testing (2012)

#10

Multi arm bandits are fine but their limited to tests where its ok to switch users between arms frequently and tests that have more power

> where its ok to switch users between arms frequently

It's not hard to keep track of which arm any given user was exposed to in the first run, and then repeat it.

Post reply on HN