Fast Gaussian Process Regression using KD-Trees

نویسندگان

  • Yirong Shen
  • Andrew Y. Ng
  • Matthias W. Seeger
چکیده

The computation required for Gaussian process regression with n training examples is about O(n) during training and O(n) for each prediction. This makes Gaussian process regression too slow for large datasets. In this paper, we present a fast approximation method, based on kd-trees, that significantly reduces both the prediction and the training times of Gaussian process regression.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robust Estimation in Gaussian Mixtures Using Multiresolution Kd-trees

For many applied problems in the context of clustering via mixture models, the estimates of the component means and covariance matrices can be affected by observations that are atypical of the components in the mixture model being fitted. In this paper, we consider for Gaussian mixtures a robust estimation procedure using multiresolution kd-trees. The method provides a fast EM-based approach to...

متن کامل

Gaussian Processes and Fast Matrix-Vector Multiplies

Gaussian processes (GPs) provide a flexible framework for probabilistic regression. The necessary computations involve standard matrix operations. There have been several attempts to accelerate these operations based on fast kernel matrix-vector multiplications. By focussing on the simplest GP computation, corresponding to test-time predictions in kernel ridge regression, we conclude that simpl...

متن کامل

Fast Gaussian Process Posteriors with Product Trees

Gaussian processes (GP) are a powerful tool for nonparametric regression; unfortunately, calculating the posterior variance in a standard GP model requires time O(n) in the size of the training set. Previous work by Shen et al. (2006) used a k-d tree structure to approximate the posterior mean in certain GP models. We extend this approach to achieve efficient approximation of the posterior cova...

متن کامل

Very Fast EM-Based Mixture Model Clustering Using Multiresolution Kd-Trees

Clustering is important in many elds including manufacturing, biology, nance, and astronomy. Mixture models are a popular approach due to their statistical foundations, and EM is a very popular method for nding mixture models. EM, however, requires many accesses of the data, and thus has been dismissed as impractical (e.g. (Zhang, Ramakrishnan, & Livny, 1996)) for data mining of enormous datase...

متن کامل

Gaussian process regression as a predictive model for Quality-of-Service in Web service systems

In this paper, we present the Gaussian process regression as the predictive model for Quality-of-Service (QoS) attributes in Web service systems. The goal is to predict performance of the execution system expressed as QoS attributes given existing execution system, service repository, and inputs, e.g., streams of requests. In order to evaluate the performance of Gaussian process regression the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005