Systematic Alias Sampling: an efficient and low-variance way to sample from a discrete distribution

September 28, 2025 Β· Declared Dead Β· πŸ› ACM Transactions on Mathematical Software

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Ilari Vallivaara, Katja PoikselkΓ€, Pauli Rikula, Juha RΓΆning arXiv ID 2509.24089 Category cs.DS: Data Structures & Algorithms Cross-listed cs.MS, cs.RO Citations 0 Venue ACM Transactions on Mathematical Software Last Checked 4 months ago
Abstract
In this paper we combine the Alias method with the concept of systematic sampling, a method commonly used in particle filters for efficient low-variance resampling. The proposed method allows very fast sampling from a discrete distribution: drawing k samples is up to an order of magnitude faster than binary search from the cumulative distribution function (cdf) or inversion methods used in many libraries. The produced empirical distribution function is evaluated using a modified CramΓ©r-Von Mises goodness-of-fit statistic, showing that the method compares very favourably to multinomial sampling. As continuous distributions can often be approximated with discrete ones, the proposed method can be used as a very general way to efficiently produce random samples for particle filter proposal distributions, e.g. for motion models in robotics.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Data Structures & Algorithms

Died the same way β€” πŸ‘» Ghosted