相关论文: The fast sampling algorithm for Lie-Trotter produc…
We demonstrate that the Levy-Ciesielski implementation of Lie-Trotter products enjoys several properties that make it extremely suitable for path-integral Monte Carlo simulations: fast computation of paths, fast Monte Carlo sampling, and…
We develop generic and efficient importance sampling estimators for Monte Carlo evaluation of prices of single- and multi-asset European and path-dependent options in asset price models driven by L\'evy processes, extending earlier works…
The use of random sampling in decision-making and control has become popular with the ease of access to graphic processing units that can generate and calculate multiple random trajectories for real-time robotic applications. In contrast to…
We describe an embarrassingly parallel, anytime Monte Carlo method for likelihood-free models. The algorithm starts with the view that the stochasticity of the pseudo-samples generated by the simulator can be controlled externally by a…
An important family of stochastic processes arising in many areas of applied probability is the class of L\'evy processes. Generally, such processes are not simulatable especially for those with infinite activity. In practice, it is common…
We present a method to compute real-time path integrals numerically, by Monte-Carlo sampling on near-Lefschetz thimbles. We present a collection of tools based on the Lefschetz thimble methods, which together provide an alternative to…
We propose a very fast approximate Markov Chain Monte Carlo (MCMC) sampling framework that is applicable to a large class of sparse Bayesian inference problems, where the computational cost per iteration in several models is of order…
We propose a new Monte Carlo method for efficiently sampling trajectories with fixed initial and final conditions in a system with discrete degrees of freedom. The method can be applied to any stochastic process with local interactions,…
In Monte Carlo simulations, proposed configurations are accepted or rejected according to an acceptance ratio, which depends on an underlying probability distribution and an a priori sampling probability. By carefully selecting the…
The paper proposes a Riemannian Manifold Hamiltonian Monte Carlo sampler to resolve the shortcomings of existing Monte Carlo algorithms when sampling from target densities that may be high dimensional and exhibit strong correlations. The…
In this paper we address the problem of rare-event simulation for heavy-tailed L\'evy processes with infinite activities. We propose a strongly efficient importance sampling algorithm that builds upon the sample path large deviations for…
We describe a novel simulation method that eliminates the slowing-down problem in the Monte Carlo simulations of imaginary-time path integrals near the continuum limit. This method combines a stochastic blocking procedure with the multigrid…
We explore the construction of new symplectic numerical integration schemes to be used in Hamiltonian Monte Carlo and study their efficiency. Two integration schemes from Blanes et al. (2014), and a new scheme based on optimal acceptance…
Elliptical slice sampling, when adapted to linearly truncated multivariate normal distributions, is a rejection-free Markov chain Monte Carlo method. At its core, it requires analytically constructing an ellipse-polytope intersection. The…
We introduce YOASOVI, an algorithm for performing fast, self-correcting stochastic optimization for Variational Inference (VI) on large Bayesian heirarchical models. To accomplish this, we take advantage of available information on the…
Hamiltonian Monte Carlo (HMC) is a popular method in sampling. While there are quite a few works of studying this method on various aspects, an interesting question is how to choose its integration time to achieve acceleration. In this…
We propose a novel technique for speeding up the self-learning Monte Carlo method applied to the single-site impurity model. For the case where the effective Hamiltonian is expressed by polynomial functions of differences of imaginary-time…
We address the problem of sampling double-ended diffusive paths. The ensemble of paths is expressed using a symmetric version of the Onsager-Machlup formula, which only requires evaluation of the force field and which, upon direct time…
A simple algorithm is described to sample permutations of identical particles in Path Integral Monte Carlo (PIMC) simulations of continuum many-body systems. The sampling strategy illustrated here is fairly general, and can be easily…
We introduce a new path integral Monte Carlo method for investigating nonadiabatic systems in thermal equilibrium and demonstrate an approach to reducing stochastic error. We derive a general path integral expression for the partition…