Gaussian Process Boosting
Fabio Sigrist

TL;DR
This paper presents a new method combining Gaussian process boosting with mixed effects models, enhancing flexibility, prediction accuracy, and scalability for high-dimensional and large datasets.
Contribution
It introduces a novel algorithm that relaxes prior assumptions in Gaussian process and boosting models, and scales efficiently to large data using a Vecchia approximation.
Findings
Improved prediction accuracy on simulated data
Effective handling of high-cardinality categorical variables
Scalable to large datasets with novel covariance inference
Abstract
We introduce a novel way to combine boosting with Gaussian process and mixed effects models. This allows for relaxing, first, the zero or linearity assumption for the prior mean function in Gaussian process and grouped random effects models in a flexible non-parametric way and, second, the independence assumption made in most boosting algorithms. The former is advantageous for prediction accuracy and for avoiding model misspecifications. The latter is important for efficient learning of the fixed effects predictor function and for obtaining probabilistic predictions. Our proposed algorithm is also a novel solution for handling high-cardinality categorical variables in tree-boosting. In addition, we present an extension that scales to large data using a Vecchia approximation for the Gaussian process model relying on novel results for covariance parameter inference. We obtain increased…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGaussian Processes and Bayesian Inference · Advanced Multi-Objective Optimization Algorithms · Machine Learning and Data Classification
MethodsGaussian Process
