Rapid Convergence of the Unadjusted Langevin Algorithm: Isoperimetry Suffices

Notably, we do not assume convexity or bounds on higher derivatives. We also prove convergence guarantees in Rényi divergence of order q>1 assuming the limit of ULA satisfies either log-Sobolev or Poincaré inequality.