原书出处
Introduction to Algorithms, Fourth Edition
33 第33章 机器学习算法
but for now let’s assume that we do. We’ll discuss later how to remove these assumptions.
The analysis of GRADIENT-DESCENT is summarized in the following theorem. Theorem 33.8 Let x* ∈ ℝn be the minimizer of a convex function f, and suppose that an execution of GRADIENT-DESCENT(f, x(0), γ, T) returns x-avg, where and R and L are defined in equations (33.20) and (33.21). Let . Then we have f(x-avg) – f(x*) ≤ ϵ. ▪ We now prove this theorem. We do not give an absolute bound on how much progress each iteration makes. Instead, we use a potential function, as in Section 16.3. Here, we define a potential Φ(t) after computing x(t), such that Φ(t) ≥ 0 for t = 0,
…, T. We define the amortized progress in the iteration that computes x(t) as Along with
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter033.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea