Worst-case bounds for Gaussian process models

Advances in Neural Information Processing Systems

Volumn , Issue , 2005, Pages 619-626

  Kakade, Sham M ^a   Seeger, Matthias W ^b   Foster, Dean P ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPETITIVE ANALYSIS; GAUSSIAN PROCESS MODELS; GAUSSIAN PROCESS PRIORS; GAUSSIAN REGRESSION; LOGISTIC REGRESSIONS; MINIMAX; MINIMAX STRATEGY; MINIMUM DESCRIPTION LENGTH; NON-PARAMETRIC; NON-PARAMETRIC BAYESIAN; ONLINE LEARNING; PROBABILISTIC ASSUMPTIONS;

ALGORITHMS; GAUSSIAN NOISE (ELECTRONIC); LOGISTICS;

GAUSSIAN DISTRIBUTION;

EID: 84864042783     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. K. S. Azoury and M. Warmuth. Relative loss bounds for on-line density estimation with the exponential family of distributions. Machine Learning, 43(3), 2001.
2. A. Barron, J. Rissanen, and B. Yu. The minimum description length principle in coding and modeling. IEEE Trans. Information Theory, 44, 1998.
3. Nicolo Cesa-Bianchi and Gabor Lugosi. Worst-case bounds for the logarithmic loss of predictors. Machine Learning, 43, 2001.
4. D. P. Foster. Prediction in the worst case. Annals of Statistics, 19, 1991.
5. D. P. Foster and R. A. Stine. The competitive complexity ratio. Proceedings of 2001 Conf on Info Sci and Sys, WP8, 2001.
6. P.D. Grunwald. A tutorial introduction to the minimum description length principle. Advances in MDL: Theory and Applications, 2005.
7. T. Hastie, R. Tibshirani, , and J. Friedman. The Elements of Statistical Learning. Springer, 2001.
8. S. M. Kakade and A. Y. Ng. Online bounds for bayesian algorithms. Proceedings of Neural Information Processing Systems, 2004.
9. M. Opper and D. Haussler. Worst case prediction over sequences under log loss. The Mathematics of Information Coding, Extraction and Distribution, 1998.
10. Y. Shtarkov. Universal sequential coding of single messages. Problems of Information Transmission, 23, 1987.
11. E. Takimoto and M. Warmuth. The minimax strategy for Gaussian density estimation. Proc. 13th Annu. Conference on Comput. Learning Theory, 2000.
12. Vladimir N. Vapnik. Statistical Learning Theory. Wiley, 1st edition, 1998.
13. V. Vovk. Competitive on-line statistics. International Statistical Review, 69, 2001.