Metraipolis › archive › dc_e44eabff72b6
Beyond the Gegenbauer Paradigm: q-Orthogonal Kernels for Machine Learning — arXiv:2608.03482
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.03482
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-31T12:42:26.496Z
- SHA-256 of the archived text
76debe59360bb7381deb12a56102e2a1b548adb8cee9a4b8d1241830268e3b0c- Stable URL of this page
https://metraipolis.com/documento/dc_e44eabff72b6
How to cite
Beyond the Gegenbauer Paradigm: q-Orthogonal Kernels for Machine Learning — arXiv:2608.03482 — arXiv (en), https://arxiv.org/abs/2608.03482 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e44eabff72b6 (Metraipolis archive dc_e44eabff72b6, sha256 76debe59360bb7381deb12a56102e2a1b548adb8cee9a4b8d1241830268e3b0c)
BibTeX
@misc{dce44eabff72b6,
title = {Beyond the Gegenbauer Paradigm: q-Orthogonal Kernels for Machine Learning — arXiv:2608.03482},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.03482},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e44eabff72b6; sha256 76debe59360bb7381deb12a56102e2a1b548adb8cee9a4b8d1241830268e3b0c},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.03482. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The performance of Support Vector Machines (SVMs) critically depends on the kernel function choice, which enables implicit mapping of data into high-dimensional feature spaces. While classical kernels like Radial Basis Function (RBF) remain popular, orthogonal polynomial kernels offer mathematically interpretable alternatives that can incorporate structured prior knowledge. This work extends the orthogonal polynomial kernel paradigm by introducing a novel family based on discrete $q$-Hermite I polynomials, a class of $q$-orthogonal polynomials that generalize classical Hermite polynomials through a deformation parameter $q$. We formally define the q-Hermite kernel and establish its validity under Mercer's theorem. The kernel's inherent boundedness properties naturally prevent annihilation and explosion effects without requiring explicit scaling mechanisms. Extensive experiments across 20 benchmark datasets demonstrate that the proposed kernel achieves competitive performance compared to both classical kernels and other orthogonal polynomial kernels, while offering advantages in numerical stability and computational simplicity. Our results confirm that $q$-orthogonal polynomials constitute a promising direction for kernel design, bridging mathematical elegance with practical machine learning applications, that provides conceptual and algorithmic resources that may be further extended to emerging quantum computing paradigms. To facilitate full reproducibility, we provide the complete implementation and experimental pipeline in an open-access GitHub repository at this https URL . Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-05 in cs.LG). Categorie arXiv: Machine Learning (cs.LG) ; Machine Learning (stat.ML). Pagina del lavoro: https://arxiv.org/abs/2608.03482 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-31T12:31:30.357Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-08-05?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).