SearcharxivSearch

arXiv subjects

Thibaut Pellerin

Publications and source records attributed to Thibaut Pellerin.

2 recordsLinked to original sources

Sampling from multi-modal distributions on Riemannian manifolds with training-free stochastic interpolants

In this paper, we propose a general methodology for sampling from un-normalized densities defined on Riemannian manifolds, with a particular focus on multi-modal targets that remain challenging for existing sampling methods. Inspired by the framework of diffusion models developed for generative modeling, we introduce a sampling algorithm based on the simulation of a non-equilibrium deterministic dynamics that transports an easy-to-sample noise distribution toward the target. At the marginal level, the induced density path follows a prescribed stochastic interpolant between the noise and target distributions, specifically constructed to respect the underlying Riemannian geometry. In contrast to related generative modeling approaches that rely on machine learning, our method is entirely training-free. It instead builds on iterative posterior sampling procedures using only standard Monte Carlo techniques, thereby extending recent diffusion-based sampling methodologies beyond the Euclidean setting. We complement our approach with a rigorous theoretical analysis and demonstrate its effectiveness on a range of multi-modal sampling problems, including high-dimensional and heavy-tailed examples.

stat.ML

New lower bounds for Schur and weak Schur numbers

This article provides new lower bounds for both Schur and weak Schur numbers by exploiting a "template"-based approach. The concept of "template" is also generalized to weak Schur numbers. Finding new templates leads to explicit partitions improving lower bounds as well as the growth rate for Schur numbers, weak Schur numbers, and multicolor Ramsey numbers $R_n(3)$. The new lower bounds include $S(9) \geq 17\,803$, $S(10) \geq 60\,948$, $\mathit{WS}(6) \geq 646$, $\mathit{WS}(9) \geq 22\,536$ and $\mathit{WS}(10) \geq 71\,256$.

math.CO