Constructing Gaussian Processes via Samplets
Gaussian Processes face two primary challenges: constructing models for large datasets and selecting the optimal model. This master's thesis tackles these challenges in the low-dimensional case. We examine recent convergence results to identify models with optimal convergence rates and pinpoint essential parameters. Utilizing this model, we propose a Samplet-based approach to efficiently construct and train the Gaussian Processes, reducing the cubic computational complexity to a log-linear scale. This method facilitates optimal regression while maintaining efficient performance.
Code (0)
등록된 구현이 없습니다.
Tasks
Gaussian ProcessesregressionSimilar Papers 제목 키워드 기반
Samplets: A new paradigm for data compression
In this article, we introduce the concept of samplets by transferring the construction of Tausch-White wavelets to the realm of data. This way we obtain a multilevel representation of discrete data which directly enables…
Data CompressionConstruction of generalized samplets in Banach spaces
Recently, samplets have been introduced as localized discrete signed measures which are tailored to an underlying data set. Samplets exhibit vanishing moments, i.e., their measure integrals vanish for all polynomials up …
Data CompressionVector-valued Gaussian Processes on Riemannian Manifolds via Gauge Independent Projected Kernels
Gaussian processes are machine learning models capable of learning unknown functions in a way that represents uncertainty, thereby facilitating construction of optimal decision-making systems. Motivated by a desire to de…
BIG-bench Machine LearningDecision MakingGaussian ProcessesVariational InferenceExtrinsic Bayesian Optimizations on Manifolds
We propose an extrinsic Bayesian optimization (eBO) framework for general optimization problems on manifolds. Bayesian optimization algorithms build a surrogate of the objective function by employing Gaussian processes a…
Bayesian OptimizationGaussian ProcessesvalidSamplet basis pursuit: Multiresolution scattered data approximation with sparsity constraints
We consider scattered data approximation in samplet coordinates with $\ell_1$-regularization. The application of an $\ell_1$-regularization term enforces sparsity of the coefficients with respect to the samplet basis. Sa…
Data CompressionSurface Reconstruction