← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

33 第33章 机器学习算法

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.774Z

Lemma 33.7 For any convex function f : ℝn → ℝ, for any integer T ≥ 1, and for all x(0), …

, x(T–1) ∈ ℝn, we have ▪ The left-hand side of inequality (33.19) is the value of f at the vector x-avg that GRADIENT-DESCENT returns. We now proceed to analyze GRADIENT-DESCENT. It might not return the exact global minimizer x*. We use an error bound ϵ, and we want to choose T so that f(x-avg) – f(x*)

≤ ϵ at termination. The value of ϵ depends on the number T of iterations and two addition

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter033.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea