Local and global sparse Gaussian process approximations.

作者: Edward Snelson , Zoubin Ghahramani , None

DOI:

关键词: Computer scienceLocal regressionNonparametric statisticsGaussian random fieldGaussian filterArtificial intelligenceMachine learningProbabilistic logicGaussian processTheoretical computer scienceSmall setGaussian function

摘要: Gaussian process (GP) models are flexible probabilistic nonparametric for regression, classification and other tasks. Unfortunately they suffer from computational intractability large data sets. Over the past decade there have been many different approximations developed to reduce this cost. Most of these can be termed global approximations, in that try summarize all training via a small set support points. A approach is local where experts account their own part space. In paper we start by investigating regimes which approaches work well or fail. We then proceed develop new sparse GP approximation combination both approaches. Theoretically show it derived as natural extension framework Quinonero Candela Rasmussen [2005] approximations. demonstrate benefits combined on some 1D examples illustration, real-world

参考文章(11)
Neil D. Lawrence, Matthias W. Seeger, Christopher K. I. Williams, Fast Forward Selection to Speed Up Sparse Gaussian Process Regression international conference on artificial intelligence and statistics. ,(2003)
Carl Edward Rasmussen, Joaquin Quiñonero-Candela, A Unifying View of Sparse Approximate Gaussian Process Regression Journal of Machine Learning Research. ,vol. 6, pp. 1939- 1959 ,(2005) , 10.5555/1046920.1194909
Christopher K I Williams, Carl Edward Rasmussen, Gaussian Processes for Machine Learning ,(2005)
Teofilo F. Gonzalez, Clustering to minimize the maximum intercluster distance Theoretical Computer Science. ,vol. 38, pp. 293- 306 ,(1985) , 10.1016/0304-3975(85)90224-5
Volker Tresp, A Bayesian Committee Machine Neural Computation. ,vol. 12, pp. 2719- 2741 ,(2000) , 10.1162/089976600300014908
Michael I. Shamos, Franco P. Preparata, Computational Geometry: An Introduction ,(1978)
Carl Rasmussen, Zoubin Ghahramani, None, Infinite Mixtures of Gaussian Process Experts neural information processing systems. ,vol. 14, pp. 881- 888 ,(2001)
Zoubin Ghahramani, Edward Snelson, Sparse Gaussian Processes using Pseudo-inputs neural information processing systems. ,vol. 18, pp. 1257- 1264 ,(2005)
Lehel Csató, Manfred Opper, Sparse on-line Gaussian processes Neural Computation. ,vol. 14, pp. 641- 668 ,(2002) , 10.1162/089976602317250933
Tomás Feder, Daniel Greene, Optimal algorithms for approximate clustering symposium on the theory of computing. pp. 434- 444 ,(1988) , 10.1145/62212.62255