A unifying view of sparse approximate Gaussian process regression

Journal of Machine Learning Research

Volumn 6, Issue , 2005, Pages 1939-1959

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

^a MAX PLANCK INSTITUTE FOR BIOLOGICAL CYBERNETICS   (Germany)

Author keywords

Bayesian committee machine; Gaussian process; Probabilistic regression; Sparse approximation

Indexed keywords

APPROXIMATION THEORY; COMPUTATION THEORY; CONSTRAINT THEORY; PROBABILITY;

BAYESIAN COMMITTE MACHINES; GAUSSIAN PROCESS; PROBABILISTIC REGRESSION; SPARSE APPROXIMATION;

REGRESSION ANALYSIS;

EID: 29144453489     PISSN: 15337928     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Article

References (21)

1. Corinna Cortes and Vladimir Vapnik. Support-vector network. Machine Learning, 20(3):273-297, 1995.
2. Lehel Csatoó and Manfred Opper. Sparse online Gaussian processes. Neural Computation, 14(3): 641-669, 2002.
3. Sathiya Keerthi and Wei Chu. A Matching Pursuit approach to sparse Gaussian process regression. In Y. Weiss, B. Schölkopf, and J. Platt, editors, Advances in Neural Information Processing Systems 18, Cambridge, Massachussetts, 2006. The MIT Press.
4. Malte KussS and Carl Edward Rasmussen. Assessing approximate inference for binary Gaussian process classification. Journal of Machine Learning Research, pages 1679-1704, 2005.
5. Joaquin Quiñonero-Candela. Learning with Uncertainty - Gaussian Processes and Relevance Vector Machines. PhD thesis, Technical University of Denmark, Lyngby, Denmark, 2004.
6. Carl Edward Rasmussen. Reduced rank Gaussian process learning. Technical report, Gatsby Computational Neuroscience Unit, UCL, 2002.
7. Carl Edward Rasmussen and Joaquin Quiñonero-Candela. Healing the relevance vector machine by augmentation. In International Conference on Machine Learning, 2005.
8. Carl Edward Rasmussen and Christopher K. I. Williams. Gaussian Processes for Machine Learning. The MIT press, 2006.
9. Anton Schwaighofer and Volker Tresp. Transductive and inductive methods for approximate Gaussian process regression. In Suzanna Becker, Sebastian Thrun, and Klaus Obermayer, editors, Advances in Neural Information Processing Systems 75, pages 953-960, Cambridge, Massachussetts, 2003. The MIT Press.
10. Matthias Seeger, Christopher K. I. Williams, and Neil Lawrence. Fast forward selection to speed up sparse Gaussian process regression. In Christopher M. Bishop and Brendan J. Frey, editors, Ninth International Workshop on Artificial Intelligence and Statistics. Society for Artificial Intelligence and Statistics, 2003.
11. Bernhard W. Silverman. Some aspects of the spline smoothing approach to non-parametric regression curve fitting. J. Roy. Stat. Soc. B, 47(1):1-52, 1985. (with discussion).
12. Alexander J. Smola and Peter L. Bartlett. Sparse greedy Gaussian process regression. In Todd K. Leen, Thomas G. Dietterich, and Volker Tresp, editors, Advances in Neural Information Processing Systems 13, pages 619-625, Cambridge, Massachussetts, 2001. The MIT Press.
13. Edward Snelson and Zoubin Ghahramani. Sparse Gaussian processes using pseudo-inputs. In Y. Weiss, B. Schölkopf, and J. Platt, editors, Advances in Neural Information Processing Systems 18, Cambridge, Massachussetts, 2006. The MIT Press.
14. Michael E. Tipping. Sparse Bayesian learning and the Relevance Vector Machine. Journal of Machine Learning Research, 1:211-244, 2001.
15. Volker Tresp. A Bayesian committee machine. Neural Computation, 12(11):2719-2741, 2000.
16. Vladimir N. Vapnik. The Nature of Statistical Learning Theory. Springer Verlag, 1995.
17. Grace Wahba, Xiwu Lin, Fangyu Gao, Dong Xiang, Ronald Klein, and Barbara Klein. The bias-variance tradeoff and the randomized GACV. In Michael S. Kerns, Sara A. Solla, and David A. Cohn, editors, Advances in Neural Information Processing Systems 11, pages 620-626, Cambridge, Massachussetts, 1999. The MIT Press.
18. Christopher K. I. Williams and Carl Edward Rasmussen. Gaussian processes for regression. In David S. Touretzky, Michael C. Mozer, and Michael E. Hasselmo, editors, Advances in Neural Information Processing Systems 8, pages 514-520, Cambridge, Massachussetts, 1996. The MIT Press.
19. Christopher K. I. Williams, Carl Edward Rasmussen, Anton Schwaighofer, and Volker Tresp. Observations of the Nyström method for Gaussiam process prediction. Technical report, University of Edinburgh, Edinburgh, Scotland, 2002.
20. Christopher K. I. Williams and Mathias Seeger. Using the Nyström method to speed up kernel machines. In Todd K. Leen, Thomas G. Dietterich, and Volker Tresp, editors, Advances in Neural Information Processing Systems 13, pages 682-688, Cambridge, Massachussetts, 2001. The MIT Press.
21. David Wipf, Jason Palmer, and Bhaskar Rao. Perspectives on sparse Bayesian learning. In Sebastian Thrun, Lawrence Saul, and Bernhard Schölkopf, editors, Advances in Neural Information Processing Systems 16, Cambridge, Massachussetts, 2004. The MIT Press.