Lines of code that beat A/B testing (2012)
stevehanov.ca
Lines of code that beat A/B testing (2012)
1–10 of 180 posts
Re: Lines of code that beat A/B testing (2012)
#2Re: Lines of code that beat A/B testing (2012)
#3Re: Lines of code that beat A/B testing (2012)
#4How times have changed :)
Re: Lines of code that beat A/B testing (2012)
#5If you crave more bandits: https://jamesrledoux.com/algorithms/bandit-algorithms-epsilo...
Re: Lines of code that beat A/B testing (2012)
#6Re: Lines of code that beat A/B testing (2012)
#7Nothing shows on this page without JavaScript except for the header and a grey background. A bit strange for a blog.
Re: Lines of code that beat A/B testing (2012)
#8Re: Lines of code that beat A/B testing (2012)
#9As 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)
#10Multi arm bandits are fine but their limited to tests where its ok to switch users between arms frequently and tests that have more power
It's not hard to keep track of which arm any given user was exposed to in the first run, and then repeat it.