Metraipolis › archive › dc_05b697d609f4

On Basis Function Selection for Sparse Gaussian Process Regression — arXiv:2609.26624

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.26624
License (as archived)
CC0-1.0
Archived
2026-10-08T15:11:36.537Z
SHA-256 of the archived text
9c61def5787ab8b4b2a9499c3d04bc49a20e61460715b424534727dfde0bbc41
Stable URL of this page
https://metraipolis.com/documento/dc_05b697d609f4

How to cite

On Basis Function Selection for Sparse Gaussian Process Regression — arXiv:2609.26624 — arXiv (en), https://arxiv.org/abs/2609.26624 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_05b697d609f4 (Metraipolis archive dc_05b697d609f4, sha256 9c61def5787ab8b4b2a9499c3d04bc49a20e61460715b424534727dfde0bbc41)
BibTeX
@misc{dc05b697d609f4,
  title = {On Basis Function Selection for Sparse Gaussian Process Regression — arXiv:2609.26624},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.26624},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_05b697d609f4; sha256 9c61def5787ab8b4b2a9499c3d04bc49a20e61460715b424534727dfde0bbc41},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.26624. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Sparse Gaussian processes achieve $O(N)$ inference by replacing the kernel with an appropriate expansion in a fixed basis $\{\phi_j\}$ on the input space. Given a compute budget $M \ll N$, practitioners conventionally truncate the basis to its first $M$ entries. Nothing in the formalism, however, prevents one from selecting only those $M$ basis functions that matter for the data at hand. This would avoid spending budget on basis functions where there is no signal, but it requires a criterion for ranking the candidates. We propose three such criteria derived from an information-theoretic view of the basis-function selection problem. Each criterion matches a different state of knowledge at selection time: a no-data state, a no-prior state, and an in-between state. We then study the performance of truncation versus selection strategies on six UCI regression benchmarks across three basis families: Hilbert-space Gaussian processes (HSGP), variational Fourier features (VFF), and variational inducing spherical harmonics (VISH). We observe that the no-data criterion is a safe default, matching or improving on truncation for HSGP, VFF and VISH, with substantial gains for VISH and improvements over a recently developed selection heuristic for that basis family. The data-aware no-prior and in-between criteria provide substantial gains over truncation specifically for HSGP, which is the most broadly used of the three families in practice.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-23 in cs.LG).
Categorie arXiv: Machine Learning (stat.ML) ; Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2609.26624 — 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-08T14:37:29.583Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-09-23?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).