Wasserstein mixing time of the unadjusted Langevin algorithm
arXiv:2608.02430v1 Announce Type: cross Abstract: We provide new estimates in Wasserstein distance for the asymptotic bias of the unadjusted Langevin algorithm, in the classical setting of log-smooth