cs.LGJul 8, 2026

Gradient-free Riemannian Langevin Sampler

Authors: Ricardo BaptistaOlivier Zahm

Organizations: Department of Statistical Sciences, University of Toronto, Canada · UGA, Inria, CNRS, Grenoble INP*, LJK, 38000 Grenoble, France

Abstract

We address the problem of efficiently sampling multimodal probability distributions, where standard Markov Chain Monte Carlo methods often suffer from poor mixing and mode trapping. To mitigate these issues, we propose Gradient-free Riemannian Langevin Sampler (GRiLS), a novel proposal that improves exploration without requiring gradient evaluations of the target density. Our approach introduces a Riemannian metric which reshapes the local geometry in order to facilitate transitions across modes. The resulting gradient-free MCMC algorithm is particularly suitable for complex, computationally expensive targets where derivatives are unavailable or impractical. The GRiLS proposal requires knowing the mean and covariance of the target density, which we estimate using an ensemble of interacting particles. Empirical results on multimodal benchmarks demonstrate that GRiLS achieves improved mixing compared to existing gradient-based and gradient-free MCMC approaches.

Explore similar work

CardsList
  1. Gaussian Invariant Markov Chain Monte Carlo

    Jun 26, 2025Michalis K. Titsias, Angelos Alexopoulos, Siran Liu +1Markov Chain Monte CarloLangevin Dynamics