Metraipolis › archive › dc_22caffaec3e4
New hierarchical matrices for fast kernel matrix-vector products with Applications to Gaussian processes and kernel ridge regression — arXiv:2610.40195
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.40195
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-01T02:31:29.833Z
- SHA-256 of the archived text
4c51fa1c29b6aa0f35a98ab60b130a2321a45b81d9d1a723e9fa4c8db8f0d59e- Stable URL of this page
https://metraipolis.com/documento/dc_22caffaec3e4
How to cite
New hierarchical matrices for fast kernel matrix-vector products with Applications to Gaussian processes and kernel ridge regression — arXiv:2610.40195 — arXiv (en), https://arxiv.org/abs/2610.40195 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_22caffaec3e4 (Metraipolis archive dc_22caffaec3e4, sha256 4c51fa1c29b6aa0f35a98ab60b130a2321a45b81d9d1a723e9fa4c8db8f0d59e)
BibTeX
@misc{dc22caffaec3e4,
title = {New hierarchical matrices for fast kernel matrix-vector products with Applications to Gaussian processes and kernel ridge regression — arXiv:2610.40195},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.40195},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_22caffaec3e4; sha256 4c51fa1c29b6aa0f35a98ab60b130a2321a45b81d9d1a723e9fa4c8db8f0d59e},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.40195. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
This article presents two new multilevel hierarchical matrices to perform fast kernel matrix-vector products in $d$ dimensions $(d>1)$, namely $\mathcal{H}_{hw}^{\prime}$, $\mathcal{H}_{hw}^{\prime \prime}$. We introduce a novel hybrid weak admissibility condition to construct these hierarchical matrices. More precisely, at coarser levels of the tree (i.e., larger blocks), we use a weak admissibility condition, wherein \textbf{far-field} and \textbf{vertex-sharing} clusters are considered admissible, while at the finer levels (i.e., smaller blocks), the \textbf{adjacent} clusters are treated as admissible. The admissible blocks at coarser levels of $\mathcal{H}_{hw}^{\prime}$ and $\mathcal{H}_{hw}^{\prime \prime}$ are represented using semi-nested and fully nested bases, respectively. In both hierarchical matrices, the finer levels at which adjacent clusters are treated as admissible are constructed in a non-nested fashion. Thus, they can be viewed as a hybrid of $\mathcal{H}$ and $\mathcal{H}^2$ matrices. We use adaptive cross approximation (ACA) and nested cross approximation (NCA) to construct non-nested and nested bases, respectively. The fast matrix-vector products are performed using the proposed hierarchical matrix formats. To evaluate the performance and usefulness of the proposed hierarchical matrices, we conduct some numerical experiments. The numerical results show that they outperform their uniform admissibility counterparts in terms of storage and matrix-vector product cost, demonstrating the effectiveness of the proposed hybrid formats. We also show that the proposed formats are competitive with the standard (or strong) admissibility-based $\mathcal{H}^2$-matrices. Furthermore, we showcase some interesting applications of the proposed hierarchical matrices.
Tema degli esploratori: statistica e scienza dei dati (elenco arXiv stat.CO, nuovi lavori del giorno).
Categorie arXiv: Numerical Analysis (math.NA) ; Mathematical Software (cs.MS); Computation (stat.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.40195 — 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-01T02:14:13.486Z dalla pagina https://arxiv.org/list/stat.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).