原书出处
Introduction to Algorithms, Fourth Edition
33 第33章 机器学习算法
tion, which in the analogy above is a measure of the steepness of the various directions.
Given a function f : ℝn → ℝ, its gradient ∇f is a function ∇f : ℝn → ℝn comprising n partial derivatives: . Analogous to the derivative of a function of a single variable, the gradient can be viewed as a direction in which the function value locally increases the fastest, and the rate of that increase. This view is informal; in order to make it formal we would have to define what local means and place certain conditions, such as continuity or existence of derivatives, on the function. Nevertheless, this view motivates the key step of gradient descent—move in the direction 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
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter033.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea