Analysis of some methods for Reduced Rank Gaussian Process Regression

Lecture Notes in Computer Science

Volumn 3355, Issue , 2005, Pages 98-127

  Quiñonero Candela, Joaquin ^a,b   Rasmussen, Carl Edward ^b  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

^b MAX PLANCK INSTITUTE FOR BIOLOGICAL CYBERNETICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; CLASSIFICATION (OF INFORMATION); COMPUTATIONAL COMPLEXITY; LEARNING SYSTEMS;

COVARIANCE FUNCTIONS; GAUSSIAN PROCESSES (GP); INFINITE LINEAR MODELS; REDUCED RANK GAUSSIAN PROCESS (RRGP);

REGRESSION ANALYSIS;

EID: 24144465874     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30560-6_4     Document Type: Conference Paper

References (24)

1. Cressie, N. A. C. (1993). Statistics for Spatial Data. John Wiley and Sons, Hoboken, New Jersey.
2. Csató, L. (2002). Gaussian Processes - Iterative Sparse Approximation. PhD thesis, Aston University, Birmingham, United Kingdom.
3. Csató, L. and Opper, M. (2002). Sparse online gaussian processes. Neural Computation, 14(3):641-669.
4. Gibbs, M. and MacKay, D. J. C. (1997). Efficient implementation of gaussian processes. Technical report, Cavendish Laboratory, Cambridge University, Cambridge, United Kingdom.
5. Lawrence, N., Seeger, M., and Herbrich, R. (2003). Fast sparse gaussian process methods: The informative vector machine. In Becker, S., Thrun, S., and Obermayer, K., editors, Neural Information Processing Systems 15, pages 609-616, Cambridge, Massachusetts. MIT Press.
6. MacKay, D. J. C. (1994). Bayesian non-linear modelling for the energy prediction competition. ASHRAE Transactions, 100(2): 1053-1062.
7. Mackay, D. J. C. (1997). Gaussian Processes: A replacement for supervised Neural Networks? Technical report, Cavendish Laboratory, Cambridge University, Cambridge, United Kingdom. Lecture notes for a tutorial at NIPS 1997.
8. Neal, R. M. (1996). Bayesian Learning for Neural Networks, volume 118 of Lecture Notes in Statistics. Springer, Heidelberg, Germany.
9. Press, W., Flannery, B., Teukolsky, S. A., and Vetterling, W. T. (1992). Numerical Recipes in C. Cambridge University Press, Cambridge, United Kingdom, second edition.
10. Rasmussen, C. E. (1996). Evaluation of Gaussian Processes and Other Methods for Non-linear Regression. PhD thesis, Department of Computer Science, University of Toronto, Toronto, Ontario.
11. Rasmussen, C. E. (2002). Reduced rank gaussian process learning. Unpublished Manuscript.
12. Schölkopf, B. and Smola, A. J. (2002). Learning with Kernels. MIT Press, Cambridge, Massachusetts.
13. Schwaighofer, A. and Tresp, V. (2003). Transductive and inductive methods for approximate gaussian process regression. In Becker, S., Thrun, S., and Obermayer, K., editors, Advances in Neural Information Processing Systems 15, pages 953-960, Cambridge, Massachusetts. MIT Press.
14. Seeger, M. (2003). Bayesian Gaussian Process Models: PAC-Bayesian Generalisation Error Bounds and Sparse Approximations. PhD thesis, University of Edinburgh, Edinburgh, Scotland.
15. Seeger, M., Williams, C., and Lawrence, N. (2003). Fast forward selection to speed up sparse gaussian process regression. In Bishop, C. M. and Frey, B. J., editors, Ninth International Workshop on Artificial Intelligence and Statistics. Society for Artificial Intelligence and Statistics.
16. Smola, A. J. and Bartlett, P. L. (2001). Sparse greedy Gaussian process regression. In Leen, T. K., Dietterich, T. G., and Tresp, V., editors, Advances in Neural Information Processing Systems 13, pages 619-625, Cambridge, Massachusetts. MIT Press.
17. Smola, A. J. and Schölkopf, B. (2000). Sparse greedy matrix approximation for machine learning. In Langley, P., editor, International Conference on Machine Learning 17, pages 911-918, San Francisco, California. Morgan Kaufmann Publishers.
18. Tipping, M. E. (2001). Sparse bayesian learning and the relevance vector machine. Journal of Machine Learning Research, 1:211-244.
19. Tresp, V. (2000). A bayesian committee machine. Neural Computation, 12(11):2719-2741.
20. Wahba, G., Lin, X., Gao, F., Xiang, D., Klein, R., and Klein, B. (1999). The biasvariance tradeoff and the randomized GACV. In Kerns, M. S., Solla, S. A., and Cohn, D. A., editors, Advances in Neural Information Processing Systems 11, pages 620-626, Cambridge, Massachussetts. MIT Press.
21. Williams, C. (1997a). Computation with infinite neural networks. In Mozer, M. C., Jordan, M. I., and Petsche, T., editors, Advances in Neural Information Processing Systems 9, pages 295-301, Cambridge, Massachussetts. MIT Press.
22. Williams, C. (1997b). Prediction with gaussian processes: From linear regression to linear prediction and beyond. Technical Report NCRG/97/012, Dept of Computer Science and Applied Mathematics, Aston University, Birmingham, United Kingdom.
23. Williams, C., Rasmussen, C. E., Schwaighofer, A., and Tresp, V. (2002). Observations of the nyström method for gaussiam process prediction. Technical report, University of Edinburgh, Edinburgh, Scotland.
24. Williams, C. and Seeger, M. (2001). Using the Nyström method to speed up kernel machines. In Leen, T. K., Dietterich, T. G., and Tresp, V., editors, Advances in Neural Information Processing Systems 13, pages 682-688, Cambridge, Massachussetts. MIT Press.