知识卡片
梯度下降沿负梯度迭代
从初始点x⁽⁰⁾开始,每轮在当前点计算∇f,再沿负梯度方向移动得到下一点。
要成为可执行算法,还必须确定步长、停止条件及可接受的解质量;方向正确不等于任意步长都下降。
这张卡片看不懂?
这张卡片的反馈已满 10 条,暂时无法继续提交。
已有反馈 · 0 / 10 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- 第33章 机器学习算法 · 查看原书依据
The general procedure of gradient descent proceeds in steps. You start at some initial point x(0), which is an n-vector. At each step t, you compute the value of the gradient of f at point x(t), that is, (∇f)(x(t)), which is also an n-vector. You then move in the direction opposite to the gradient in each dimension at x(t) to arrive at the next point x(t+1), which again is an n-vector. Because you moved in a monotonically decreasing direction in each dimension, you should have that f(x(t+1)) ≤ f(x(t)). Several details are needed to turn this idea into an actual algorithm. The two main details are that you need an initial point and that you need to decide how far to move in the direction of the negative gradient.