Optimal Riemannian metric for Poincaré inequalities and how to ideally precondition Langevin dynamics

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Cui, Tiangang, Tong, Xin, Zahm, Olivier
Format: Preprint
Publié: 2024
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866910872067112960
author Cui, Tiangang
Tong, Xin
Zahm, Olivier
author_facet Cui, Tiangang
Tong, Xin
Zahm, Olivier
contents Poincaré inequality is a fundamental property that rises naturally in different branches of mathematics. The associated Poincaré constant plays a central role in many applications since it governs the convergence of various practical algorithms. For instance, the convergence rate of the Langevin dynamics is exactly given by the Poincaré constant. This paper investigates a Riemannian version of Poincaré inequality where a positive definite weighting matrix field (\emph{i.e.} a Riemannian metric) is introduced to improve the Poincaré constant, and therefore the performances of the associated algorithm. Assuming the underlying measure is a \emph{moment measure}, we show that an optimal metric exists and the resulting Poincaré constant is 1. We demonstrate that such optimal metric is necessarily a \emph{Stein kernel}, offering a novel perspective on these complex but central mathematical objects that are hard to obtain in practice. We further discuss how to numerically obtain the optimal metric by deriving an implementable optimization algorithm. The resulting method is illustrated in a few simple but nontrivial examples, where solutions are revealed to be rather sophisticated. We also demonstrate how to design efficient Langevin-based sampling schemes by utilizing the precomputed optimal metric as a preconditioner.
format Preprint
id arxiv_https___arxiv_org_abs_2404_02554
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Optimal Riemannian metric for Poincaré inequalities and how to ideally precondition Langevin dynamics
Cui, Tiangang
Tong, Xin
Zahm, Olivier
Probability
46N30, 60H10, 39B62
Poincaré inequality is a fundamental property that rises naturally in different branches of mathematics. The associated Poincaré constant plays a central role in many applications since it governs the convergence of various practical algorithms. For instance, the convergence rate of the Langevin dynamics is exactly given by the Poincaré constant. This paper investigates a Riemannian version of Poincaré inequality where a positive definite weighting matrix field (\emph{i.e.} a Riemannian metric) is introduced to improve the Poincaré constant, and therefore the performances of the associated algorithm. Assuming the underlying measure is a \emph{moment measure}, we show that an optimal metric exists and the resulting Poincaré constant is 1. We demonstrate that such optimal metric is necessarily a \emph{Stein kernel}, offering a novel perspective on these complex but central mathematical objects that are hard to obtain in practice. We further discuss how to numerically obtain the optimal metric by deriving an implementable optimization algorithm. The resulting method is illustrated in a few simple but nontrivial examples, where solutions are revealed to be rather sophisticated. We also demonstrate how to design efficient Langevin-based sampling schemes by utilizing the precomputed optimal metric as a preconditioner.
title Optimal Riemannian metric for Poincaré inequalities and how to ideally precondition Langevin dynamics
topic Probability
46N30, 60H10, 39B62
url https://arxiv.org/abs/2404.02554