原书出处
Introduction to Algorithms, Fourth Edition
33 第33章 机器学习算法
sired error parameter ϵ, and because the performance is independent of the initial point.
Another case in which gradient descent can be shown to perform better than the analysis in Section 33.3 suggests is for smooth convex functions. We say that a function is β-smooth if . This inequality goes in the opposite direction from the one for ≈-strong convexity. Better bounds on gradient descent are possible here as well. 1 Although the curve in Figure 33.4 looks concave, according to the definition of convexity that we’ll see below, the function f in the figure is convex. 2 A function f : ℝn → ℝ is closed
if, for each α ∈ ℝ, the set {x ∈ dom(f) : f(x) ≤ α} is closed, where dom(f) is the domain
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter033.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea