Approximation bounds for some sparse kernel regression algorithms.
Gaussian processes have been widely applied to regression problems with good performance. However, they can be computationally expensive. In order to reduce the computational cost, there have been recent studies on using sparse approximations in gaussian processes. In this article, we investigate properties of certain sparse regression algorithms that approximately solve a gaussian process. We obtain approximation bounds and compare our results with related methods.
Zhang
Tong
T
IBM T J Watson Research Center, Yorktown Heights, NY 10598, USA. tzhang@watson.ibm.com