Parallel Picard-map algorithms for zeroth-order Random Walk Metropolis achieve O(sqrt(d)) parallel iterations with O(sqrt(d)) processors on log-concave distributions in d dimensions.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
stat.CO 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Parallel computations for Metropolis Markov chains with Picard maps
Parallel Picard-map algorithms for zeroth-order Random Walk Metropolis achieve O(sqrt(d)) parallel iterations with O(sqrt(d)) processors on log-concave distributions in d dimensions.