← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

33 第33章 机器学习算法

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

y gradient descent to find the minimizer and Newton’s method to find the root. 33-2 Hedge

Another variant in the multiplicative-weights framework is known as HEDGE. It differs from WEIGHTED MAJORITY in two ways. First, HEDGE makes the prediction randomly—in iteration t, it assigns a probability to expert Ei, where . It then chooses an expert Ei′ according to this probability distribution and predicts according to Ei′. Second, the update rule is different. If an expert makes a mistake, line 16 updates that expert’s weight by the rule , for some 0 < ϵ < 1. Show that the expected number of mistakes made by HEDGE, running for T rounds, is at most m* + (ln n)/ϵ + ϵT. 33-3 Nonoptimality of Lloyd’s procedure in one dimension Give an example to show that even in one dimension, Lloyd’s procedure for finding clusters

does not always return an optimum result. That is, Lloyd’s procedure may terminate and re

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea