L-Infinity-Discrepancy Analysis Of Polynomial-Time Deterministic Samplers Emulating Rapidly Mixing Chains
COCOON(2014)
摘要
Markov chain Monte Carlo (MCMC) is a standard technique to sample from a target distribution by simulating Markov chains. In an analogous fashion to MCMC, this paper proposes a deterministic sampling algorithm based on deterministic random walk, such as the rotorrouter model (a.k.a. Propp machine). For the algorithm, we give an upper bound of the point-wise distance (i.e., infinity norm) between the "distributions" of a deterministic random walk and its corresponding Markov chain in terms of the mixing time of the Markov chain. As a result, for uniform sampling of #P-complete problems, such as 0-1 knapsack solutions, linear extensions, matchings, etc., for which rapidly mixing chains are known, our deterministic algorithm provides samples with a "distribution" with a point-wise distance at most epsilon from the target distribution, in time polynomial in the input size and epsilon(-1).
更多查看译文
关键词
rotor-router model, #P-complete, Markov chain Monte Carlo, mixing time
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络