2009 · 80 citations · 9 references
ComputingComputer ScienceMachine LearningSpatial StatisticsSurface MiningGaussian Process ModelingGaussian ProcessesGeospatial Machine LearningGrade EstimationKernel MethodsOptimization For Machine LearningComplexityCovariance Function EstimationCovariance Matrix EstimationKernel LearningMercer KernelsOre Grade EstimationSparse Gaussian ProcessesStationary Covariance Models
Despite the success of Gaussian processes (GPs) in modelling spatial stochastic processes, dealing with large datasets is still challenging. The problem arises by the need to invert a potentially large covariance matrix during inference. In this paper we address the complexity problem by constructing a new stationary covariance function (Mercer kernel) that naturally provides a sparse covariance matrix. The sparseness of the matrix is defined by hyperparameters optimised during learning. The new covariance function enables exact GP inference and performs comparatively to the squared-exponential one, at a lower computational cost. This allows the application of GPs to large-scale problems such as ore grade prediction in mining or 3D surface modelling. Experiments show that using the proposed covariance function, very sparse covariance matrices are normally obtained which can be effectively used for faster inference and less memory usage. 1
9
Noel Cressie · Terra Nova · 1992 · 8.9K citations
Computing, Geography, Geoinformatics +12
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