Maintaining Discrete Probability Distributions in Practice
Daniel Allendorf

TL;DR
This paper introduces a simple, efficient data structure for maintaining and sampling from dynamic discrete probability distributions, outperforming existing solutions in speed and flexibility.
Contribution
The paper presents a new data structure that allows for fast updates and sampling in dynamic discrete distributions, improving over traditional Alias Table methods.
Findings
Construction time is O(n)
Expected sampling time is O(1)
Update time is proportional to the change relative to total weight
Abstract
A classical problem in random number generation is the sampling of elements from a given discrete distribution. Formally, given a set of indices and sequence of weights , the task is to provide samples from with distribution where . A commonly accepted solution is Walker's Alias Table, which allows for each sample to be drawn in constant time. However, some applications correspond to a dynamic setting, where elements are inserted or removed, or weights change over time. Here, the Alias Table is not efficient, as it needs to be re-built whenever the underlying distribution changes. In this paper, we engineer a simple data structure for maintaining discrete probability distributions in the dynamic setting. Construction of the data structure is possible in time , sampling is possible in…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · Chaos-based Image/Signal Encryption · Music and Audio Processing
