arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0609045cs.LG
收藏

竞争在线预测中的度量熵

Metric entropy in competitive on-line prediction

Vladimir Vovk

摘要:

竞争性在线预测(也称为个体序列的通用预测)是一种学习理论,避免对观察结果的生成方式做出任何随机假设。预测器的目标是与预测规则的基准类竞争,这通常是一个适当的Banach函数空间。度量熵为竞争性在线预测提供了一个统一的框架:函数空间中各种紧集的度量熵的众多已知上界很容易暗示在线预测策略的性能上界。本文讨论的优势和局限性的直接方法,竞争力的在线预测,通过度量熵,包括与其他方法的比较。

英文摘要:

Competitive on-line prediction (also known as universal prediction of individual sequences) is a strand of learning theory avoiding making any stochastic assumptions about the way the observations are generated. The predictor's goal is to compete with a benchmark class of prediction rules, which is often a proper Banach function space. Metric entropy provides a unifying framework for competitive on-line prediction: the numerous known upper bounds on the metric entropy of various compact sets in function spaces readily imply bounds on the performance of on-line prediction strategies. This paper discusses strengths and limitations of the direct approach to competitive on-line prediction via metric entropy, including comparisons to other approaches.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑