Fast Random Integer Generation in an Interval · HackerPapers discussions

Fast Random Integer Generation in an Interval — mentioned by jart

Wed, 09 Mar 2022 21:07:00 GMT

It's Lemire's Lehmer Generator or LEMUR 64 for short https://arxiv.org/pdf/1805.10941.pdf https://archive.org/details/proceedings_of_a_second_symposiu...

Paper and discussion history. A mention is not an endorsement.

Fast Random Integer Generation in an Interval — mentioned by NWDD

Wed, 18 Aug 2021 21:29:46 GMT

For many use cases biased is good enough. The topic of unbiased bounded generation is pretty interesting itself and both lemire and M.E. O'Neill (author of pcg) wrote blog posts and an academic paper comparing different approaches (some using as building block the fixed point trick) https://www.pcg-random.org/posts/bounded-rands.html https://lemire.me/blog/2019/06/06/nearly-divisionless-random... https://arxiv.org/pdf/1805.10941.pdf

Paper and discussion history. A mention is not an endorsement.

Fast Random Integer Generation in an Interval — mentioned by Reelin

Mon, 05 Oct 2020 01:31:10 GMT

I'm a bit confused. Looking at the original paper (https://arxiv.org/pdf/1805.10941.pdf) this doesn't seem to be a RNG itself but rather a method to efficiently transform the output of a RNG onto an arbitrary interval while maintaining a uniform distribution. (This is at odds with the current title.) See in particular "Algorithm 5" which specifies retrieving a random integer on lines 1 and 7. In section 5, the authors specify that they use a linear congruential generator for their experiments. If my understanding is correct, this is an important distinction because it means you can plug…

Paper and discussion history. A mention is not an endorsement.

Fast Random Integer Generation in an Interval — mentioned by MauranKilom

Sun, 04 Oct 2020 23:25:30 GMT

After reading the intro of the article, I wanted to see whether I could get the gist of the algorithm just from looking at the first code of it that I come upon. I thus took the first such link from the article (https://arxiv.org/pdf/1805.10941.pdf) while trying to avoid any spoilers. There was no way to unsee the comment at the top of the article, but I don't think it helped much. I did skim the paper to find which of the listed algorithms is the one in question (Algorithm 5), which inevitable primed me a bit (primarily by having the context of the two other rejection sampling algorithms). I…

Paper and discussion history. A mention is not an endorsement.

Fast Random Integer Generation in an Interval — mentioned by igg

Tue, 04 Aug 2020 07:02:22 GMT

It is Julia all the way down. julia> @which randn(1000) randn(dims::Integer...) in Random at ~/Software/Julia/share/julia/stdlib/v1.5/Random/src/normal.jl:210 julia> @edit randn(1000) # Opens the normal.jl file in your editor julia> @run randn(1000) # Starts the debugger in VSCode Digging deeper, at least one of the PRs [1] is based on a 2018 paper [2] [1] https://github.com/JuliaLang/julia/pull/29240 [2] https://arxiv.org/abs/1805.10941

Paper and discussion history. A mention is not an endorsement.

Fast Random Integer Generation in an Interval — mentioned by caf

Fri, 13 Sep 2019 14:25:14 GMT

This appears to be the state of the art in minimising the resampling cost: https://arxiv.org/pdf/1805.10941.pdf

Paper and discussion history. A mention is not an endorsement.

Fast Random Integer Generation in an Interval — HN submission

Mon, 25 Mar 2019 13:23:57 GMT

Fast Random Integer Generation in an Interval

1 point; 0 discussion replies on HN. Paper and source history. A submission is not an endorsement.

Fast Random Integer Generation in an Interval — HN submission

Wed, 30 May 2018 08:00:57 GMT

Fast Random Integer Generation in an Interval

2 points; 0 discussion replies on HN. Paper and source history. A submission is not an endorsement.