知识卡片
牛顿法以切线零点更新求根
一维牛顿法在当前点用切线近似函数,并以该切线与横轴的交点作下一点:x⁽ᵗ⁺¹⁾=x⁽ᵗ⁾−f(x⁽ᵗ⁾)/f′(x⁽ᵗ⁾)。
导数不能为零,且局部收敛依赖起点与函数条件。
这张卡片看不懂?
这张卡片的反馈已满 10 条,暂时无法继续提交。
已有反馈 · 0 / 10 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- 第33章 机器学习算法 · 查看原书依据
Problems 33-1 Newton’s method Gradient descent iteratively moves closer to a desired value (the minimum) of a function. Another algorithm in this spirit is known as Newton’s method, which is an iterative algorithm that finds the root of a function. Here, we consider Newton’s method which, given a function f : ℝ → ℝ, finds a value x* such that f(x* ) = 0. The algorithm moves through a series of points x(0), x(1),
参考来源
- 位置:《算法导论(第4版)》第33章《机器学习算法》(OEBPS/chapter033.xhtml,文本字符[70000,75000))。
- 结论依据:原文第33.3节或章末题目、注记;相关公式图已核对,未解答书中练习。
- 原始内容:Problems 33-1 Newton’s method Gradient descent iteratively moves closer to a desired value (the minimum) of a function. Another algorithm in this spirit is known as Newton’s method , which is an iterative algorithm that finds the root of a function. Here, we consider Newton’s method which, given a function f : ℝ → ℝ , finds a value x * such that f ( x * ) = 0. The algorithm moves through a series of points x (0) , x (1) , …. If the algorithm is currently at a point x ( t ) , then to find point x ( t +1) , it first takes the equation of the line tangent to the curve at x = x ( t ) , y = f ′( x ( t ) )( x – x ( t ) ) + f ( x ( t ) ). It then uses the x -intercept of this line as the next point x ( t +1) . a. Show that the algorithm described above can be summarized by