知识卡片
步长过大会越过低点并升高目标
一维示例中,沿负梯度走小步可降低函数值,过大一步却可能越过谷底使目标升高;
只允许小步下降时,又可能被初始点附近的局部极小值困住而到不了全局极小值。
这张卡片看不懂?
这张卡片的反馈已满 10 条,暂时无法继续提交。
已有反馈 · 0 / 10 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- 第33章 机器学习算法 · 查看原书依据
Too large a step, however, results in a Figure 33.3 A function f : ℝ → ℝ, shown in blue. Its gradient at point x(0), in orange, has a negative slope, and so a small increase in x from x(0) to x′ results in f(x′) < f(x(0)). Small increases in x from x(0) head toward , which gives a local minimum. Too large an increase in x can end up at x″, where f(x″) > f(x(0)). Small steps starting from x(0) and going only in the direction of decreasing values of f cannot end up at the global minimizer x*. point x″ for which f(x″) > f(x(0)), so this is a bad idea. Restricting ourselves to small steps, where each one has f(x′) < f(x), eventually
参考来源
- 位置:《算法导论(第4版)》第33章《机器学习算法》(OEBPS/chapter033.xhtml,文本字符[40000,45000))。
- 结论依据:原文第33.2节加权多数算法与势能证明,或第33.3节梯度、步长和局部极小讨论;相关公式图已核对。
- 原始内容:Too large a step, however, results in a Figure 33.3 A function f : ℝ → ℝ , shown in blue. Its gradient at point x (0) , in orange, has a negative slope, and so a small increase in x from x (0) to x ′ results in f ( x ′) < f ( x (0) ). Small increases in x from x (0) head toward , which gives a local minimum. Too large an increase in x can end up at x ″, where f ( x ″) > f ( x (0) ). Small steps starting from x (0) and going only in the direction of decreasing values of f cannot end up at the global minimizer x *. point x ″ for which f ( x ″) > f ( x (0) ), so this is a bad idea. Restricting ourselves to small steps, where each one has f ( x ′) < f ( x ), eventually