Sparse Gaussian Neural Processes
Tommy Rochussen, Vincent Fortuin
TL;DR
Sparse Gaussian Neural Processes (SGNP) address the interpretability and scalability gap in probabilistic meta-learning by meta-learning sparse Gaussian process inference. The framework uses neural-set-function encoders to amortise GP variational parameters across tasks, yielding posteriors that are interpretable through inducing points and GP priors. A collapsed variant (SGNP) recovers closed-form inducing-point posteriors for Gaussian likelihoods, while classification can use a regression-relabelling approach (s-ConvSGNP). Across synthetic and real data, SGNPs outperform standard neural processes, especially when the number of observed tasks is small or when prior GP knowledge is available, demonstrating strong data efficiency and task-specific priors with practical inference speed.
Abstract
Despite significant recent advances in probabilistic meta-learning, it is common for practitioners to avoid using deep learning models due to a comparative lack of interpretability. Instead, many practitioners simply use non-meta-models such as Gaussian processes with interpretable priors, and conduct the tedious procedure of training their model from scratch for each task they encounter. While this is justifiable for tasks with a limited number of data points, the cubic computational cost of exact Gaussian process inference renders this prohibitive when each task has many observations. To remedy this, we introduce a family of models that meta-learn sparse Gaussian process inference. Not only does this enable rapid prediction on new tasks with sparse Gaussian processes, but since our models have clear interpretations as members of the neural process family, it also allows manual elicitation of priors in a neural process for the first time. In meta-learning regimes for which the number of observed tasks is small or for which expert domain knowledge is available, this offers a crucial advantage.
