资源分类
》 资源 》论文》Efficient Optimization for Sparse Gaussian Process Regression

Efficient Optimization for Sparse Gaussian Process Regression

2020-01-16 | |  65 |   35 |   0

Abstract

We propose an efficient optimization algorithm for selecting a subset of training data to induce sparsity for Gaussian process regression. The algorithm estimates an inducing set and the hyperparameters using a single objective, either the marginal likelihood or a variational free energy. The space and time complexity are linear in training set size, and the algorithm can be applied to large regression problems on discrete or continuous domains. Empirical evaluation shows state-ofart performance in discrete cases and competitive results in the continuous case.

上一篇：Blind Calibration in Compressed Sensing using Message Passing Algorithms

下一篇：Local Privacy and Minimax Bounds: Sharp Rates for Probability Estimation

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...