返回主题:线性模型与优化算法

此卡片不在当前主题的阅读序列中,可返回主题继续阅读。

知识卡片

普通读书笔记卡 · 3710.g

机器学习可表为假设损失优化

理解等级:中级

先用参数θ定义假设hθ,再以损失f(E,θ)衡量它对训练数据E的拟合不足,最后寻找使损失尽量小的θ。

k均值中参数就是各中心的位置;优化目标可只找到局部最小。

这张卡片看不懂?

已有反馈 · 0 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • 第33章 机器学习算法 · 查看原书依据

      Second, define a measure f(E, θ) describing how poorly hypothesis hθ fits the given training data E. Smaller values of f(E, θ) are better, and a (locally) optimal solution (locally) minimizes f(E, θ). (For the k-means problem, f(E, θ) is just f(S, C).) Third, given a set of training data E, use a suitable optimization procedure to find a value of θ* that minimizes f(E, θ*), at least locally. (For the k-means problem, this value of θ* is the sequence C of k center points returned by Lloyd’s algorithm.) Return θ* as the answer. In this framework, we see that optimization becomes a

    参考来源

    - 位置:《算法导论(第4版)》第33章《机器学习算法》(OEBPS/chapter033.xhtml,文本字符[20000,25000))。 - 结论依据:原文第33.1–33.2节质心和分配定理、劳埃德过程、假设优化框架、色彩量化示例或专家预测引理。 - 原始内容:Second, define a measure f ( E , θ ) describing how poorly hypothesis h θ fits the given training data E . Smaller values of f ( E , θ ) are better, and a (locally) optimal solution (locally) minimizes f ( E , θ ). (For the k -means problem, f ( E , θ ) is just f ( S , C ).) Third, given a set of training data E , use a suitable optimization procedure to find a value of θ * that minimizes f ( E , θ *), at least locally. (For the k -means problem, this value of θ * is the sequence C of k center points returned by Lloyd’s algorithm.) Return θ * as the answer. In this framework, we see that optimization becomes a