Nov 5, 2016 · Abstract:We propose a new algorithmic framework, called "partial rejection sampling", to draw samples exactly from a product distribution, ...

Our framework builds new connections between the variable framework of the Lovász Local Lemma and some classical sampling algorithms such as the cycle-popping ...

We propose a new algorithmic framework, called “partial rejection sampling”, to draw samples exactly from a product distribution, conditioned on none of a ...

Abstract. We propose a new algorithmic framework, called “partial rejection sampling”, to draw samples exactly from a product distribution, conditioned on ...

Abstract. We propose a new algorithmic framework, called “partial rejection sampling”, to draw samples exactly from a product distribution, conditioned on ...

Abstract. We propose a new algorithmic framework, called "partial rejection sampling", to draw samples exactly from a product distribution, conditioned on ...

Jun 6, 2017 · Uniform Sampling through the Lovász Local Lemma. Heng Guo. Berkeley, Jun 06 2017. Queen Mary, University of London. 1. Page 2. Draft: arxiv.org ...

Our framework builds new connections between the variable framework of the Lovász Local Lemma and some classical sampling algorithms such as the cycle-popping ...

We give a fast algorithm for sampling uniform solutions of general constraint satisfaction problems (CSPs) in a local lemma regime.

This is a pre-copyedited, author-produced version of an article accepted for publication in STOC 2017 Proceedings of the 49th Annual ACM SIGACT Symposium on ...