Asymptotics of Bayesian Inference for a Class of Probabilistic Models under Misspecification

被引:0
作者
Miya, Nozomi [1 ]
Suko, Tota [2 ]
Yasuda, Goki [1 ]
Matsushima, Toshiyasu [1 ]
机构
[1] Waseda Univ, Grad Sch Fundamental Sci & Engn, Dept Math & Appl Math, Tokyo 1698555, Japan
[2] Waseda Univ, Sch Social Sci, Tokyo 1698050, Japan
关键词
a class of probabilistic models; Bayesian inference; cumulative logarithmic loss; misspecification; sequential prediction; DATA-COMPRESSION; REDUNDANCY; CODES;
D O I
10.1587/transfun.E97.A.2352
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, sequential prediction is studied. The typical assumptions about the probabilistic model in sequential prediction are following two cases. One is the case that a certain probabilistic model is given and the parameters are unknown. The other is the case that not a certain probabilistic model but a class of probabilistic models is given and the parameters are unknown. If there exist some parameters and some models such that the distributions that are identified by them equal the source distribution, an assumed model or a class of models can represent the source distribution. This case is called that specifiable condition is satisfied. In this study, the decision based on the Bayesian principle is made for a class of probabilistic models (not for a certain probabilistic model). The case that specifiable condition is not satisfied is studied. Then, the asymptotic behaviors of the cumulative logarithmic loss for individual sequence in the sense of almost sure convergence and the expected loss, i.e. redundancy are analyzed and the constant terms of the asymptotic equations are identified.
引用
收藏
页码:2352 / 2360
页数:9
相关论文
共 22 条
[1]   NEW LOOK AT STATISTICAL-MODEL IDENTIFICATION [J].
AKAIKE, H .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1974, AC19 (06) :716-723
[2]  
[Anonymous], 2006, Pattern recognition and machine learning
[3]  
[Anonymous], 1976, Suri-Kagaku (Mathematical Sciences)
[4]   The asymptotic redundancy of Bayes rules for Markov chains [J].
Atteson, K .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (06) :2104-2109
[5]   INFORMATION-THEORETIC ASYMPTOTICS OF BAYES METHODS [J].
CLARKE, BS ;
BARRON, AR .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1990, 36 (03) :453-471
[6]   JEFFREYS PRIOR IS ASYMPTOTICALLY LEAST FAVORABLE UNDER ENTROPY RISK [J].
CLARKE, BS ;
BARRON, AR .
JOURNAL OF STATISTICAL PLANNING AND INFERENCE, 1994, 41 (01) :37-60
[7]  
Gotoh M, 1998, IEICE T FUND ELECTR, VE81A, P2123
[8]   Sequential prediction of individual sequences under general loss functions [J].
Haussler, D ;
Kivinen, J ;
Warmuth, MK .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (05) :1906-1925
[9]   Optimal Lossless Data Compression: Non-Asymptotics and Asymptotics [J].
Kontoyiannis, Ioannis ;
Verdu, Sergio .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2014, 60 (02) :777-795
[10]  
Lehmann E. L., 2006, THEORY POINT ESTIMAT, DOI 10.1007/b98854