原书出处
Introduction to Algorithms, Fourth Edition
33 第33章 机器学习算法
ore, one way to solve ax = b for a ≥ 0 is to find the minimizer for via gradient descent.
We now generalize this idea to higher dimensions, where using gradient descent may actually lead to a faster algorithm. One n-dimensional analog is the function , where A is an n × n matrix. The gradient of f with respect to x is the function Ax – b. To find the value of x that minimizes f, we set the gradient of f to 0 and solve for x. Solving Ax–b = 0 for x, we obtain x = A−1b, Thus, minimizing f(x) is equivalent to solving Ax = b. If f(x) is convex, then gradient descent can approximately compute 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)
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter033.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea