原书出处
Introduction to Algorithms, Fourth Edition
33 第33章 机器学习算法
n each time. Even without knowing who that expert is, you can still achieve good results.
Lemma 33.3 Suppose that out of n experts, there is one who always makes the correct prediction for all T events. Then there is an algorithm that makes at most ⌈1g n⌉ mistakes. Proof The algorithm maintains a set S consisting of experts who have not yet made a mistake. Initially, S contains all n experts. The algorithm’s prediction is always the majority vote of the predictions of the experts remaining in set S.
In case of a tie, the algorithm makes any prediction. After each outcome is learned, set
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter033.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea