暂无分享,去创建一个
[1] Raphail E. Krichevsky,et al. The performance of universal encoding , 1981, IEEE Trans. Inf. Theory.
[2] L. Tierney,et al. Accurate Approximations for Posterior Moments and Marginal Densities , 1986 .
[3] Shun-ichi Amari,et al. Natural Gradient Works Efficiently in Learning , 1998, Neural Computation.
[4] Manfred K. Warmuth,et al. The Last-Step Minimax Algorithm , 2000, ALT.
[5] Shun-ichi Amari,et al. Methods of information geometry , 2000 .
[6] Gábor Lugosi,et al. Prediction, learning, and games , 2006 .
[7] T. Roos,et al. Bayesian network structure learning using factorized NML universal models , 2008, 2008 Information Theory and Applications Workshop.
[8] J. Rissanen,et al. ON SEQUENTIALLY NORMALIZED MAXIMUM LIKELIHOOD MODELS , 2008 .
[9] Wojciech Kotlowski,et al. Prequential plug-in codes that achieve optimal redundancy rates even if the model is wrong , 2010, 2010 IEEE International Symposium on Information Theory.
[10] Jorma Rissanen,et al. Minimum Description Length Principle , 2010, Encyclopedia of Machine Learning.
[11] P. Grünwald,et al. Following the Flattened Leader , 2010, Annual Conference Computational Learning Theory.
[12] P. Bartlett,et al. The Optimality of Jeffreys Prior for Online Density Estimation and the Asymptotic Normality of Maximum Likelihood Estimators , 2012, COLT.
[13] Peter L. Bartlett,et al. Horizon-Independent Optimal Prediction with Log-Loss in Exponential Families , 2013, COLT.