原书出处
Introduction to Algorithms, Fourth Edition
33 第33章 机器学习算法
this minimum. A 1-dimensional function is convex when its second derivative is positive.
The equivalent definition for a multidimensional function is that it is convex when its Hessian matrix is positive-semidefinite (see page 1222 for a definition), where the Hessian matrix (∇2f)(x) of a function f(x) is the matrix in which entry (i, j) is the partial derivative of f with respect to i and j: Analogous to the 1-dimensional case, the Hessian of f is just A, and so if A is a positive-semidefinite matrix, then we can use gradient descent to find a point x where Ax ≈ b. If R and L are not too large, then this method is faster than using
Gaussian elimination. Gradient descent in machine learning As a concrete example of super
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter033.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea