- 1、本文档共8页,可阅读全部内容。
- 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
General Loss Bounds for Universal Sequence Prediction
a
r
X
i
v
:
c
s
/
0
1
0
1
0
1
9
v
2
[
c
s
.A
I
]
1
9
S
e
p
2
0
0
1
General Loss Bounds for Universal Sequence Prediction
Marcus Hutter
IDSIA, Galleria 2, CH-6928 Manno-Lugano, Switzerland
marcus@idsia.ch http://www.idsia.ch/~marcus
Technical Report IDSIA-03-01, 10 April 2001
Keywords
Bayesian and deterministic prediction; general loss
function; Solomonoff induction; Kolmogorov com-
plexity; leaning; universal probability; loss bounds;
games of chance; partial and delayed prediction;
classification.
Abstract
The Bayesian framework is ideally suited for induc-
tion problems. The probability of observing xt at
time t, given past observations x1...xt?1 can be com-
puted with Bayes’ rule if the true distribution μ
of the sequences x1x2x3... is known. The problem,
however, is that in many cases one does not even
have a reasonable estimate of the true distribution.
In order to overcome this problem a universal dis-
tribution ξ is defined as a weighted sum of distri-
butions μi ∈ M , where M is any countable set of
distributions including μ. This is a generalization of
Solomonoff induction, in which M is the set of all
enumerable semi-measures. Systems which predict
yt, given x1...xt?1 and which receive loss lxtyt if xt is
the true next symbol of the sequence are considered.
It is proven that using the universal ξ as a prior is
nearly as good as using the unknown true distribu-
tion μ. Furthermore, games of chance, defined as
a sequence of bets, observations, and rewards are
studied. The time needed to reach the winning zone
is bounded in terms of the relative entropy of μ and
ξ. Extensions to arbitrary alphabets, partial and
delayed prediction, and more active systems are dis-
cussed.
1 Introduction
1.1 Induction
Many problems are of induction type, in which statements
about the future have to be made, based on past obser-
vations. What is the probability of rain tomorrow, given
the weather observations of the last few days? Is the
Dow Jones likely to rise tomorrow
您可能关注的文档
- EasyASURO 中文精要操作步骤.pdf
- E-SMARTER-COMMERCE概况.ppt [Compatibility Mode].pdf
- easyUI属性汇总.pdf
- EasyUI组件使用.pdf
- EBSCOhost2.0a.ppt
- EB_Propsim_F8.pdf
- ebookchain白皮书.pdf
- Ecological Optimization For A Generalized Irreversible Carnot Engine With An Universal Heat.pdf
- Econometrics_Slide02.pdf
- Eclipse+ADT+NDK调试C源码的方法.pdf
文档评论(0)