A Joint introduction to Gaussian Processes and Relevance Vector Machines with Connections to Kalman filtering and other Kernel Smoothers
Not on the map. Why?
Abstract (arXiv)
The expressive power of Bayesian kernel-based methods has led them to become an important tool across many different facets of artificial intelligence, and useful to a plethora of modern application domains, providing both power and interpretability via uncertainty analysis. This article introduces and discusses two methods which straddle the areas of probabilistic Bayesian schemes and kernel methods for regression: Gaussian Processes and Relevance Vector Machines. Our focus is on developing a common framework with which to view these methods, via intermediate methods a probabilistic version of the well-known kernel ridge regression, and drawing connections among them, via dual formulations, and discussion of their application in the context of major tasks: regression, smoothing, interpolation, and filtering. Overall, we provide understanding of the mathematical concepts behind these models, and we summarize and discuss in depth different interpretations and highlight the relationship to other methods, such as linear kernel smoothers, Kalman filtering and Fourier approximations. Throughout, we provide numerous figures to promote understanding, and we make numerous recommendations to practitioners. Benefits and drawbacks of the different techniques are highlighted. To our knowledge, this is the most in-depth study of its kind to date focused on these two methods, and will be relevant to theoretical understanding and practitioners throughout the domains of data-science, signal processing, machine learning, and artificial intelligence in general.
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). First posted on arXiv 19 Sep 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 1; 2023: 2; 2024: 1; 2025: 1; 2026: 2.
10 papers.
- 2021A survey of Monte Carlo methods for noisy and costly densities with application to reinforcement learning and ABCcited by 8
- 2023Ensemble Kalman Filtering Meets Gaussian Process SSM for Non-Mean-Field and Online Inferencecited by 5
- 2021Edge Tracing using Gaussian Process Regressioncited by 4
- 2022On the safe use of prior densities for Bayesian model selectioncited by 4
- 2021MCMC-driven importance samplerscited by 3
- 2023Spectral information criterion for automatic elbow detectioncited by 2
- 2024Hyperbolic Secant representation of the logistic function: Application to probabilistic Multiple Instance Learning for CT intracranial hemorrhage detectioncited by 1
- 2025Data-driven informative priors for Bayesian inference with quasi-periodic datacited by 0
- 2026A note on the area under the likelihood and the fake evidence for model selectioncited by 0
- 2026An automatic counting algorithm for the quantification and uncertainty analysis of the number of microglial cells trainable in small and heterogeneous datasetscited by 0
- 2026An automatic counting algorithm for the quantification and uncertainty analysis of the number of microglial cells trainable in small and heterogeneous datasets26 Feb 2026
- 2026A note on the area under the likelihood and the fake evidence for model selection26 Feb 2026
- 2025Data-driven informative priors for Bayesian inference with quasi-periodic data27 Nov 2025
- 2024Hyperbolic Secant representation of the logistic function: Application to probabilistic Multiple Instance Learning for CT intracranial hemorrhage detection21 Mar 2024
- 2023Ensemble Kalman Filtering Meets Gaussian Process SSM for Non-Mean-Field and Online Inference10 Dec 2023
- 2023Spectral information criterion for automatic elbow detection17 Aug 2023
- 2022On the safe use of prior densities for Bayesian model selection10 Jun 2022
- 2021Edge Tracing using Gaussian Process Regression5 Nov 2021
- 2021A survey of Monte Carlo methods for noisy and costly densities with application to reinforcement learning and ABC1 Aug 2021
- 2021MCMC-driven importance samplers6 May 2021