mlsanityData to 7 Oct 2026

Random Gegenbauer Features for Scalable Kernel Methods

arXiv 2202.03474 ↗First posted 7 Feb 2022cs.LGcited by 6

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

  1. 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
  2. 2019Wide Neural Networks of Any Depth Evolve as Linear Models Under Gradient Descentcited by 732
  3. 2015An Introduction to Matrix Concentration Inequalitiescited by 391
  4. 2014Fastfood: Approximate Kernel Expansions in Loglinear Timecited by 72
  5. 2018Random Fourier Features for Kernel Ridge Regression: Approximation Bounds and Statistical Guaranteescited by 71
  6. 2015Input Sparsity Time Low-Rank Approximation via Ridge Leverage Score Samplingcited by 46
  7. 2016Faster Kernel Ridge Regression Using Sketching and Preconditioningcited by 43
  8. 2021Fast Sketching of Polynomial Kernels of Polynomial Degreecited by 33
  9. 2021Scaling Neural Tangent Kernels via Sketching and Random Featurescited by 32
  10. 2014Fast Randomized Kernel Methods With Statistical Guaranteescited by 21
  11. 2016Fast DPP Sampling for Nystr"om with Application to Kernel Methodscited by 15
  12. 2018A Universal Sampling Method for Reconstructing Signals with Simple Fourier Transformscited by 13
3 more
  1. 2020Near Input Sparsity Time Kernel Embeddings via Adaptive Samplingcited by 12
  2. 2020Scaling up Kernel Ridge Regression via Locality Sensitive Hashingcited by 8
  3. 2015Feature Selection for Ridge Regression with Provable Guaranteescited by 5

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 2; 2023: 2; 2024: 1; 2025: 0; 2026: 1.

6 papers.