Nonasymptotic bounds for sampling algorithms without log-concavity

From MaRDI portal
Publication:2657917

DOI10.1214/19-AAP1535zbMath1466.65008arXiv1808.07105OpenAlexW3021350626MaRDI QIDQ2657917

Lukasz Szpruch, Aleksandar Mijatović, Mateusz B. Majka

Publication date: 18 March 2021

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1808.07105




Related Items (16)


Uses Software


Cites Work


This page was built for publication: Nonasymptotic bounds for sampling algorithms without log-concavity