Paper approximates Gaussian process regression using variational methods.
problem Approximating Gaussian process regression efficiently.
method Represented as a stochastic differential equation, variational inference used for approximation.
result Approximations are as good as full Gaussian process regression.
A new method for efficient Gaussian process inference using sparse approximations.
problem Scalable and accurate inference for latent Gaussian processes.
method Variational approximation with sparse inverse Cholesky factors and double Kullback-Leibler minimization.
result The proposed method can achieve highly accurate approximations with polylogarithmic time complexity.
SFSVI uses Gaussian mixtures to approximate neural network outputs for continual learning.
problem Learning new tasks without forgetting old ones in neural networks.
method Sequential function-space variational inference with Gaussian mixture approximation.
result Gaussian mixture SFSVI outperforms other methods in continual learning.
Sparse precision matrices in Gaussian variational approximations for high-dimensional models.
problem Learning posterior distributions with high-dimensional parameters and conditional independence structures.
method Sparse precision matrix parameterization and efficient stochastic gradient optimization methods.
result Flexibility and parsimony in Gaussian variational distributions achieved through sparsity in precision matrices.
New variational family approximates non-Gaussian posteriors efficiently.
problem Approximating non-Gaussian posteriors in Bayesian models.
method Copula-like variational distributions with efficient sampling and normalizing flows.
result The proposed method performs comparably to state-of-the-art approximations.
New interpretation of sparse Gaussian process approximations for scalability.
problem Scalability issues in Gaussian process models.
method Decomposes Gaussian process into two independent components: inducing points and remaining variation, leading to tighter bounds and new algorithms.
result Demonstrates efficiency in various Gaussian process models, including deep convolutional ones, achieving state-of-the-art results.
Unified view of GP approximations improves efficiency.
problem Disparate variational features limit GP efficiency.
method View GP as a Banach space to unify feature selection.
result Unified understanding of existing and new features.
Method for initializing Gaussian mixtures for variational inference with multi-modal distributions.
problem Challenges in variational inference with Gaussian mixtures due to multimodality and nonconvex loss functions.
method Optimization to find local maxima, local Gaussian approximations, and constrained least squares regression.
result Robust initialization improves variational inference performance and scalability.
Efficient Bayesian inference via Gaussian approximations.
problem Parameter estimation and model selection in Bayesian statistics.
method Variational-Laplace approach using Gaussian approximations.
result Novel theoretical results on asymptotic convergence of VL schemes.
This thesis disentangles Gauss-Newton and variational approximations in Bayesian deep learning.
problem Understanding the interplay between the Gauss-Newton method and variational approximations in Bayesian deep learning.
method Analysis of the Gauss-Newton method and Laplace/Gaussian variational approximations for neural networks.
result The combination of the Gauss-Newton method with approximate inference can be cast as inference in a linear or Gaussian process model.
Paper formulates particle flow using variational inference and Fisher-Rao gradient flow.
problem Estimating posterior densities in probabilistic models.
method Variational formulation of particle flow, Fisher-Rao gradient flow, Gaussian and Gaussian mixture approximations.
result Gaussian and Gaussian mixture approximations of Fisher-Rao particle flow reduce to Exact Daum and Huang particle flow under linear Gaussian assumptions.
VIND reduces gradient variance for non-Gaussian approximations.
problem Improving Variational Inference for non-Gaussian distributions.
method Extends reparameterization trick to exponential families using numerical derivatives and tight coupling.
result Reduces gradient variance, leading to better posterior approximations.
EVI improves variational inference for non-Gaussian models.
problem Infeasibility of finding analytically tractable solutions for non-Gaussian statistical models.
method Extended Variational Inference (EVI) using lower-bound approximation to the variational objective function.
result Convergence of EVI depends on lower-bound approximation strategy.
Proposes variational Gaussian approximations for solving the Kushner equation.
problem Solving the Kushner equation for state estimation with observations.
method Tractable variational Gaussian approximations of proximal losses based on Wasserstein and Fisher metrics.
result The proposed method leads to a Gaussian flow consistent with Kalman-Bucy and Riccati flows.
Proposes efficient Gaussian approximations for non-Gaussian likelihoods.
problem Computational challenges in learning and inference with non-Gaussian likelihoods.
method Variational inference and moment matching in transformed bases.
result Good approximation quality for binary and multiclass classification.
The paper improves Gaussian process regression by optimizing hyperparameters.
problem Hyperparameter tuning for Gaussian process regression models.
method Adaptive sparse variational approximations using variational Bayes.
result Minimax optimal rates of convergence for variational posterior.
Paper proposes Walsh-Hadamard Variational Inference for efficient approximate inference in large models.
problem Over-regularization in variational inference for large models.
method Walsh-Hadamard factorization strategies to reduce parameterization, accelerate computations, and increase posterior expressiveness.
result Efficient approximate inference achieved in over-parameterized models.
A new framework for recycling Gaussian process approximations.
problem Efficiently combining multiple Gaussian process approximations.
method Construct variational ensembles using a dictionary of fitted Gaussian processes.
result Framework allows for various tasks and scalability.
Develops VGP for complex posterior distributions in deep generative models.
problem Learning complex posterior distributions in deep generative models.
method Bayesian nonparametric variational family, adaptive latent inputs, random non-linear mappings, auto-encoder inspired variational objective.
result Achieves new state-of-the-art results for unsupervised learning.
This tutorial derives the VAE loss function under Gaussian assumptions.
problem Computational intractability of posterior distributions in Bayesian machine learning.
method Derives the variational lower bound loss function of a standard VAE.
result The Kullback-Leibler divergence has a closed form solution under Gaussian assumptions.
Paper tightens variational GP approximations for large datasets.
problem Scaling Gaussian processes to large datasets.
method Relaxing the standard assumption about inducing points' posterior matching the prior, leading to a tighter variational approximation.
result The proposed approximation consistently matches or outperforms standard sparse variational GPs while maintaining computational cost.
GCVAE uses Gaussian copula for mixed data, improving over standard VAE.
problem Handling mixed categorical and continuous data.
method Employed Gaussian copula to model local dependency in mixed data, using rank-one approximation for covariance.
result GCVAE better captures the data manifold compared to standard VAE.
This paper improves GP models by making them sparse and variational.
problem Efficient computation and approximation of GP models with large datasets and non-Gaussian likelihoods.
method Variational approximation to the posterior, sparse in support of the function, with efficient computations based on inducing-point sparse GPs.
result A Hybrid Monte-Carlo sampling scheme for non-Gaussian approximations of function values and covariance parameters.
Parameter estimation for model-based clustering using a finite mixture of normal inverse Gaussian (NIG) distributions is achieved through variational Bayes approximations. Univariate NIG mixtures and multivariate NIG mixtures are considered. The use of variational Bayes approximations here is a substantial departure fr…
VNNGP uses nearest neighbors to approximate GPs, improving scalability and performance.
problem Scalability issues in Gaussian process approximations.
method Sparse precision structure via nearest neighbors, variational framework.
result VNNGP outperforms low-rank methods and is less prone to overfitting.
Latent Gaussian models (LGMs) are widely used in statistics and machine learning. Bayesian inference in non-conjugate LGMs is difficult due to intractable integrals involving the Gaussian prior and non-conjugate likelihoods. Algorithms based on variational Gaussian (VG) approximations are widely employed since they str…
New scalable GP approximation using Fourier series decomposition.
problem Scalability and accuracy in Gaussian process approximations.
method Harmonic kernel decomposition (HKD) to decompose kernels orthogonally.
result Significantly outperforms standard variational methods in scalability and accuracy.
EigenVI uses orthogonal function expansions for efficient variational inference.
problem Efficiently approximate complex distributions in variational inference.
method EigenVI constructs variational approximations using orthogonal function expansions, minimizing Fisher divergence.
result EigenVI provides more accurate approximations than existing methods for Gaussian BBVI.
Efficiently infers Gaussian process density models with Gibbs sampling and variational methods.
problem Density estimation for complex, nonparametric models.
method Augmented likelihood with latent variables, Gibbs sampling, and variational mean field approximations.
result Efficient inference for Gaussian process density models with up to thousands of data points.
A new knot selection method speeds up sparse Gaussian process approximations.
problem Efficiently selecting knots for sparse Gaussian processes.
method One-at-a-time Bayesian optimization for knot selection.
result Competitive performance with reduced computational cost.
Combines Laplace approximation and variational inference for better posterior correlations.
problem Lack of posterior correlations in variational inference.
method Combines Laplace approximation and variational inference, explicitly minimising KL divergence.
result Improves over Laplace approximation and variational inference with factorised Gaussian posteriors.
Deep Gaussian processes provide a flexible approach to probabilistic modelling of data using either supervised or unsupervised learning. For tractable inference approximations to the marginal likelihood of the model must be made. The original approach to approximate inference in these models used variational compressio…
Improved sparse Gaussian processes using structured scaling matrices and Power-EP framework.
problem Scaling Gaussian processes for large datasets.
method Structured diagonal scaling matrix and Power-EP framework.
result Structured approximations improve performance without increasing computational cost.
A new method for Gaussian filtering using gradient flows and Wasserstein metrics.
problem Approximating Gaussian and mixture-of-Gaussians filtering for complex systems.
method Variational approximation via gradient-flow representation on Wasserstein metric space.
result Competitive performance in posterior representation and parameter estimation for systems with multiplicative noise and multi-modal distributions.
New DRGP models improve prediction accuracy for sequential data.
problem Modeling sequential data for applications like autonomous driving.
method Introduces Deep recurrent Gaussian process (DRGP) models based on Sparse Spectrum Gaussian process (SSGP) and variational Sparse Spectrum Gaussian process (VSSGP).
result Improves prediction accuracy compared to current state of the art methods.
We solve inference for deep Gaussian processes without layer independence.
problem Challenging inference in deep Gaussian processes.
method Doubly stochastic variational inference.
result DGP models can be effectively used on large datasets.
Variational Gaussian approximates Poisson data for Bayesian inference.
problem Analytically intractable posterior distribution for Poisson data.
method Variational Gaussian approximation minimizing Kullback-Leibler divergence.
result Explicit lower bound for optimization, efficient algorithm for solving.
We use variational Gaussian approximations to analyze parametric models with unknown data-generating distributions.
problem Analyzing inference and learning in parametric models with unknown or intractable data-generating distributions.
method Replica method with variational Gaussian approximation in grand canonical formalism.
result Stationarity conditions adaptively determine parameters of the trial Hamiltonian for each dataset.
New method for faster, scalable inference in coupled Gaussian Processes.
problem Coupled Gaussian Processes require scalable inference methods for posterior uncertainty.
method Structured variational inference for multi-Gaussian Processes.
result Fast and scalable inference capturing posterior dependencies.
This paper explores approximations for fully Bayesian Gaussian Process Regression.
problem Learning in Gaussian Process models through hyperparameter adaptation.
method Two approximation schemes: Hamiltonian Monte Carlo and Variational Inference.
result Predictive performance analysis on various benchmark datasets.
A new method improves likelihood-free Bayesian inference by transforming summary statistics and using efficient Variational Bayes.
problem Incorrectly assuming normally distributed summary statistics in likelihood-free Bayesian inference.
method Wasserstein Gaussianization transformation combined with robust BSL and efficient Variational Bayes.
result Highly efficient and reliable approximate Bayesian inference for likelihood-free problems.
New algorithm radVI improves variational inference by optimizing radial profiles.
problem Gaussian approximations often fail to capture the radial profile of complex distributions.
method Optimizes over radial profiles in variational inference, providing theoretical guarantees.
result Theoretical convergence guarantees for radVI, improving over existing VI methods.
Amortized VI for DGPs learns efficient inference.
problem Expressive limitations in GP approximations.
method Amortized variational inference for DGPs.
result Improved expressive prior and posterior for DGPs.
A scalable method for estimating spatial data using VREML.
problem Costly computation of REML for large, sparse precision matrices in spatial data.
method Proposes VREML framework approximating marginal likelihood with Gaussian variational distribution and deriving a coordinate-ascent algorithm.
result Empirically shows VREML outperforms MLE and INLA.
A new variational method with statistical guarantees for Bayesian inference.
problem Improving variational inference with provable statistical guarantees.
method Introducing α-Variational Inference (α-VB) with statistical guarantees. result The α-VB method provides optimal convergence rates for parameter estimates. VB approximates posterior mean perfectly in linear Gaussian VAR models.
problem Unknown approximation error of VB in VAR models.
method Derive approximation error in terms of mean, mode, variance, predictive density, and KL divergence.
result VB approximates posterior mean perfectly.
This paper improves Gaussian variational approximation for Bayesian inference on manifolds.
problem Optimizing covariance matrices in high-dimensional Bayesian inference.
method Applying Stiefel and Grassmann manifold constraints to Gaussian covariance matrices for optimization.
result The proposed methods achieve competitive accuracy and comparable convergence speed.
This paper proposes a method to approximate non-Gaussian likelihoods in Gaussian Processes.
problem Approximating non-Gaussian likelihoods in Gaussian Processes.
method Proposes a piece-wise constant approximation for the inverse-link function.
result Yields a closed form solution for the SVGP lower bound.