As far as I understand it, an advantage of the epsilon greedy algorithm is that ...

tomp on May 30, 2012 | parent | context | favorite | on: 20 lines of code that beat A/B testing every time

As far as I understand it, an advantage of the epsilon greedy algorithm is that it will relearn the best choice if it changes over time. Now, you could do that with a logarithmically-regretful algorithm as well, but it would take more time to relearn.