Paper recorded by Signals 4 on 2026-09-22 in cs.LG. Abstract reproduced from arXiv; link to the original below.
Published 2026-09-22 on arXiv · recorded by Signals 4 on 2026-09-23
Category: cs.LG · 机器学习 · first seen 2026-09-23
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 a