Chained Gaussian Processes
Gaussian process models are flexible, Bayesian non-parametric approaches to regression. Properties of multivariate Gaussians mean that they can be combined linearly in the manner of additive models and via a link function (like in generalized linear models) to handle non-Gaussian data. However, the link function formalism is restrictive, link functions are always invertible and must convert a parameter of interest to a linear combination of the underlying processes. There are many likelihoods and models where a non-linear combination is more appropriate. We term these more general models Chained Gaussian Processes: the transformation of the GPs to the likelihood parameters will not generally be invertible, and that implies that linearisation would only be possible with multiple (localized) links, i.e. a chain. We develop an approximate inference procedure for Chained GPs that is scalable and applicable to any factorized likelihood. We demonstrate the approximation on a range of likelihood functions.
Code (1)
Tasks
Additive modelsGaussian ProcessesSimilar Papers 제목 키워드 기반
Integrative Analysis and Imputation of Multiple Data Streams via Deep Gaussian Processes
Healthcare data, particularly in critical care settings, presents three key challenges for analysis. First, physiological measurements come from different sources but are inherently related. Yet, traditional methods ofte…
Gaussian ProcessesImputationMissing ValuesUncertainty QuantificationOn the Mode-Seeking Properties of Langevin Dynamics
The Langevin Dynamics framework, which aims to generate samples from the score function of a probability distribution, is widely used for analyzing and interpreting score-based generative modeling. While the convergence …
State-switching control of the second-order chained form system
This paper addresses a motion planning problem of the second-order chained form system. The author presents a novel control approach based on switching a state. The second-order chained form system is composed of three s…
FormMotion PlanningChained Generalisation Bounds
This work discusses how to derive upper bounds for the expected generalisation error of supervised learning algorithms by means of the chaining technique. By developing a general theoretical framework, we establish a dua…
Learning Neural Event Functions for Ordinary Differential Equations
The existing Neural ODE formulation relies on an explicit knowledge of the termination time. We extend Neural ODEs to implicitly defined termination criteria modeled by neural event functions, which can be chained togeth…
Point Processes