原书出处
Introduction to Algorithms, Fourth Edition
33 第33章 机器学习算法
by taking the advice provided by all the experts into account, you can achieve this goal.
More formally, we use the notion of “regret,” which compares our algorithm to the performance of the best expert (in hindsight) over all. Letting m* = min {mi : 1 ≤ i ≤ n} denote the number of mistakes made by the best expert, the regret is m – m*. The goal is to design an algorithm with low regret. (Regret can be negative, although it typically isn’t, since it is rare that you do better than the best expert.) As a warm-up, let’s consider the case in which one of the experts makes a correct
prediction each time. Even without knowing who that expert is, you can still achieve good
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter033.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea