Convergence of Kinetic Langevin Monte Carlo on Lie groups

Lingkai Kong, Molei Tao
3/18/2024
math.STcs.LGmath.NA

No confident code implementation found for this paper.

Abstract

Explicit, momentum-based dynamics for optimizing functions defined on Lie groups was recently constructed, based on techniques such as variational optimization and left trivialization. We appropriately add tractable noise to the optimization dynamics to turn it into a sampling dynamics, leveraging the advantageous feature that the trivialized momentum variable is Euclidean despite that the potential function lives on a manifold. We then propose a Lie-group MCMC sampler, by delicately discretizing the resulting kinetic-Langevin-type sampling dynamics. The Lie group structure is exactly preserved by this discretization. Exponential convergence with explicit convergence rate for both the continuous dynamics and the discrete sampler are then proved under $W_2$ distance. Only compactness of the Lie group and geodesically $L$-smoothness of the potential function are needed. To the best of our knowledge, this is the first convergence result for kinetic Langevin on curved spaces, and also the first quantitative result that requires no convexity or, at least not explicitly, any common relaxation such as isoperimetry.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{kong2024convergence,
  title  = {Convergence of Kinetic Langevin Monte Carlo on Lie groups},
  author = {Lingkai Kong and Molei Tao},
  year   = {2024},
  eprint = {2403.12012},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2403.12012v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2403.12012.svg)](https://codeofpaper.com/paper/2403.12012)

Discussion