BriefGPT.xyz
Jun, 2024
分散合并马尔可夫链蒙特卡洛扩散生成模型
Diffusion Generative Modelling for Divide-and-Conquer MCMC
HTML
PDF
C. Trojan, P. Fearnhead, C. Nemeth
TL;DR
使用扩散生成建模方法拟合子后验分布的密度近似,以更高效地解决合并问题,并且在高维问题上比现有的密度估计方法性能更好。
Abstract
divide-and-conquer mcmc
is a strategy for
parallelising markov chain monte carlo sampling
by running independent samplers on disjoint subsets of a dataset and merging their output. An ongoing challenge in the lit
→