Preconditioned Additive Gaussian Processes with Fourier Acceleration
By: Theresa Wagner , Tianshi Xu , Franziska Nestler and more
Potential Business Impact:
Makes computer predictions faster and more accurate.
Gaussian processes (GPs) are crucial in machine learning for quantifying uncertainty in predictions. However, their associated covariance matrices, defined by kernel functions, are typically dense and large-scale, posing significant computational challenges. This paper introduces a matrix-free method that utilizes the Non-equispaced Fast Fourier Transform (NFFT) to achieve nearly linear complexity in the multiplication of kernel matrices and their derivatives with vectors for a predetermined accuracy level. To address high-dimensional problems, we propose an additive kernel approach. Each sub-kernel in this approach captures lower-order feature interactions, allowing for the efficient application of the NFFT method and potentially increasing accuracy across various real-world datasets. Additionally, we implement a preconditioning strategy that accelerates hyperparameter tuning, further improving the efficiency and effectiveness of GPs.
Similar Papers
Accelerating Posterior sampling for Scalable Gaussian Process model
Computation
Makes computer math problems solve much faster.
Streaming Generated Gaussian Process Experts for Online Learning and Control
Machine Learning (CS)
Makes smart computer learning faster and use less memory.
Scalable Gaussian Processes with Latent Kronecker Structure
Machine Learning (CS)
Lets computers learn from huge, messy data.