← Back to all news
arXiv Machine Learning By Wujun Lv, Xiaoyu Wang, Yingli Wang, Lingjiong Zhu

Improved Analysis for Hessian-free High-resolution Monte Carlo Sampling

Read the original on arXiv Machine Learning →

The paper introduces Hessian-free high-resolution (HFHR) dynamics, an extension of underdamped Langevin dynamics that incorporates reversible position diffusion for sampling in machine learning. It provides an explicit quantitative contraction rate under a position Poincaré inequality, weighted Hessian and Laplacian bounds, and a compact Sobolev embedding, even when the potential is non‑convex. For the HFHR Monte Carlo algorithm, a path‑space Girsanov argument yields a non‑asymptotic convergence bound and an explicit iteration complexity in total variation distance, improving on previous HFHR results and demonstrating benefits of a positive diffusion parameter through numerical experiments.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

Related stories

arXiv Machine Learning
Oct 8

Reflected Anchored Langevin Algorithms

The paper introduces Reflected Anchored Langevin Dynamics (RALD), a reflected diffusion that can converge to non‑differentiable target distributions on constrained domains. By employing a smooth anchored reference potential and scaling the drift and noise covariance with a state‑dependent factor, the authors derive an Euler‑Maruyama discretization with projection, yielding the Reflected Anchored Langevin Monte Carlo (RALMC) algorithm. Explicit convergence bounds and iteration complexity in the 2‑Wasserstein distance are proven, and numerical experiments confirm the theoretical predictions and empirical performance.

By Changwei Tu, Xiaoyu Wang, Yingli Wang, Xicheng Zhang, Lingjiong Zhu
diffusion
More like this →
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.

By Pervez Ali, Weihao Dong, Xiaoyu Wang
More like this →
arXiv Statistics ML
Aug 26

A Non-asymptotic Analysis for Learning and Applying a Preconditioner in MCMC

The paper presents a non‑asymptotic analysis of Markov chain Monte Carlo (MCMC) algorithms that learn and apply a preconditioner based on either the target covariance or the expected Hessian of the target potential. It compares the finite‑time computational costs of these preconditioned schemes with unpreconditioned counterparts, providing guarantees for algorithms such as the Unadjusted Langevin Algorithm (ULA) and the proximal sampler. The analysis relies on a contraction assumption in the Wasserstein‑2 distance to formalize approximate independence and bridge modern MCMC theory with classical effective sample size heuristics.

By Max Hird, Florian Maire, Jeffrey Negrea
More like this →