mlsanityData to 14 Oct 2026

A piece-wise constant approximation for non-conjugate Gaussian Process models

arXiv 2204.10575 ↗First posted 22 Apr 2022cs.LG stat.MLcited by 0

Not on the map. Why?

Abstract (arXiv)

Gaussian Processes (GPs) are a versatile and popular method in Bayesian Machine Learning. A common modification are Sparse Variational Gaussian Processes (SVGPs) which are well suited to deal with large datasets. While GPs allow to elegantly deal with Gaussian-distributed target variables in closed form, their applicability can be extended to non-Gaussian data as well. These extensions are usually impossible to treat in closed form and hence require approximate solutions. This paper proposes to approximate the inverse-link function, which is necessary when working with non-Gaussian likelihoods, by a piece-wise constant function. It will be shown that this yields a closed form solution for the corresponding SVGP lower bound. In addition, it is demonstrated how the piece-wise constant function itself can be optimized, resulting in an inverse-link function that can be learnt from the data at hand.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 5 of its 18 references that are in the map. First posted on arXiv 22 Apr 2022.

Builds on

5 of 18 references.

References · 5

  1. 2013Gaussian Processes for Big Datacited by 383
  2. 2014Scalable Variational Gaussian Process Classificationcited by 228
  3. 2013Expectation Propagation for approximate Bayesian inferencecited by 174
  4. 2017Doubly Stochastic Variational Inference for Deep Gaussian Processescited by 143
  5. 2019A Differentiable Programming System to Bridge Machine Learning and Scientific Computingcited by 83

Built on by

Not cited yet.