← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

33 第33章 机器学习算法

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

expert predictions for event t and produce a single prediction p(t) ∈ {0, 1} of your own.

You base your prediction only on the predictions of the experts and anything you have learned about the experts from their previous predictions. You do not use any additional information about the event. Only after making your prediction do you ascertain the outcome o(t) of event t. If your prediction p(t) matches o(t), then you were correct; otherwise, you made a mistake. The goal is to minimize the total number m of mistakes, where . You can also keep track of the number of mistakes each expert makes: expert Ei makes mi mistakes, where . For

example, suppose that you are following the price of a stock, and each day you decide whe

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea