原书出处
Introduction to Algorithms, Fourth Edition
33 第33章 机器学习算法
t E(i) made a mistake … 16 // … then decrease that expert’s weight 17 else 18 return p(t)
Theorem 33.4 When running WEIGHTED-MAJORITY, we have, for every expert Ei and every event T′ ≤ T,
Proof Every time an expert Ei makes a mistake, its weight, which is initially 1, is multi
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter033.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea