Assessing the Quality of Binomial Samplers: A Statistical Distance Framework
Uddalok Sarkar, Sourav Chakraborty, and Kuldeep S. Meel

TL;DR
This paper introduces a statistical distance framework to evaluate and improve the quality of Binomial samplers, addressing approximation errors in standard implementations and enhancing the reliability of randomized algorithms.
Contribution
It provides the first rigorous analysis of Binomial sampler quality using statistical distance, deriving bounds, and proposing an interface for better control and monitoring.
Findings
Derived bounds on statistical distance for standard Binomial samplers
Enhanced APSEst model counter with improved error guarantees
Proposed interface extension for user-controlled sampling accuracy
Abstract
Randomized algorithms depend on accurate sampling from probability distributions, as their correctness and performance hinge on the quality of the generated samples. However, even for common distributions like Binomial, exact sampling is computationally challenging, leading standard library implementations to rely on heuristics. These heuristics, while efficient, suffer from approximation and system representation errors, causing deviations from the ideal distribution. Although seemingly minor, such deviations can accumulate in downstream applications requiring large-scale sampling, potentially undermining algorithmic guarantees. In this work, we propose statistical distance as a robust metric for analyzing the quality of Binomial samplers, quantifying deviations from the ideal distribution. We derive rigorous bounds on the statistical distance for standard implementations and…
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
TopicsData Management and Algorithms
