-
-
Notifications
You must be signed in to change notification settings - Fork 25.9k
Implement make_sparse_spd_matrix
using a sparse memory layout from the start
#27433
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
Can I try this one? |
That'd be nice @Charlie-XIAO |
Surprisingly, this function does not seem to be tested at all (if I have not missed anything). |
/take |
It's implicitly used in |
True, I'm also seeing those from the CI. It is, however, tricky to test its parameters which I explained in the linked PR. |
Sorry, @Charlie-XIAO, I have overseen that you've already addressed that with the PR. |
Please don't apologize @StefanieSenger, that doesn't matter at all. I just wanted to say that if you are interested, you can look at my analysis in that PR. In fact I have just seen that CI is complaining about |
@ogrisel I think we can close this one. Sorry that I forgot to write |
Uh oh!
There was an error while loading. Please reload this page.
Describe the workflow you want to enable
As discussed in #27359,
make_sparse_spd_matrix
actually returns a dense numpy array (with many zero values).I think it should be possible to rewrite this code to compose operations on sparse arrays/matrices from the start instead of allocating large dense square matrices.
I have not tried myself, but I think it should be doable and it should be much more memory efficient.
The text was updated successfully, but these errors were encountered: