arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2303.02714cs.DC
收藏

精确分布抽样

Exact Distributed Sampling

Sriram V. Pemmaraju, Joshua Z. Sobel

摘要:

输出约束满足问题(如极大独立集)可行解的快速分布式算法已得到大量研究。对分布式采样问题的研究要少得多,其中人们希望从所有可行解的分布中采样(例如,对可行解进行均匀采样)。最近的工作(Feng,Sun,Yin PODC 2017; Fischer和Ghaffari DISC 2018; Feng,Hayes和Yin arXiv 2018)表明,对于一些约束满足问题,在分布式计算的经典模型中,存在混合在$O(\log n)$轮中的分布式马尔可夫链。然而,这些方法从接近所需分布的分布返回样本,但具有一些少量的误差。本文主要研究精确分布抽样问题。我们的主要贡献是表明,这些分布式马尔可夫链串联技术从顺序设置,即耦合从过去和边界链,可以用来设计$O(\log n)$轮模型精确抽样算法的一类加权局部约束满足问题。该一般结果导致$O(\log n)$ -使用小消息(即,在CONGEST模型中运行)和多项式时间局部计算的一些重要的特殊情况下,如采样加权独立集(又名硬核模型)和加权支配集。

英文摘要:

Fast distributed algorithms that output a feasible solution for constraint satisfaction problems, such as maximal independent sets, have been heavily studied. There has been much less research on distributed sampling problems, where one wants to sample from a distribution over all feasible solutions (e.g., uniformly sampling a feasible solution). Recent work (Feng, Sun, Yin PODC 2017; Fischer and Ghaffari DISC 2018; Feng, Hayes, and Yin arXiv 2018) has shown that for some constraint satisfaction problems there are distributed Markov chains that mix in $O(\log n)$ rounds in the classical LOCAL model of distributed computation. However, these methods return samples from a distribution close to the desired distribution, but with some small amount of error. In this paper, we focus on the problem of exact distributed sampling. Our main contribution is to show that these distributed Markov chains in tandem with techniques from the sequential setting, namely coupling from the past and bounding chains, can be used to design $O(\log n)$-round LOCAL model exact sampling algorithms for a class of weighted local constraint satisfaction problems. This general result leads to $O(\log n)$-round exact sampling algorithms that use small messages (i.e., run in the CONGEST model) and polynomial-time local computation for some important special cases, such as sampling weighted independent sets (aka the hardcore model) and weighted dominating sets.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑