← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

33 第33章 机器学习算法

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.773Z

h iteration of the main for loop of lines 3–18 does the following for an event t = 1, 2, …

, T. Each expert Ei makes a prediction for event t in line 4. Lines 5–8 compute upweight(t), the sum of the weights of the experts who predict 1 for event t, and downweight(t), the sum of the weights of the experts who predict 0 for the event. Lines 9–11 decide the algorithm’s prediction p(t) for event t based on whichever weighted sum is larger (breaking ties in favor of deciding 1). The outcome of event t is revealed in line 12. Finally, lines 14–17 decrease the weights of the experts who made an incorrect prediction for event t by multiplying

their weights by 1 – γ, leaving alone the weights of the experts who correctly predicted

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter033.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea