Regularized Sparse Gaussian Processes
Gaussian processes are a flexible Bayesian nonparametric modelling approach that has been widely applied but poses computational challenges. To address the poor scaling of exact inference methods, approximation methods based on sparse Gaussian processes (SGP) are attractive. An issue faced by SGP, especially in latent variable models, is the inefficient learning of the inducing inputs, which leads to poor model prediction. We propose a regularization approach by balancing the reconstruction performance of data and the approximation performance of the model itself. This regularization improves both inference and prediction performance. We extend this regularization approach into latent variable models with SGPs and show that performing variational inference (VI) on those models is equivalent to performing VI on a related empirical Bayes model.
Code (0)
등록된 구현이 없습니다.
Tasks
Facial Expression Recognition (FER)Gaussian ProcessesImage ReconstructionPose EstimationVariational InferenceMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Hierarchical Non-Stationary Temporal Gaussian Processes With $L^1$-Regularization
This paper is concerned with regularized extensions of hierarchical non-stationary temporal Gaussian processes (NSGPs) in which the parameters (e.g., length-scale) are modeled as GPs. In particular, we consider two commo…
Gaussian ProcessesregressionHigh-Dimensional Bernoulli Autoregressive Process with Long-Range Dependence
We consider the problem of estimating the parameters of a multivariate Bernoulli process with auto-regressive feedback in the high-dimensional setting where the number of samples available is much less than the number of…
Gaussian ProcessesVocal Bursts Intensity PredictionSparse Inverse Covariance Matrix Estimation Using Quadratic Approximation
The L1-regularized Gaussian maximum likelihood estimator (MLE) has been shown to have strong statistical guarantees in recovering a sparse inverse covariance matrix, or alternatively the underlying graph structure of a G…
Decoupled Sparse Gaussian Processes Components]{Decoupled Sparse Gaussian Processes Components : Separating Decision Making from Data Manifold Fitting
We propose a decoupling in Reproducing Kernel Hilbert Space of the parametric and non-parametric components of Sparse Gaussian Processes. We demonstrate that this decoupling results in a set of inducing points concentra…
Decision MakingGaussian ProcessesregressionA Regularized Approach to Sparse Optimal Policy in Reinforcement Learning
We propose and study a general framework for regularized Markov decision processes (MDPs) where the goal is to find an optimal policy that maximizes the expected discounted total reward plus a policy regularization term.…
reinforcement-learningReinforcement LearningReinforcement Learning (RL)