Polynomial Kernel Expansions

• Polynomial kernel expansions are techniques that represent kernel functions using polynomial bases for clear analytical and computational advantages.
• They unify approximation theory, spectral analysis, and RKHS, facilitating scalable algorithms in machine learning, signal processing, and numerical analysis.
• Applications range from explicit feature mapping in kernel methods to efficient spectral decompositions for solving PDEs and advanced computational physics problems.

Polynomial kernel expansions constitute a central tool in applied mathematics, machine learning, signal processing, and computational physics, providing a framework for representing kernels or integral operators in terms of polynomial bases. These expansions connect approximation theory, spectral analysis, RKHS theory, statistical learning, and efficient numerical algorithms, facilitating both theoretical analysis and practical computation. The variants and applications span classical orthogonal polynomial systems, modern machine learning kernels, and specialized constructions for high-dimensional or structured data.

1. Foundations of Polynomial Kernel Expansions

A polynomial kernel expansion expresses a kernel function $k(x, y)$ as a (possibly infinite) sum of products of polynomial basis functions: $k(x, y) = \sum_{n=0}^\infty c_n \, p_n(x) p_n(y)$ where $\{p_n\}$ is an orthogonal polynomial basis relative to a measure $\mu$. For multivariate and high-dimensional settings, the expansion generalizes over a multi-index $\alpha$, as in the multinomial basis: $$K(x, y) = (\langle x, y\rangle + c)^m = \sum_{|\alpha| \le m} \phi_\alpha(x) \phi_\alpha(y)$$ where $\phi_\alpha(x)$ are appropriately scaled monomials, providing a finite exact feature map for the polynomial kernel (Belianovich et al., 16 Jul 2025, Song et al., 2021).

Polynomial kernels have positive-definite structure for suitable choices of parameters and encapsulate all polynomials up to a given degree in their native RKHS. In the case of dot-product kernels $k(x,y) = \varphi(\langle x, y \rangle)$, the celebrated Schoenberg theorem asserts any continuous isotropic positive-definite kernel can be represented as a nonnegative polynomial mixture in dot products or ultraspherical (Gegenbauer) polynomials (Tonde et al., 2016).

2. Orthogonal Polynomial Expansions and Connection Formulas

Classical polynomial bases—Jacobi, Gegenbauer, Chebyshev, Hermite, and their $q$-deformed analogues—admit structured expansion formulas for kernels arising in PDE, potential theory, and random matrix ensembles. For example, fundamental solutions of the polyharmonic equation in $\mathbb R^d$ are expanded as

$k(x, y) = \sum_{n=0}^\infty c_n \, p_n(x) p_n(y)$0

where $k(x, y) = \sum_{n=0}^\infty c_n \, p_n(x) p_n(y)$1 are the Gegenbauer polynomials and $k(x, y) = \sum_{n=0}^\infty c_n \, p_n(x) p_n(y)$2 the expansion coefficients (Cohl, 2012).

The Askey–Wilson framework further unifies and extends these expansions to basic hypergeometric, rational, and $k(x, y) = \sum_{n=0}^\infty c_n \, p_n(x) p_n(y)$3-deformed systems, providing Poisson kernels and explicit connection coefficients between polynomial families via balanced $k(x, y) = \sum_{n=0}^\infty c_n \, p_n(x) p_n(y)$4 or very-well-poised $k(x, y) = \sum_{n=0}^\infty c_n \, p_n(x) p_n(y)$5 series (Cohl et al., 17 Feb 2026, Szabłowski, 2010).

Connection formulas enable the expansion of one family of orthogonal polynomials in terms of another, creating dense interrelations across the Askey and $k(x, y) = \sum_{n=0}^\infty c_n \, p_n(x) p_n(y)$6-Askey schemes and allowing the transformation of polynomial expansions across analytic, combinatorial, or probabilistic domains.

3. Christoffel–Darboux Kernels and Reproducing Kernel Hilbert Spaces

The Christoffel–Darboux (CD) kernel

$k(x, y) = \sum_{n=0}^\infty c_n \, p_n(x) p_n(y)$7

is the reproducing kernel for the finite-dimensional subspace of polynomials of degree at most $k(x, y) = \sum_{n=0}^\infty c_n \, p_n(x) p_n(y)$8, orthogonal with respect to $k(x, y) = \sum_{n=0}^\infty c_n \, p_n(x) p_n(y)$9. In infinite-dimensional settings, under mild compactness and moment conditions, these kernels converge to the reproducing kernel of the closure of polynomials in $\{p_n\}$0 (Henrion, 2024).

CD kernels admit telescoping algorithms for fast computation, underpin quadrature schemes, and, via Mercer’s theorem, connect the polynomial basis to the spectrum of the associated integral operator. This framework guarantees strong approximation properties and carries over spectral theory, learning-theoretic generalization bounds, and interpolation results (Henrion, 2024, Santilli et al., 2021).

Schur polynomial expansions of CD kernels bridge kernel methods with symmetric function theory, yielding closed-form expressions for multi-point kernels and exposing links to random matrix models, Painlevé tau functions, and conformal blocks (Santilli et al., 2021).

4. Polynomial Kernel Expansions in Machine Learning

In kernel methods and structured learning, polynomial kernel expansions are foundational for constructing explicit feature maps, kernel approximations, and learning richer kernel combinations. The inhomogeneous polynomial kernel,

$\{p_n\}$1

is explicated via the multinomial expansion and exact feature maps of dimension $\{p_n\}$2, and forms the basis for kernel ridge regression, SVMs, and Gaussian process models (Belianovich et al., 16 Jul 2025, Song et al., 2021, Le et al., 2014).

Taylor polynomial expansions provide efficient approximations for analytically defined kernels, such as the Gaussian kernel: $\{p_n\}$3 where truncation error is controlled explicitly, and explicit "Taylor features" can be efficiently computed in sparse regimes, outperforming random Fourier features in certain large-scale contexts (Cotter et al., 2011).

Oblivious sketching (e.g., TensorSketch, Fastfood, subspace embeddings) allows polynomial kernels of high or polynomial degree to be efficiently approximated via structured random projections, providing unbiased, low-variance estimators that scale sublinearly in the ambient dimension (Song et al., 2021, Le et al., 2014).

Learning polynomial kernel combinations over sets of base kernels (Multiple Kernel Learning, MKL) can be framed as structured optimization in the kernel space, though higher-degree combinations increase Rademacher complexity and present challenges in optimization and generalization (Li et al., 2017). For structured prediction, non-negative polynomial expansions (Schoenberg/Gegenbauer transforms) are algorithmically optimized to maximize Hilbert–Schmidt dependence between input and output embeddings, with efficient SVD-based algorithms and significant empirical accuracy gains in tasks such as pose reconstruction and multi-camera regression (Tonde et al., 2016).

5. Polynomial Kernel Expansions in Numerical Analysis and Physics

Polynomial expansions of kernels underpin analytic and numerical algorithms for PDEs, potential theory, and interpolation. Against the backdrop of spectral and multipole methods, Jacobi/Gegenbauer/Chebyshev expansions yield rapidly convergent series that separate variables in rotational and polyspherical coordinates, enabling fast boundary integral evaluation and fast multipole algorithms (Cohl, 2012, Ding et al., 2019).

Unified kernel-polynomial interpolation schemes combine compactly supported kernels with polynomial bases via saddle-point systems, ensuring stability, positive definiteness, and convergence. Numerical linear algebra for these systems leverages block elimination, QR/Cholesky factorizations, and Schur complements, guaranteeing robust and efficient computation even on manifolds or with non-Euclidean data (Belianovich et al., 16 Jul 2025).

In real-time rendering (e.g. 3D Gaussian Splatting), polynomial kernel expansions serve as drop-in replacements for Gaussian kernels, enabling aggressive culling, reductions in computational cost via low-order fits, and hardware-friendly implementations, all with negligible loss in visual quality. In such applications, the adoption of polynomial–ReLU kernels yields 4–15% speedups and streamlined culling radii, with compatibility preserved for prior datasets (Mueller et al., 19 Mar 2026).

6. Limitations, Error Bounds, and Practical Implementation

Polynomial expansions entail truncation or approximation, with error bounds available via Taylor and spectral expansion theory for analytic kernels, and explicit geometric convergence for layer potential expansions. For Gaussian kernels, the Taylor remainder is bounded by

$\{p_n\}$4

ensuring uniform control over polydiscs (Cotter et al., 2011).

Variance and concentration inequalities for randomized sketches (Fastfood, TensorSketch) establish unbiasedness and O(1/√n) error rates for the Monte Carlo estimator of the kernel, while choices of degree, feature number, and normalization are critical for numerical stability and statistical efficiency (Le et al., 2014, Song et al., 2021).

Efficient algorithms exploit monomial sampling, sublinear-time subspace embeddings, and direct recurrence for orthogonal polynomial bases, while constraints such as memory and numerical stability necessitate careful design in high-dimensional and large-scale environments (Song et al., 2021, Belianovich et al., 16 Jul 2025).

7. Current Directions and Extensions

Active research in polynomial kernel expansions addresses hardware-specific acceleration (e.g., tensor cores, NPUs), broader distributional forms (e.g., Beta, Student-t), generalized kernel interpolation (unifying polynomial and compactly supported kernels), and deeper integration with random matrix theory and integrable systems via symmetric function expansions (Mueller et al., 19 Mar 2026, Santilli et al., 2021, Belianovich et al., 16 Jul 2025).

Discussions in the context of the Poisson–Mehler kernel and its $\{p_n\}$5-analogues connect polynomial expansions to spectral decompositions of stochastic processes, non-commutative probability, and the explicit construction of densities and transforms among orthogonal polynomial families (Szabłowski, 2010, Cohl et al., 17 Feb 2026).

In summary, polynomial kernel expansions provide a mathematically rigorous, computationally versatile, and empirically validated framework spanning theory and applications in modern data science, signal processing, numerical analysis, and mathematical physics.