Metraipolis › archive › dc_af7dff292dd4
Reproducing Kernel (Quasi-)Banach Spaces with the $\ell^p$ Coefficient Norms — arXiv:2611.08032
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.08032
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-06T14:50:49.915Z
- SHA-256 of the archived text
e5a098f4329e89d2780041c6b19ca3f488cde6e4bb9182cfebe047bd68be3151- Stable URL of this page
https://metraipolis.com/documento/dc_af7dff292dd4
How to cite
Reproducing Kernel (Quasi-)Banach Spaces with the $\ell^p$ Coefficient Norms — arXiv:2611.08032 — arXiv (en), https://arxiv.org/abs/2611.08032 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_af7dff292dd4 (Metraipolis archive dc_af7dff292dd4, sha256 e5a098f4329e89d2780041c6b19ca3f488cde6e4bb9182cfebe047bd68be3151)
BibTeX
@misc{dcaf7dff292dd4,
title = {Reproducing Kernel (Quasi-)Banach Spaces with the $ell^p$ Coefficient Norms — arXiv:2611.08032},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.08032},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_af7dff292dd4; sha256 e5a098f4329e89d2780041c6b19ca3f488cde6e4bb9182cfebe047bd68be3151},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.08032. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
This paper advances the theory of reproducing kernel Banach spaces (RKBSs) by investigating the general $\ell^p$ regularization framework, with a particular focus on the non-convex regime $0<p<1$. While our preceding work established the foundation for RKBSs with the $\ell^1$ norm, the pursuit of stronger sparsity---closer to the $\ell^0$ pseudo-norm---naturally motivates this exploration into $\ell^p$ quasi-norms. For $0<p<1$, we construct reproducing kernel quasi-Banach spaces (RKQBSs) with $\ell^p$ quasi-norms and establish existence and sparsity results for interpolation and regularized learning under appropriate assumptions. We characterize the linear and relaxed representer theorems in terms of a generalized Lebesgue constant and derive bounds under kernel decay, sample spacing, and stability assumptions. For $p>1$, we construct RKBSs using a fixed countable dictionary, establish minimizer existence, and identify the optimal relaxed representer factor through an off-sample coefficient operator. These results reveal fundamental differences between the regimes $0<p<1$, $p=1$, and $p>1$. Numerical experiments compare the accuracy and sparsity of solutions for these three cases. Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno). Categorie arXiv: Machine Learning (cs.LG). Pagina del lavoro: https://arxiv.org/abs/2611.08032 — 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-11-06T14:21:42.640Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).