原书出处
Introduction to Algorithms, Fourth Edition
33 第33章 机器学习算法
to the k-means problem. Explain how to use gradient descent to solve the k-means problem.
Problems 33-1 Newton’s method Gradient descent iteratively moves closer to a desired value (the minimum) of a function. Another algorithm in this spirit is known as Newton’s method, which is an iterative algorithm that finds the root of a function. Here, we consider Newton’s method which, given a function f : ℝ → ℝ, finds a value x* such that f(x* ) = 0. The algorithm moves through a series of points x(0), x(1),
…. If the algorithm is currently at a point x(t), then to find point x(t+1), it first tak
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter033.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea