paper-with-me

홈 › Papers

Rapid mixing for Gibbs measures in Riemannian manifolds

2026-06-11 · Ángela Capel, Marco Castrillón-López, Sofyan Iblisdir, Angelo Lucia, Pablo Páez-Velasco, David Pérez-García arxiv

Langevin dynamics on Riemannian manifolds is analyzed. Conditions ensuring the existence of a suitable logarithmic Sobolev inequality (rapid mixing to the Gibbs measure) are identified. These conditions involve the curvature of the manifold, the inverse temperature, escaping directions from saddle points, and exclude barren plateaus and spurious local minima. We show that when these conditions are met, mixing times polynomial in the dimension of the manifold are achievable. This result is obtained through a relation between Langevin processes in the domain and in the image of a Riemannian submersion. Such a relation can be of independent interest.

📄 PDF Abstract BibTeX arXiv:2606.13453

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Convergence Rate of Riemannian Hamiltonian Monte Carlo and Faster Polytope Volume Computation

2017-10-17 · Yin Tat Lee, Santosh S. Vempala

We give the first rigorous proof of the convergence of Riemannian Hamiltonian Monte Carlo, a general (and practical) method for sampling Gibbs distributions. Our analysis shows that the rate of convergence is bounded in …

Rapidly Mixing Gibbs Sampling for a Class of Factor Graphs Using Hierarchy Width

2015-10-02 · NeurIPS 2015 12 · Christopher De Sa, Ce Zhang, Kunle Olukotun, Christopher Ré

Gibbs sampling on factor graphs is a widely used inference technique, which often produces good empirical results. Theoretical guarantees for its performance are weak: even for tree structured graphs, the mixing time of …

Ensuring Rapid Mixing and Low Bias for Asynchronous Gibbs Sampling

2016-02-24 · Christopher De Sa, Kunle Olukotun, Christopher Ré

Gibbs sampling is a Markov chain Monte Carlo technique commonly used for estimating marginal distributions. To speed up Gibbs sampling, there has recently been interest in parallelizing it by executing asynchronously. Wh…

Rapid Mixing Swendsen-Wang Sampler for Stochastic Partitioned Attractive Models

2017-04-06 · Sejun Park, Yunhun Jang, Andreas Galanis, Jinwoo Shin 외

The Gibbs sampler is a particularly popular Markov chain used for learning and inference problems in Graphical Models (GMs). These tasks are computationally intractable in general, and the Gibbs sampler often suffers fro…

Entropic Riemannian Neural Optimal Transport

2026-05-05 · Alessandro Micheli, Silvia Sapora, Anthea Monod, Samir Bhatt arxiv

Many machine learning problems involve data supported on curved spaces such as spheres, rotation groups, hyperbolic spaces, and general Riemannian manifolds, where Euclidean geometry can distort distances, averages, and …