-
-
Notifications
You must be signed in to change notification settings - Fork 2.1k
Speed up random method for Multinominal #2811
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Comments
Or, if you have some experience with |
Ah cool! Why is that PR not merged? |
I think the ball is in |
@junpenglao @ColCarroll Are we going to implement this at the pymc3 end? |
I would vote to leave the code as is, unless the numpy implementation gets a speedup: I am not sure of a case where multinomial sampling is the bottleneck, such that the added complexity of implementing something on our side is worth it. |
What is there to be done here? Replacing the np.random.choice with Radim's suggestion? |
I am going to just close (feel free to reopen if disagree!) I doubt this is the bottleneck for anyone's analysis, and implementing radim's makes the code less readable, and means we would not get automatic speedups if/when changes are merged upstream (though still no word on the numpy pr). |
Come across these two tweets, which might allow us to improve the speed of Multinominal random:
https://twitter.com/jeremyphoward/status/954871616277655552
https://twitter.com/RadimRehurek/status/928671225861296128
The text was updated successfully, but these errors were encountered: