Exact Inference for Gaussian Process Regression in case of Big Data with the Cartesian Product Structure
Not on the map. Why?
Abstract (arXiv)
Approximation algorithms are widely used in many engineering problems. To obtain a data set for approximation a factorial design of experiments is often used. In such case the size of the data set can be very large. Therefore, one of the most popular algorithms for approximation - Gaussian Process regression - can be hardly applied due to its computational complexity. In this paper a new approach for Gaussian Process regression in case of factorial design of experiments is proposed. It allows to efficiently compute exact inference and handle large multidimensional data sets. The proposed algorithm provides fast and accurate approximation and also handles anisotropic data.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). First posted on arXiv 26 Mar 2014.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 1.
3 papers.
- 2022Fast Bayesian Optimization of Needle-in-a-Haystack Problems using Zooming Memory-Based Initialization (ZoMBI)cited by 14
- 2021Uncertainty-Aware Semi-Supervised Method Using Large Unlabeled and Limited Labeled COVID-19 Datacited by 13
- 2021HyperJump: Accelerating HyperBand via Risk Modellingcited by 4
- 2022Fast Bayesian Optimization of Needle-in-a-Haystack Problems using Zooming Memory-Based Initialization (ZoMBI)26 Aug 2022
- 2021HyperJump: Accelerating HyperBand via Risk Modelling5 Aug 2021
- 2021Uncertainty-Aware Semi-Supervised Method Using Large Unlabeled and Limited Labeled COVID-19 Data12 Feb 2021