A Criterion for the Existence of Predictive Complexity for Binary Games
暂无分享,去创建一个
[1] Yuri Kalnishkan. General linear relations between different types of predictive complexity , 2002, Theor. Comput. Sci..
[2] William Feller,et al. An Introduction to Probability Theory and Its Applications , 1951 .
[3] Vladimir Vovk,et al. Loss functions, complexities, and the Legendre transformation , 2004, Theor. Comput. Sci..
[4] Yuri Kalnishkan,et al. Mixability and the Existence of Weak Complexities , 2002, COLT.
[5] L. Levin,et al. THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS , 1970 .
[6] Ming Li,et al. An Introduction to Kolmogorov Complexity and Its Applications , 2019, Texts in Computer Science.
[7] Vladimir Vovk,et al. Universal portfolio selection , 1998, COLT' 98.
[8] Vladimir Vovk,et al. A game of prediction with expert advice , 1995, COLT '95.
[9] David Haussler,et al. Sequential Prediction of Individual Sequences Under General Loss Functions , 1998, IEEE Trans. Inf. Theory.
[10] D. Varberg. Convex Functions , 1973 .
[11] Yuri Kalnishkan,et al. On the Absence of Predictive Complexity for Some Games , 2002, ALT.
[12] V. V. Petrov. Sums of Independent Random Variables , 1975 .