Conference paper
Effective Dimension and Generalization of Kernel Learning
Tong Zhang
NeurIPS 2002
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.
Tong Zhang
NeurIPS 2002
Hongyan Jing, Radu Florian, et al.
EMNLP 2003
Tong Zhang, David Johnson
CoNLL 2003
Rie Johnson, Tong Zhang
JMLR