Gradient-free Riemannian Langevin Sampler

Ricardo Baptista, Olivier Zahm
7/8/2026
cs.LGmath.ST

No confident code implementation found for this paper.

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.

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{baptista2026gradientfree,
  title  = {Gradient-free Riemannian Langevin Sampler},
  author = {Ricardo Baptista and Olivier Zahm},
  year   = {2026},
  eprint = {2607.07519},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2607.07519v1}
}

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/2607.07519.svg)](https://codeofpaper.com/paper/2607.07519)

Discussion