相关论文: Malliavin Calculus as Stochastic Backpropogation

Stochastic neurons and hard non-linearities can be useful for a number of reasons in deep learning models, but in many cases they pose a challenging problem: how to estimate the gradient of a loss function with respect to the input of such…

By using the Malliavin calculus and finite jump approximations, the Driver-type integration by parts formula is established for the semigroup associated to stochastic (partial) differential equations with noises containing a subordinate…

In 2018, Bourgain pioneered a novel perturbative harmonic-analytic approach to the stochastic homogenization theory of discrete elliptic equations with weakly random i.i.d. coefficients. The approach was subsequently refined to show that…

In this paper, we propose a new stochastic optimization algorithm for Bayesian inference based on multilevel Monte Carlo (MLMC) methods. In Bayesian statistics, biased estimators of the model evidence have been often used as stochastic…

Gaussian latent variable models are a key class of Bayesian hierarchical models with applications in many fields. Performing Bayesian inference on such models can be challenging as Markov chain Monte Carlo algorithms struggle with the…

Variational empirical Bayes (VEB) methods provide a practically attractive approach to fitting large, sparse, multiple regression models. These methods usually use coordinate ascent to optimize the variational objective function, an…

A new approach in stochastic optimization via the use of stochastic gradient Langevin dynamics (SGLD) algorithms, which is a variant of stochastic gradient decent (SGD) methods, allows us to efficiently approximate global minimizers of…

Stochastic gradient MCMC methods, such as stochastic gradient Langevin dynamics (SGLD), employ fast but noisy gradient estimates to enable large-scale posterior sampling. Although we can easily extend SGLD to distributed settings, it…

In this paper we derive a efficient Monte Carlo approximation for the price of path-dependent derivatives under the multiscale stochastic volatility models of Fouque \textit{et al}. Using the formulation of this pricing problem under the…

Stochastic estimators are fundamental to large-scale optimization, where population quantities must be inferred from noisy oracle observations. Although influential methods such as momentum, SPIDER, STORM, and PAGE have been highly…

Variance parameter estimation in linear mixed models is a challenge for many classical nonlinear optimization algorithms due to the positive-definiteness constraint of the random effects covariance matrix. We take a completely novel view on…

We develop a theory of Malliavin calculus for Banach space valued random variables. Using radonifying operators instead of symmetric tensor products we extend the Wiener-Ito isometry to Banach spaces. In the white noise case we obtain two…

The low-rank stochastic semidefinite optimization has attracted rising attention due to its wide range of applications. The nonconvex reformulation based on the low-rank factorization, significantly improves the computational efficiency but…

We investigate existence and uniqueness of strong solutions of mean-field stochastic differential equations with irregular drift coefficients. Our direct construction of strong solutions is mainly based on a compactness criterion employing…

Proposals for Metropolis-Hastings MCMC derived by discretizing Langevin diffusion or Hamiltonian dynamics are examples of stochastic autoregressive proposals that form a natural wider class of proposals with equivalent computability. We…

Recent advances in stochastic gradient techniques have made it possible to estimate posterior distributions from large datasets via Markov Chain Monte Carlo (MCMC). However, when the target posterior is multimodal, mixing performance is…

In this work we show that rough stochastic differential equations (RSDEs), as introduced by Friz, Hocquet, and L\^e (2021), are Malliavin differentiable. We use this to prove existence of a density when the diffusion coefficients satisfies…

Traditionally, the field of computational Bayesian statistics has been divided into two main subfields: variational methods and Markov chain Monte Carlo (MCMC). In recent years, however, several methods have been proposed based on combining…

Given a random variable $F$ regular enough in the sense of the Malliavin calculus, we are able to measure the distance between its law and almost any continuous probability law on the real line. The bounds are given in terms of the…

Stochastic variance reduced methods have shown strong performance in solving finite-sum problems. However, these methods usually require the users to manually tune the step-size, which is time-consuming or even infeasible for some…