Related papers: Faster Hamiltonian Monte Carlo by Learning Leapfro…
We consider the Riemann manifold Hamiltonian Monte Carlo (RMHMC) method for solving statistical inverse problems governed by partial differential equations (PDEs). The power of the RMHMC method is that it exploits the geometric structure…
Self-learning Monte Carlo method (SLMC), using a trained effective model to guide Monte Carlo sampling processes, is a powerful general-purpose numerical method recently introduced to speed up simulations in (quantum) many-body systems. In…
The Hybrid Monte Carlo (HMC) algorithm currently is the favorite scheme to simulate quantum chromodynamics including dynamical fermions. In this talk-which is intended for a non-expert audience--I want to bring together methodical and…
Diffusion models (DMs) have recently shown remarkable performance on inverse problems (IPs). Optimization-based methods can fast solve IPs using DMs as powerful regularizers, but they are susceptible to local minima and noise overfitting.…
Splitting schemes are numerical integrators for Hamiltonian problems that may advantageously replace the St\"ormer-Verlet method within Hamiltonian Monte Carlo (HMC) methodology. However, HMC performance is very sensitive to the step size…
The need to calibrate increasingly complex statistical models requires a persistent effort for further advances on available, computationally intensive Monte Carlo methods. We study here an advanced version of familiar Markov Chain Monte…
Monte Carlo simulation is an unbiased numerical tool for studying classical and quantum many-body systems. One of its bottlenecks is the lack of general and efficient update algorithm for large size systems close to phase transition or with…
Building upon Lagrangian mechanics on Wess's $q$-commutative spaces, we derive the $q$-deformed Hamiltonian dynamics as formulated by Lavagno et al. (2006). We then develop a computationally tractable scheme and propose a novel Hamiltonian…
Monte Carlo simulations are a powerful tool to investigate the thermodynamic properties of atomic systems. In practice however, sampling of the complete configuration space is often hindered by high energy barriers between different regions…
The coalescence of binary neutron stars are one of the main sources of gravitational waves for ground-based gravitational wave detectors. As Bayesian inference for binary neutron stars is computationally expensive, more efficient and faster…
We propose a modification of the Hybrid Monte Carlo (HMC) algorithm that overcomes the topological freezing of a two-dimensional $U(1)$ gauge theory with and without fermion content. This algorithm includes reversible jumps between…
Adaptive Monte Carlo methods are very efficient techniques designed to tune simulation estimators on-line. In this work, we present an alternative to stochastic approximation to tune the optimal change of measure in the context of…
We propose quantum algorithms that provide provable speedups for Markov Chain Monte Carlo (MCMC) methods commonly used for sampling from probability distributions of the form $\pi \propto e^{-f}$, where $f$ is a potential function. Our…
We consider parallel asynchronous Markov Chain Monte Carlo (MCMC) sampling for problems where we can leverage (stochastic) gradients to define continuous dynamics which explore the target distribution. We outline a solution strategy for…
In machine learning and statistics, probabilistic inference involving multimodal distributions is quite difficult. This is especially true in high dimensional problems, where most existing algorithms cannot easily move from one mode to…
Federated learning performed by a decentralized networks of agents is becoming increasingly important with the prevalence of embedded software on autonomous devices. Bayesian approaches to learning benefit from offering more information as…
The hybrid Monte Carlo (HMC) algorithm is a ubiquitous method in computational physics with applications ranging from condensed matter to lattice QCD and beyond. However, HMC simulations often suffer from long autocorrelation times,…
We present a nonlinear (in the sense of McKean) generalization of Hamiltonian Monte Carlo (HMC) termed nonlinear HMC (nHMC) capable of sampling from nonlinear probability measures of mean-field type. When the underlying confinement…
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…
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…