Fast Approximate Multi-output Gaussian Processes
Vladimir Joukov, Dana Kuli\'c

TL;DR
This paper introduces a fast approximation method for multi-output Gaussian processes that significantly reduces computational complexity by using eigenvalue-based kernel approximation, enabling scalable regression and correlation learning.
Contribution
It proposes an eigenfunction-based approximation for Gaussian processes that reduces training and regression complexity and supports multi-output and derivative estimation.
Findings
Significant reduction in training and regression computational costs.
Ability to learn correlations between multiple outputs.
Demonstrated effectiveness through simulation examples.
Abstract
Gaussian processes regression models are an appealing machine learning method as they learn expressive non-linear models from exemplar data with minimal parameter tuning and estimate both the mean and covariance of unseen points. However, exponential computational complexity growth with the number of training samples has been a long standing challenge. During training, one has to compute and invert an kernel matrix at every iteration. Regression requires computation of an kernel where and are the number of training and test points respectively. In this work we show how approximating the covariance kernel using eigenvalues and functions leads to an approximate Gaussian process with significant reduction in training and regression complexity. Training with the proposed approach requires computing only a eigenfunction matrix and a …
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 · Machine Learning and Data Classification · Neural Networks and Applications
MethodsGaussian Process
