Skip to content
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

Add Wang 2002 example #1489

Merged
merged 1 commit into from
Oct 13, 2023
Merged

Add Wang 2002 example #1489

merged 1 commit into from
Oct 13, 2023

Conversation

mstimberg
Copy link
Member

This is a reasonably fast implementation of Wang (2002), Probabilistic Decision Making by Slow Reverberation in Cortical Circuits, which many people are interested in (see e.g. this discussion on the forum. This example is particularly interesting, because the most straightforward implementation of the NMDA synapses – ignoring the special all-to-all connectivity structure with identical weights within subpopulations – will be very slow.

Actually, optimizing this model (which was mostly written by @wklausito) made me realize that for a model like this, C++ standalone now spends most of its time in creating random numbers (#1483). In C++ standalone, we are still using an old Mersenne-Twister implementation, whereas numpy has switched to more efficient RNGs by default.

Co-authored-by: Klaus Wimmer <kwimmer@crm.cat>
@mstimberg mstimberg merged commit 8611aa5 into master Oct 13, 2023
48 checks passed
@mstimberg mstimberg deleted the Wang_2002 branch October 13, 2023 15:06
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

1 participant