2009 · 1K citations · 9 references
ComputingData ScienceMachine LearningStatistical LearningStatistical ModelingBayesian InferenceGaussian Process ModelingGaussian ProcessesOptimization For Machine LearningVariational FormulationVariational InferenceDivergenceDivergence MinimizationKernel LearningKullback-leibler DivergenceMarginal LikelihoodMarginal Likelihood EstimationMarginal Likelihood MaximizationSparse Gaussian Processes
Sparse Gaussian process methods that use inducing variables require the selection of the inducing inputs and the kernel hyperparameters. We introduce a variational formulation for sparse approximations that jointly infers the inducing inputs and the kernel hyperparameters by maximizing a lower bound of the true log marginal likelihood. The key property of this formulation is that the inducing inputs are defined to be variational parameters which are selected by minimizing the Kullback-Leibler divergence between the variational distribution and the exact posterior distribution over the latent function values. We apply this technique to regression and we compare it with other approaches in the literature. 1
9
Using the Nyström Method to Speed Up Kernel Machines
Christopher K. I. Williams, Matthias Seeger · 2000 · 1.5K citations
Sparse Gaussian Processes using Pseudo-inputs
Edward Snelson, Zoubin Ghahramani · 2005 · 1.3K citations
Sparse On-Line Gaussian Processes
Lehel Csató, Manfred Opper · Neural Computation · 2002 · 763 citations · Full text
Sparse Greedy Matrix Approximation for Machine Learning
Alex Smola, Bernhard Schökopf · 2000 · 601 citations