Preconditioned Additive Gaussian Processes with Fourier Acceleration
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866917972903198720 |
|---|---|
| author | Wagner, Theresa Xu, Tianshi Nestler, Franziska Xi, Yuanzhe Stoll, Martin |
| author_facet | Wagner, Theresa Xu, Tianshi Nestler, Franziska Xi, Yuanzhe Stoll, Martin |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_00480 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Preconditioned Additive Gaussian Processes with Fourier Acceleration Wagner, Theresa Xu, Tianshi Nestler, Franziska Xi, Yuanzhe Stoll, Martin Machine Learning Numerical Analysis 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. |
| title | Preconditioned Additive Gaussian Processes with Fourier Acceleration |
| topic | Machine Learning Numerical Analysis |
| url | https://arxiv.org/abs/2504.00480 |