原书出处
Introduction to Algorithms, Fourth Edition
33 第33章 机器学习算法
n K. (b) When c is not in K. (c) When a is on the boundary of K and c coincides with b. ▪
We can now repeat the entire proof for the unconstrained case and obtain the same bounds. Lemma 33.10 with a = x*, b = x(t+1), and b′ = x′(t+1) tells us that ∥x(t+1)–x*∥2 ≤ ∥x′(t+1)–x*∥2. We can therefore derive an upper bound that matches inequality (33.31).
We continue to define Φ(t) as in equation (33.26), but noting that x(t+1), computed in li
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter033.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea