相关论文: Testing the criterion for correct convergence in t…

Explicit, momentum-based dynamics for optimizing functions defined on Lie groups was recently constructed, based on techniques such as variational optimization and left trivialization. We appropriately add tractable noise to the…

Estimating the log-likelihood gradient with respect to the parameters of a Restricted Boltzmann Machine (RBM) typically requires sampling using Markov Chain Monte Carlo (MCMC) techniques. To save computation time, the Markov chains are only…

Diagrammatic Monte Carlo approach is applied to a problem of a single spin-down fermion resonantly interacting with the sea of ideal spin-up fermions. On one hand, we develop a generic, sign-problem tolerant, method of exact numerical…

We study a sequential Monte Carlo algorithm to sample from the Gibbs measure with a non-convex energy function at a low temperature. We use the practical and popular geometric annealing schedule, and use a Langevin diffusion at each…

Recently there has been remarkable progress in solving the sign problem, which occurs in investigating statistical systems with a complex weight. The two promising methods, the complex Langevin method and the Lefschetz thimble method, share…

In molecular dynamics, penalized overdamped Langevin dynamics are used to model the motion of a set of particles that follow constraints up to a parameter $\varepsilon$. The most used schemes for simulating these dynamics are the Euler…

Markov chain Monte Carlo (MCMC) produces a correlated sample for estimating expectations with respect to a target distribution. A fundamental question is when should sampling stop so that we have good estimates of the desired quantities?…

We give a new characterization for the convergence in distribution to a standard normal law of a sequence of multiple stochastic integrals of a fixed order with variance one, in terms of the Malliavin derivatives of the sequence. We extend…

As a solution towards the numerical sign problem, we propose a novel Hybrid Monte Carlo algorithm, in which molecular dynamics is performed on a continuum set of integration surfaces foliated by the antiholomorphic gradient flow ("the…

In this paper, we prove convergence in distribution of Langevin processes in the overdamped asymptotics. The proof relies on the classical perturbed test function (or corrector) method, which is used both to show tightness in path space,…

Quantum Monte Carlo (QMC) methods are the gold standard for studying equilibrium properties of quantum many-body systems -- their phase transitions, ground and thermal state properties. However, in many interesting situations QMC methods…

Markov Chain Monte Carlo (MCMC) is one of the most powerful methods to sample from a given probability distribution, of which the Metropolis Adjusted Langevin Algorithm (MALA) is a variant wherein the gradient of the distribution is used…

Langevin algorithms are gradient descent methods augmented with additive noise, and are widely used in Markov Chain Monte Carlo (MCMC) sampling, optimization, and machine learning. In recent years, the non-asymptotic analysis of Langevin…

Markov Chain Monte Carlo (MCMC) algorithms are frequently used to perform inference under a Bayesian modeling framework. Convergence diagnostics, such as traceplots, the Gelman-Rubin potential scale reduction factor, and effective sample…

We extend the L\'evy Langevin Monte Carlo method studied by Oechsler in 2024 to the setting of a target distribution with heavy tails: Choosing a target distribution from the class of subexponential distributions we prove convergence of a…

Quantitative long-time entropic convergence and short-time regularization are established for an idealized Hamiltonian Monte Carlo chain which alternatively follows an Hamiltonian dynamics for a fixed time and then partially or totally…

Recent works have derived non-asymptotic upper bounds for convergence of underdamped Langevin MCMC. We revisit these bound and consider introducing scaling terms in the underlying underdamped Langevin equation. In particular, we provide…

Quantum field theories (QFTs) at finite densities of matter generically involve complex actions. Standard Monte-Carlo simulations based upon importance sampling, which have been producing quantitative first principle results in particle…

We study an optimal control problem under uncertainty, where the target function is the solution of an elliptic partial differential equation with random coefficients, steered by a control function. The robust formulation of the…

The Contrastive Divergence (CD) algorithm has achieved notable success in training energy-based models including Restricted Boltzmann Machines and played a key role in the emergence of deep learning. The idea of this algorithm is to…