Online Gradient Computation for Warping Gaussian Process Transformations
Not on the map. Why?
Abstract (arXiv)
Warped Gaussian processes (GPs) handle non-Gaussian observations by mapping them into a latent standard GP via a parametric transformation called warping. Existing streaming variants, however, either optimize the warping parameters periodically or sacrifice analytical tractability for a higher model capacity. To bridge this gap, we show that the gradient of the instantaneous negative log-likelihood of a warped GP admits an exact recursive computation. Based on this result, we propose a novel online method for warped GPs that jointly updates the latent GP moments and optimizes the warping parameters.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 5 of its 23 references that are in the map. First posted on arXiv 15 Sep 2026.
Builds on
5 of 23 references.
References · 5
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
- 2020A Survey of Constrained Gaussian Process Regression: Approaches and Implementation Challengescited by 52
- 2016Deep Gaussian Processes for Regression using Approximate Expectation Propagationcited by 39
- 2023An Online Multiple Kernel Parallelizable Learning Schemecited by 1
Built on by
Not cited yet.