Infoscience (Ecole Polytechnique Fédérale de Lausanne) · 2003 · 392 citations · 8 references
Open access
ComputingComputer ScienceData ScienceMachine LearningOptimizationStatistical LearningBayesian InferenceBayesian StatisticsGaussian Process ModelingGaussian ProcessesModel SelectionOptimization For Machine LearningBayesian RegressionForward SelectionGaussian Process RegressionGreedy ApproximationMarginal LikelihoodMarginal Likelihood EstimationMarginal Likelihood MaximizationSparse Gaussian Processes
We present a method for the sparse greedy approximation of Bayesian Gaussian process regression, featuring a novel heuristic for very fast forward selection motivated by active learning. We show how a large number of hyperparameters can be adjusted automatically by maximizing the marginal likelihood of the training data. Our method is essentially as fast as an equivalent one which selects the "support" patterns at random, yet has the potential to outperform random selection on hard curve fitting tasks and at the very least leads to a more stable behaviour of first-level inference which makes the subsequent gradient-based optimization of hyperparameters much easier. In line with the development of our method, we present a simple view on sparse approximations for GP models and their underlying assumptions and show relations to other methods.
8
Applied Physics Letters · 2000 · 1.9K citations · Full text
H. Sebastian Seung, Manfred Opper, Haim Sompolinsky · 1992 · 1.7K citations · Full text
Using the Nyström Method to Speed Up Kernel Machines
Christopher K. I. Williams, Matthias Seeger · 2000 · 1.5K citations
Sparse On-Line Gaussian Processes
Lehel Csató, Manfred Opper · Neural Computation · 2002 · 763 citations · Full text