原书出处
Introduction to Algorithms, Fourth Edition
33 第33章 机器学习算法
+1)) // project onto K 6 x-avg = sum/T // divide each of n dimensions by T 7 return x-avg
Lemma 33.10 Consider a convex body K ⊆ ℝn and points a ∈ K and b′ ∈ ℝn. Let b = ∏K(b′). Then ∥b – a∥2 ≤ ∥b′ – a∥2.
Proof If b′ ∈ K, then b = b′ and the claim is true. Otherwise, b′ ≠ b, and as Figure 33.6
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter033.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea