Establishing an Ω(\sqrt{d}) complexity lower bound for PDMP samplers and how to break it: a sub-\sqrt{d} algorithm for Gaussian-tailed targets

MaRDI QIDQ7327434arXivFDO

Authors Augustin Chevallier

Publication date 2026

Published in arXiv

arXiv classification

stat.CO

This page was built for publication: Establishing an $Ω(\sqrt{d})$ complexity lower bound for PDMP samplers and how to break it: a sub-$\sqrt{d}$ algorithm for Gaussian-tailed targets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7327434)