SOURCE-LINKED INTELLIGENCE

On Basis Function Selection for Sparse Gaussian Process Regression

arXiv · AI, language, vision and robotics · article · Sep 22, 2026 · UTC

Sparse Gaussian processes achieve $O(N)$ inference by replacing the kernel with an appropriate expansion in a fixed basis $\{φ_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 t

Read original source ↗ Open in workspace

recordType

paper

region

Global