Random Gegenbauer Features for Scalable Kernel Methods
Not on the map. Why?
Abstract (arXiv)
We propose efficient random features for approximating a new and rich class of kernel functions that we refer to as Generalized Zonal Kernels (GZK). Our proposed GZK family, generalizes the zonal kernels (i.e., dot-product kernels on the unit sphere) by introducing radial factors in their Gegenbauer series expansion, and includes a wide range of ubiquitous kernel functions such as the entirety of dot-product kernels as well as the Gaussian and the recently introduced Neural Tangent kernels. Interestingly, by exploiting the reproducing property of the Gegenbauer polynomials, we can construct efficient random features for the GZK family based on randomly oriented Gegenbauer kernels. We prove subspace embedding guarantees for our Gegenbauer features which ensures that our features can be used for approximately solving learning problems such as kernel k-means clustering, kernel ridge regression, etc. Empirical results show that our proposed features outperform recent kernel approximation methods.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 15 of its 45 references that are in the map. First posted on arXiv 7 Feb 2022.
Builds on
15 of 45 references.
References · 15
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
- 2019Wide Neural Networks of Any Depth Evolve as Linear Models Under Gradient Descentcited by 732
- 2015An Introduction to Matrix Concentration Inequalitiescited by 391
- 2014Fastfood: Approximate Kernel Expansions in Loglinear Timecited by 72
- 2018Random Fourier Features for Kernel Ridge Regression: Approximation Bounds and Statistical Guaranteescited by 71
- 2015Input Sparsity Time Low-Rank Approximation via Ridge Leverage Score Samplingcited by 46
- 2016Faster Kernel Ridge Regression Using Sketching and Preconditioningcited by 43
- 2021Fast Sketching of Polynomial Kernels of Polynomial Degreecited by 33
- 2021Scaling Neural Tangent Kernels via Sketching and Random Featurescited by 32
- 2014Fast Randomized Kernel Methods With Statistical Guaranteescited by 21
- 2016Fast DPP Sampling for Nystr"om with Application to Kernel Methodscited by 15
- 2018A Universal Sampling Method for Reconstructing Signals with Simple Fourier Transformscited by 13
3 more
Built on by
Citing papers per year: 2022: 2; 2023: 2; 2024: 1; 2025: 0; 2026: 1.
6 papers.
- 2023Scalable Neural Network Kernelscited by 8
- 2024Spectraformer: A Unified Random Feature Framework for Transformercited by 3
- 2023Orthogonal Random Features: Explicit Forms and Sharp Inequalitiescited by 1
- 2022Near Optimal Reconstruction of Spherical Harmonic Expansionscited by 0
- 2022RFFNet: Large-Scale Interpretable Kernel Methods via Random Fourier Featurescited by 0
- 2026Bernstein-Schur Kernels: Random Features by Sketched Modulation and Radial Randomizationcited by 0
- 2026Bernstein-Schur Kernels: Random Features by Sketched Modulation and Radial Randomization8 Jun 2026
- 2024Spectraformer: A Unified Random Feature Framework for Transformer24 May 2024
- 2023Scalable Neural Network Kernels20 Oct 2023
- 2023Orthogonal Random Features: Explicit Forms and Sharp Inequalities11 Oct 2023
- 2022RFFNet: Large-Scale Interpretable Kernel Methods via Random Fourier Features11 Nov 2022
- 2022Near Optimal Reconstruction of Spherical Harmonic Expansions25 Feb 2022