知识卡片
正则化用复杂度惩罚约束拟合
训练目标可加入正则项,对过于复杂的假设施加惩罚,以缓解只对训练数据拟合很好的过拟合。
书中仅说明这个设计入口,没有给出具体正则形式或保证。
这张卡片看不懂?
这张卡片已通过人工审查,不再接受失败反馈。
已有反馈 · 0 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- 第33章 机器学习算法 · 查看原书依据
Using optimization in this way is flexible. For example, regularization terms can be incorporated in the function to be minimized, in order to penalize hypotheses that are “too complicated” and that “overfit” the training data. (Regularization is a complex topic that isn’t pursued further here.) Examples Figure 33.1 demonstrates Lloyd’s procedure on a set of n = 49 cities: 48 U.S. state capitals and the District of
参考来源
- 位置:《算法导论(第4版)》第33章《机器学习算法》(OEBPS/chapter033.xhtml,文本字符[20000,25000))。
- 结论依据:原文第33.1–33.2节质心和分配定理、劳埃德过程、假设优化框架、色彩量化示例或专家预测引理。
- 原始内容:Using optimization in this way is flexible. For example, regularization terms can be incorporated in the function to be minimized, in order to penalize hypotheses that are “too complicated” and that “overfit” the training data. (Regularization is a complex topic that isn’t pursued further here.) Examples Figure 33.1 demonstrates Lloyd’s procedure on a set of n = 49 cities: 48 U.S. state capitals and the District of