知识卡片
加权多数票汇总专家预测
每轮把预测1和预测0的专家权重分别求和,选择权重和较大的一侧作为预测;相等时按约定选1。
多数票依据当前信任权重,而非简单数人数。
这张卡片看不懂?
这张卡片已通过人工审查,不再接受失败反馈。
已有反馈 · 0 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- 第33章 机器学习算法 · 查看原书依据
, 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
参考来源
- 位置:《算法导论(第4版)》第33章《机器学习算法》(OEBPS/chapter033.xhtml,文本字符[30000,35000))。
- 结论依据:原文第33.2节加权多数算法与势能证明,或第33.3节梯度、步长和局部极小讨论;相关公式图已核对。
- 原始内容:Each iteration of the main for loop of lines 3–18 does the following for an event t = 1, 2, …, T . Each expert E i 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