@article {1616978,
	title = {Information Consistency of Nonparametric Gaussian Process Methods},
	journal = {IEEE Transactions on Information Theory},
	volume = {54},
	number = {5},
	year = {2008},
	pages = {2376 - 2382},
	abstract = {Bayesian nonparametric models are widely and successfully used for statistical prediction. While posterior consistency properties are well studied in quite general settings, results have been proved using abstract concepts such as metric entropy, and they come with subtle conditions which are hard to validate and not intuitive when applied to concrete models. Furthermore, convergence rates are difficult to obtain. By focussing on the concept of information consistency for Bayesian Gaussian process (GP)models, consistency results and convergence rates are obtained via a regret bound on cumulative log loss. These results depend strongly on the covariance function of the prior process, thereby giving a novel interpretation to penalization with reproducing kernel Hilbert space norms and to commonly used covariance function classes and their parameters. The proof of the main result employs elementary convexity arguments only. A theorem of Widom is used in order to obtain precise convergence rates for several covariance functions widely used in practice.},
	url = {https://doi.org/10.1109/TIT.2007.915707},
	author = {Matthias Seeger and Sham M. Kakade and Dean P. Foster}
}
