Non-asymptotic bounds for sampling algorithms without log-concavity

Open in new window