arXiv Machine Learning
Smoothed Picard Hamiltonian Monte Carlo
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv Machine Learning
Sep 10
Accelerated High-Accuracy Sampling from a Warm Start via the Proximal Bouncy Particle Sampler
arXiv:2609.06905v1 Announce Type: cross Abstract: We study the problem of sampling from $\mu(\mathrm{d}x)\propto e^{-V(x)}\,\mathrm{d}x$ on $\mathbb{R}^d$, where $V$ is $\alpha$-strongly convex and $...
arXiv Machine Learning
Jul 2
Fast Score-Based Sampling via Log-Concave Reductions
arXiv:2512. 24152v2 Announce Type: replace-cross Abstract: Sampling based on score diffusions has led to striking empirical results, and has attracted considerable attention from various research communities.
arXiv Machine Learning
4d ago
Poisson-Corrector Complexity Bounds for Moreau--Yosida Unadjusted Langevin Sampling
arXiv:2609. 12594v1 Announce Type: new Abstract: We study the classical Moreau--Yosida unadjusted Langevin algorithm (MYULA) for $\pi(\,\mathrm{d} x)\propto e^{-f(x)-g(x)}\,\mathrm{d} x$, where $f\in C^2(\mathbb{R}^d)$ is $m$-strongly convex with $L_f$-Lipschitz gradient and $g:\mathbb{R}^d\to\mathbb{R}$ is convex and globally $G$-Lipschitz.
arXiv Machine Learning
Jul 31
Windowed thinning and query complexity for the bouncy particle and Zigzag samplers
arXiv:2607. 28413v1 Announce Type: cross Abstract: Let $\mu(d x)\propto e^{-U(x)} d x$ on $\R^d$, where $U$ is $m$-strongly convex and $L$-smooth, and denote by $\kappa=L/m$ the condition number.
arXiv Machine Learning
Jul 15
Accelerated Mixing Time of Randomized Hamiltonian Monte Carlo
arXiv:2607. 12902v1 Announce Type: cross Abstract: We show the Randomized Hamiltonian Monte Carlo (RHMC) algorithm has accelerated mixing time guarantees for sampling from log-concave probability distributions.
arXiv Machine Learning
4d ago
Tight Sampling Complexity with stochastic gradient oracles in Fixed Dimensions
arXiv:2609. 12590v1 Announce Type: cross Abstract: We investigate the stochastic-gradient query complexity of sampling smooth strongly log-concave distributions in any fixed Euclidean dimension.