Kernel Multigrid: Accelerate Back-fitting via Sparse Gaussian Process Regression
Not on the map. Why?
Abstract (arXiv)
Additive Gaussian Processes (GPs) are popular approaches for nonparametric feature selection. The common training method for these models is Bayesian Back-fitting. However, the convergence rate of Back-fitting in training additive GPs is still an open problem. By utilizing a technique called Kernel Packets (KP), we prove that the convergence rate of Back-fitting is no faster than (1-O(frac1n))t, where n and t denote the data size and the iteration number, respectively. Consequently, Back-fitting requires a minimum of O(nlog n) iterations to achieve convergence. Based on KPs, we further propose an algorithm called Kernel Multigrid (KMG). This algorithm enhances Back-fitting by incorporating a sparse Gaussian Process Regression (GPR) to process the residuals after each Back-fitting iteration. It is applicable to additive GPs with both structured and scattered data. Theoretically, we prove that KMG reduces the required iterations to O(log n) while preserving the time and space complexities at O(nlog n) and O(n) per iteration, respectively. Numerically, by employing a sparse GPR with merely 10 inducing points, KMG can produce accurate approximations of high-dimensional targets within 5 iterations.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 29 of its 86 references that are in the map. First posted on arXiv 20 Mar 2024.
Builds on
29 of 86 references.
References · 29
- 2018GPyTorch: Blackbox Matrix-Matrix Gaussian Process Inference with GPU Accelerationcited by 603
- 2015Kernel Interpolation for Scalable Structured Gaussian Processes (KISS-GP)cited by 175
- 2019Exact Gaussian Processes on a Million Data Pointscited by 118
- 2016Variational Fourier features for Gaussian processescited by 85
- 2020Sparse Gaussian Processes with Spherical Harmonic Featurescited by 43
- 2016Preconditioning Kernel Matricescited by 32
- 2018Product Kernel Interpolation for Scalable Gaussian Processescited by 31
- 2022Posterior and Computational Uncertainty in Gaussian Processescited by 23
- 2021Preconditioning for Scalable Gaussian Process Hyperparameter Optimizationcited by 22
- 2019Randomly Projected Additive Gaussian Processes for Regressioncited by 19
- 2022Additive Gaussian Processes Revisitedcited by 19
- 2017Variable selection for Gaussian processes via sensitivity analysis of the posterior predictive distributioncited by 15
17 more
- 2021Bias-Free Scalable Gaussian Processes via Randomized Truncationscited by 15
- 2021When are Iterative Gaussian Processes Reliably Accurate?cited by 12
- 2020Linear-time inference for Gaussian Processes on one dimensioncited by 11
- 2023Large-Scale Gaussian Processes via Alternating Projectioncited by 11
- 2022Kernel Packet: An Exact and Scalable Algorithm for Gaussian Process Regression with Mat'ern Correlationscited by 10
- 2020Variational Orthogonal Featurescited by 9
- 2018A Bayesian Conjugate Gradient Methodcited by 7
- 2017Additive Models with Trend Filteringcited by 6
- 2020Backfitting for large scale crossed random effects regressionscited by 6
- 2020Sample and Computationally Efficient Stochastic Kriging in High Dimensionscited by 6
- 2020Projection Pursuit Gaussian Process Regressioncited by 5
- 2021Scalable logistic regression with crossed random effectscited by 4
- 2022High-dimensional additive Gaussian processes under monotonicity constraintscited by 4
- 2019Conjugate Gradients for Kernel Machinescited by 2
- 2023Sparse Gaussian Processes with Spherical Harmonic Features Revisitedcited by 2
- 2023Scalable solution to crossed random effects model with random slopescited by 2
- 2018Fast Automatic Smoothing for Generalized Additive Modelscited by 1
Built on by
Not cited yet.