Rapid Convergence of the Unadjusted Langevin Algorithm: Isoperimetry Suffices

    NeurIPS, pp. 8092-8104, 2019.

    Cited by: 11|Bibtex|Views5|Links
    EI
    Keywords:
    sobolev inequality

    Abstract:

    We study the Unadjusted Langevin Algorithm (ULA) for sampling from a probability distribution ⌫ = e f on R n. We prove a convergence guarantee in Kullback-Leibler (KL) divergence assuming ⌫ satisfies log-Sobolev inequality and f has bounded Hessian. Notably, we do not assume convexity or bounds on higher derivatives. We also prove converg...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments