Spectral Mixture Kernel Approximation Using Reparameterized Random Fourier Feature
We propose a method for Spectral Mixture kernel approximation using the Reparameterized Random Fourier Feature (R-RFF) in the sense of both general parameter and natural parameter view. Meanwhile, we provide the effective sampling methods of spectral points which samples the number of spectral points by considering the normalized weight parameters of SM kernel. Also, we develop the regularized sparse spectrum approximation by using Stochastic Gradient Variational Bayes for scalable learning of GP model with SM kernel.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
A spectral mixture representation of isotropic kernels to generalize random Fourier features
Rahimi and Recht (2007) introduced the idea of decomposing positive definite shift-invariant kernels by randomly sampling from their spectral distribution. This famous technique, known as Random Fourier Features (RFF), i…
Gaussian ProcessesReparameterized LLM Training via Orthogonal Equivalence Transformation
While large language models (LLMs) are driving the rapid advancement of artificial intelligence, effectively and reliably training these large models remains one of the field's most significant challenges. To address thi…
Random Fourier Features for Kernel Ridge Regression: Approximation Bounds and Statistical Guarantees
Random Fourier features is one of the most popular techniques for scaling up kernel methods, such as kernel ridge regression. However, despite impressive empirical results, the statistical properties of random Fourier fe…
regressionRandom Wavelet Features for Graph Kernel Machines
Node embeddings map graph vertices into low-dimensional Euclidean spaces while preserving structural information. They are central to tasks such as node classification, link prediction, and signal reconstruction. A key g…
Graph Representation LearningNode ClassificationLink PredictionStein Random Feature Regression
In large-scale regression problems, random Fourier features (RFFs) have significantly enhanced the computational scalability and flexibility of Gaussian processes (GPs) by defining kernels through their spectral density,…
Gaussian Processesregression