Quenched large deviations for Monte Carlo integration with Coulomb gases
Not on the map. Why?
Abstract (arXiv)
Gibbs measures, such as Coulomb gases, are popular in modelling systems of interacting particles. Recently, we proposed to use Gibbs measures as randomized numerical integration algorithms with respect to a target measure π on mathbb Rd, following the heuristics that repulsiveness between particles should help reduce integration errors. A major issue in this approach is to tune the interaction kernel and confining potential of the Gibbs measure, so that the equilibrium measure of the system is the target distribution π. Doing so usually requires another Monte Carlo approximation of the potential, i.e. the integral of the interaction kernel with respect to π. Using the methodology of large deviations from Garcia--Zelada (2019), we show that a random approximation of the potential preserves the fast large deviation principle that guarantees the proposed integration algorithm to outperform independent or Markov quadratures. For non-singular interaction kernels, we make minimal assumptions on this random approximation, which can be the result of a computationally cheap Monte Carlo preprocessing. For the Coulomb interaction kernel, we need the approximation to be based on another Gibbs measure, and we prove in passing a control on the uniform convergence of the approximation of the potential.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 17 of its 45 references that are in the map. First posted on arXiv 2 Aug 2025.
Builds on
17 of 45 references.
References · 17
- 2017Measuring Sample Quality with Kernelscited by 119
- 2018Log-concave sampling: Metropolis-Hastings algorithms are fastcited by 118
- 2021Kernel Stein Discrepancy Descentcited by 57
- 2021Kernel Thinningcited by 47
- 2018Stein Pointscited by 43
- 2016Support pointscited by 39
- 2021Stein's Method Meets Computational Statistics: A Review of Some Recent Developmentscited by 32
- 2019Stein Point Markov Chain Monte Carlocited by 29
- 2021Generalized Kernel Thinningcited by 29
- 2019Kernel quadrature with DPPscited by 27
- 2016Monte Carlo with Determinantal Point Processescited by 22
- 2020Kernel interpolation with continuous volume samplingcited by 21
5 more
- 2021Distribution Compression in Near-linear Timecited by 19
- 2022Controlling Moments with Kernel Stein Discrepanciescited by 13
- 2023Efficient Numerical Integration in Reproducing Kernel Hilbert Spaces via Leverage Scores Samplingcited by 10
- 2023Kernel Stein Discrepancy thinning: a theoretical perspective of pathologies and a practical fix with regularizationcited by 9
- 2024Monte Carlo with kernel-based Gibbs measures: Guarantees for probabilistic herdingcited by 1
Built on by
Not cited yet.