← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

33 第33章 机器学习算法

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.773Z

tion opposite to the gradient, by a distance influenced by the magnitude of the gradient.

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.

You also need to understand when to stop and what you can conclude about the quality of t

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter033.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea