Many processors, little time: MCMC for partitions via optimal transport couplings.

Tin D. Nguyen Brian L. Trippe Tamara Broderick

Published in: AISTATS (2022)

Keyphrases

optimal solution
monte carlo
parallel algorithm
dynamic programming
parallel processing
markov chain
reinforcement learning
worst case
closed form
additively separable