Double Randomized Underdamped Langevin with Dimension-Independent Convergence Guarantee

Neural Information Processing Systems 

This paper focuses on the high-dimensional sampling of log-concave distributions with composite structures: p (dx) exp( g(x) f(x))dx. We develop a double randomization technique, which leads to a fast underdamped Langevin algorithm with a dimension-independent convergence guarantee.

Similar Docs  Excel Report  more

TitleSimilaritySource
None found