Ep. 820: Tell Me Something I Don't Know with Michael Covel on Trend Following Radio
Michael Covel's Trend Following
00:00
The Upper Confidence Bound Algorithm for Refuse Minimization
There is explicitly a class of algorithms that are called regret minimization algorithms. For example, in the multi-armed bandit problem, you can formalize the notion of regret. The bad news is that even following the best possible strategy, you are still going to make mistakes. We can literally minimize our regrets by focusing on the things that have the most positive potential.
Transcript
Play full episode
