News for hackers. Stuff that matters.
Re:Why Multi-armed Bandit algorithms are superior to A/B tes... by gcanyon on Monday June 04, 2012 @04:18AM (#4063112)
Doesn't this method also (over) simplify? It goes into pseudo explorer mode anytime there is a >0 probability that the presumed worst cast is actually better than the presumed best/better case. Shouldn't there be a threshold to that process, so that the presumed worst case must have at least a (for example) .05 probability of being better before the algorithm gives it a shot?

There are no comments on this comment yet.