论文信息 - Entropy bounds on Bayesian learning - 字舞流文

Entropy bounds on Bayesian learning

Tristan Tomala | O. Gossner

[1] D. Blackwell,et al. Merging of Opinions with Increasing Information , 1962 .

[2] Andrew R. Barron,et al. Information-theoretic asymptotics of Bayes methods , 1990, IEEE Trans. Inf. Theory.

[3] Thomas M. Cover,et al. Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing) , 2006 .

[4] Thomas M. Cover,et al. Elements of Information Theory , 2005 .

[5] E. Kalai,et al. Rational Learning Leads to Nash Equilibrium , 1993 .

[6] Ehud Kalai,et al. Weak and Strong Merging of Opinions , 1994 .

[7] Ehud Lehrer,et al. Compatible Measures and Merging , 1996, Math. Oper. Res..

[8] Alvaro Sandroni,et al. The speed of rational learning , 1999, Int. J. Game Theory.

[9] E. Kalai,et al. Calibrated Forecasting and Merging , 1999 .

[10] Sylvain Sorin,et al. Merging, Reputation, and Repeated Games with Incomplete Information , 1999 .

[11] E. Lehrer,et al. Relative entropy in sequential decision problems , 2000 .

[12] Benjamin Van Roy,et al. Manipulation Robustness of Collaborative Filtering Systems , 2009, ArXiv.