Some Sufficient Conditions on an Arbitrary Class of Stochastic Processes for the Existence of a Predictor
暂无分享,去创建一个
[1] Suguru Arimoto,et al. An algorithm for computing the capacity of arbitrary discrete memoryless channels , 1972, IEEE Trans. Inf. Theory.
[2] Aarnout Brombacher,et al. Probability... , 2009, Qual. Reliab. Eng. Int..
[3] Richard E. Blahut,et al. Computation of channel capacity and rate-distortion functions , 1972, IEEE Trans. Inf. Theory.
[4] Vladimir Vapnik,et al. Statistical learning theory , 1998 .
[5] David Haussler,et al. A general minimax result for relative entropy , 1997, IEEE Trans. Inf. Theory.
[6] Y. Shtarkov. AIM FUNCTIONS AND SEQUENTIAL ESTIMATION OF THE SOURCE MODEL FOR UNIVERSAL CODING , 1999 .
[7] D. Blackwell,et al. Merging of Opinions with Increasing Information , 1962 .
[8] Andrew R. Barron,et al. Asymptotic minimax regret for data compression, gambling, and prediction , 1997, IEEE Trans. Inf. Theory.
[9] Daniil Ryabko. Sample Complexity for Computational Classification Problems , 2007, Algorithmica.
[10] Marcus Hutter,et al. Predicting non-stationary processes , 2008, Appl. Math. Lett..
[11] R. E. Krichevskii. Universal Compression and Retrieval , 1994 .
[12] Ray J. Solomonoff,et al. Complexity-based induction systems: Comparisons and convergence theorems , 1978, IEEE Trans. Inf. Theory.
[13] Marcus Hutter,et al. On Sequence Prediction for Arbitrary Measures , 2007, 2007 IEEE International Symposium on Information Theory.
[14] Marcus Hutter,et al. Universal Artificial Intelligence: Sequential Decisions Based on Algorithmic Probability (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .
[15] M. Jackson,et al. Bayesian Representation of Stochastic Processes under Learning: de Finetti Revisited , 1999 .