arXiv AI
Reflected Proximal Dynamics for Accelerated High-Accuracy Log-Concave Sampling
Read the original on arXiv AI →The Flow has not summarised this story yet — read it at arXiv AI.
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 Statistics ML
Aug 27
Provable Non-Acceleration of Standard Strang Splittings of Kinetic Langevin Dynamics
arXiv:2608.25279v1 Announce Type: cross Abstract: The OBABO and BAOAB schemes and the other standard Strang splittings of kinetic (underdamped) Langevin dynamics are widely used Markov chain Monte Ca...
arXiv Machine Learning
Oct 9
Accelerating Non-Smooth and Heavy-Tailed Sampling
The paper introduces non‑reversible anchored Langevin dynamics (NALD) and its reflected variant (NRALD) for sampling target distributions that may be non‑smooth and heavy‑tailed, both in Euclidean space and on constrained domains. By adding a circulation drift through a divergence‑free skew‑symmetric matrix field and a stream potential, the methods preserve the target distribution without needing density derivatives, admit a random‑time‑change representation, and can be applied with normal reflection on bounded domains. The authors demonstrate that breaking reversibility leads to faster convergence to the target distribution, as shown by finite‑time non‑asymptotic analysis, large‑deviations results, and asymptotic variance reduction, with numerical experiments confirming the algorithms’ efficiency.
arXiv Machine Learning
Sep 10
Fast PAC Global Optimization via Restarted Langevin: Exploration, Exploitation, and Degenerate Cooling
arXiv:2609.06196v1 Announce Type: cross Abstract: We study the computational effort required for global optimization of a smooth, possibly nonconvex objective $\Gamma:\mathbb{R}^d\to\mathbb{R}$. An a...
arXiv Machine Learning
Sep 23
Penalized Nonreversible Langevin for Constrained Sampling
The paper introduces penalized nonreversible Langevin algorithms for sampling from a target distribution constrained to a compact convex set. It combines a squared distance penalty with skew-symmetric perturbations that preserve the penalized Gibbs distribution, and provides nonasymptotic total variation and Wasserstein bounds under various smoothness and contraction assumptions. Numerical experiments demonstrate the methods on constrained Bayesian regression, classification, neural networks, and truncated sampling, highlighting acceleration in a stochastic quadratic model.
arXiv Machine Learning
Sep 10
Smoothed Picard Hamiltonian Monte Carlo
arXiv:2609.06906v1 Announce Type: cross Abstract: We develop a new low-accuracy sampler, called \emph{smoothed Picard Hamiltonian Monte Carlo}, which combines Gaussian smoothing, Picard iteration, an...