Improvements to exact Boltzmann sampling using probabilistic divide-and-conquer and the recursive method
Stephen DeSalvo

TL;DR
This paper introduces an improved exact sampling method for discrete distributions by combining Boltzmann sampling, the recursive method, and probabilistic divide-and-conquer, broadening applicability and efficiency.
Contribution
It presents a hybrid approach that integrates Boltzmann sampling with probabilistic divide-and-conquer, enabling exact sampling for a wide class of combinatorial distributions.
Findings
Method generalizes to various combinatorial distributions
Explicit examples demonstrate broad applicability
Achieves exact sampling with improved efficiency
Abstract
We demonstrate an approach for exact sampling of certain discrete combinatorial distributions, which is a hybrid of exact Boltzmann sampling and the recursive method, using probabilistic divide-and-conquer (PDC). The approach specializes to exact Boltzmann sampling in the trivial setting, and specializes to PDC deterministic second half in the first non-trivial application. A large class of examples is given for which this method broadly applies, and several examples are worked out explicitly.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMarkov Chains and Monte Carlo Methods · Statistical Mechanics and Entropy · Theoretical and Computational Physics
