In applications of Gaussian processes where quantification of uncertainty is of primary in-terest, it is necessary to accurately character-ize the posterior distribution over covariance pa-rameters. This paper proposes an adaptation of the Stochastic Gradient Langevin Dynamics al-gorithm to draw samples from the posterior dis-tribution over covariance parameters with negli-gible bias and without the need to compute the marginal likelihood. In Gaussian process re-gression, this has the enormous advantage that stochastic gradients can be computed by solving linear systems only. A novel unbiased linear sys-tems solver based on parallelizable covariance matrix-vector products is developed to acceler-ate the unbiased estimation of gradients. The...
Stochastic gradient MCMC (SGMCMC) offers a scalable alternative to traditional MCMC, by constructing...
The stochastic gradient Langevin Dynamics is one of the most fundamental algorithms to solve samplin...
Stochastic gradient MCMC methods, such as stochastic gradient Langevin dynamics (SGLD), employ fast ...
In applications of Gaussian processes where quantification of uncertainty is of primary interest, it...
Stochastic gradient Markov Chain Monte Carlo algorithms are popular samplers for approximate inferen...
We introduce a novel and efficient algorithm called the stochastic approximate gradient descent (SAG...
In this paper we propose a new framework for learning from large scale datasets based on iterative l...
Year after years, the amount of data that we continuously generate is increasing. When this situatio...
Best Paper AwardInternational audienceOne way to avoid overfitting in machine learning is to use mod...
International audienceStochastic Gradient Langevin Dynamics (SGLD) has emerged as a key MCMC algorit...
Applying standard Markov chain Monte Carlo (MCMC) algorithms to large data sets is computationally e...
Gaussian processes scale prohibitively with the size of the dataset. In response, many approximation...
We implement the simple method to accelerate the convergence speed to the steady state and enhance t...
We consider the motion planning problem under uncertainty and address it using probabilistic inferen...
Abstract. Gaussian processes are a natural way of dening prior distributions over func-tions of one ...
Stochastic gradient MCMC (SGMCMC) offers a scalable alternative to traditional MCMC, by constructing...
The stochastic gradient Langevin Dynamics is one of the most fundamental algorithms to solve samplin...
Stochastic gradient MCMC methods, such as stochastic gradient Langevin dynamics (SGLD), employ fast ...
In applications of Gaussian processes where quantification of uncertainty is of primary interest, it...
Stochastic gradient Markov Chain Monte Carlo algorithms are popular samplers for approximate inferen...
We introduce a novel and efficient algorithm called the stochastic approximate gradient descent (SAG...
In this paper we propose a new framework for learning from large scale datasets based on iterative l...
Year after years, the amount of data that we continuously generate is increasing. When this situatio...
Best Paper AwardInternational audienceOne way to avoid overfitting in machine learning is to use mod...
International audienceStochastic Gradient Langevin Dynamics (SGLD) has emerged as a key MCMC algorit...
Applying standard Markov chain Monte Carlo (MCMC) algorithms to large data sets is computationally e...
Gaussian processes scale prohibitively with the size of the dataset. In response, many approximation...
We implement the simple method to accelerate the convergence speed to the steady state and enhance t...
We consider the motion planning problem under uncertainty and address it using probabilistic inferen...
Abstract. Gaussian processes are a natural way of dening prior distributions over func-tions of one ...
Stochastic gradient MCMC (SGMCMC) offers a scalable alternative to traditional MCMC, by constructing...
The stochastic gradient Langevin Dynamics is one of the most fundamental algorithms to solve samplin...
Stochastic gradient MCMC methods, such as stochastic gradient Langevin dynamics (SGLD), employ fast ...