Gaussian kernel expansion with basis functions uniformly bounded in L∞
Not on the map. Why?
Abstract (arXiv)
Kernel expansions are a topic of considerable interest in machine learning, also because of their relation to the so-called feature maps introduced in machine learning. Properties of the associated basis functions and weights (corresponding to eigenfunctions and eigenvalues in the Mercer setting) give insight into for example the structure of the associated reproducing kernel Hilbert space, the goodness of approximation schemes, the convergence rates and generalization properties of kernel machines. Recent work in the literature has derived some of these results by assuming uniformly bounded basis functions in L_∞. Motivated by this line of research, we investigate under this constraint all possible kernel expansions of the Gaussian kernel, one of the most widely used models in machine learning. Our main result is the construction on ℝ2 of a Gaussian kernel expansion with weights in ℓp for any p>1. This result is optimal since we also prove that p=1 cannot be reached by the Gaussian kernel, nor by any of the other radial basis function kernels commonly used in the literature. A consequence for this kind of kernels is also the non-existence of Mercer expansions on ℝ2, with respect to any finite measure, whose eigenfunctions all belong to a closed ball of L_∞.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 10 of its 36 references that are in the map. First posted on arXiv 2 Oct 2024.
Builds on
10 of 36 references.
References · 10
- 2017Sobolev Norm Learning Rates for Regularized Least-Squares Algorithmcited by 113
- 2018Statistical Optimality of Stochastic Gradient Descent on Hard Learning Problems through Multiple Passescited by 69
- 2016Optimal Rates For Regularization Of Statistical Inverse Learning Problemscited by 68
- 2022Learning Dynamical Systems via Koopman Operator Regression in Reproducing Kernel Hilbert Spacescited by 66
- 2020A Survey on Large-scale Machine Learningcited by 34
- 2020A Theory of the Risk for Optimization with Relaxation and its Application to Support Vector Machinescited by 8
- 2022On the speed of uniform convergence in Mercer's theoremcited by 5
- 2014Multi-agents adaptive estimation and coverage control using Gaussian regressioncited by 4
- 2020Mathematical foundations of stable RKHSscited by 4
- 2023Kernel-based function learning in dynamic and non stationary environmentscited by 1
Built on by
Not cited yet.