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
Fix GraphMatch random_state behavior with n_init > 1, parallelize #770
Conversation
Deploy preview for graspologic ready! Built with commit 6c5c27c |
added a test, feel free to change it |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Think this is good to go, @asaadeldin11 you can decide whether to just leave a comment about efficiency or see if the n_jobs = 1 fix helps performance, otherwise I'm ready to merge
@asaadeldin11 somehow that broke old tests, any idea why? maybe the tests just werent that stable to initialization? Or do we think something else is going on? |
Strange, they were passing for me locally. The padded sgm test makes sense, i remove two nodes and get 48/50 match ratio, so I'll change the 1.0 to 0.95 since there's no reason to expect the isolates to match correctly. |
is there any other way to just make the problem easier? |
I can just make the similarity matrix the identity matrix, and make it an ER graph? |
Reference Issues/PRs
Closes #761
Closes #765.
What does this implement/fix? Briefly explain your changes.
Fixes bug where random_state when n_init > 1 was always the same. Also parallelizes over inits