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.

Sign up for GitHub

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

Jump to bottom

Speed up with native sparse matrices #8

Open

zsunberg opened this issue Nov 18, 2018 · 1 comment

Member

zsunberg commented Nov 18, 2018

In the discretevalueiteration solver, we saw a 1-2 order of magnitude speedup from using builtin sparse matrices: https://github.com/JuliaPOMDP/DiscreteValueIteration.jl/blob/master/src/sparse.jl

It might also be possible to do this with FIB

Collaborator

dressel commented Nov 19, 2018

I agree. If anyone wants to take a hack at it, go for it. I'm a bit occupied with other things at the moment.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment