← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

33 第33章 机器学习算法

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

ing a term to the objective function, but it can also be achieved by adding a constraint.

One way to regularize this example would be to explicitly limit the norm of the weights, adding a constraint that ∥w∥ ≤ B for some bound B > 0. (Recall again that the components of the vector w are the variables in the present application.) Adding this constraint controls the complexity of the model, as the number of values wj that can have large absolute value is now limited. In order to run GRADIENT-DESCENT-CONSTRAINED for any problem, you need to implement the projection step, as well as to compute bounds on R and L. We conclude this section by describing these calculations for gradient descent with the constraint ∥w∥ ≤ B. First, consider the projection step in line 5. Suppose that the update in line 4 results in a vector w′. The projection is implemented by computing ∏k(w′) where K is defined by ∥w∥ ≤ B. This

particular projection can be accomplished by simply scaling w′, since we know that closes

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea