Improved dimension dependence of a proximal algorithm for sampling
We propose a sampling algorithm that achieves superior complexity bounds in all the
classical settings (strongly log-concave, log-concave, Logarithmic-Sobolev inequality (LSI) …
classical settings (strongly log-concave, log-concave, Logarithmic-Sobolev inequality (LSI) …
Provable benefit of annealed langevin monte carlo for non-log-concave sampling
We address the outstanding problem of sampling from an unnormalized density that may be
non-log-concave and multimodal. To enhance the performance of simple Markov chain …
non-log-concave and multimodal. To enhance the performance of simple Markov chain …