原书出处
Introduction to Algorithms, Fourth Edition
33 第33章 机器学习算法
t represents all values λf(x) + (1 – λ)f(y) for 0 ≤ λ ≤ 1, and it is above the blue line.
A convex function has the property that any local minimum is also a global minimum. To verify this property, consider inequality (33.18), and suppose for the purpose of contradiction that x is a local minimum but not a global minimum and y ≠ x is a global minimum, so f(y) < f(x). Then we have f(λx + (1 – λ)y) ≤ λf(x) + (1 – λ)f(y) (by inequality (33.18)) < λf(x) + (1 – λ)f(x) = f(x). Thus, letting approach 1, we see that there is another point near x, say x′, such that f(x′) < f(x), so x is not a local minimum. Convex functions have several useful properties. The first property, whose proof we leave as Exercise 33.3-1, says that a convex function always lies above its tangent hyperplane. In the context of gradient descent, angle brackets denote the notation
for inner product defined on page 1219 rather than denoting a sequence. Lemma 33.6 For an
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter033.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea