Optimize pseudo_inverse_stacked performance: fix double AAt computation and eigenvalue calculation#123
Open
wilczman wants to merge 1 commit intoibs-lab:mainfrom
Open
Conversation
…in pseudo_inverse_stacked - Remove duplicate AAt matrix multiplication (lines 37-38) - Replace full eigendecomposition with matrix 2-norm for largest eigenvalue - Expected improved performance (for me it was 20%-40% less time for computation).
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Summary
Fixes two major performance bottlenecks in
pseudo_inverse_stacked()that impact computation time for medium to large matrices.Changes
AAt = Adot.values @ Adot.values.Ton lines 37-38np.linalg.eig(AAt)[0][0].real→np.linalg.norm(AAt, ord=2)Related Issues
Addresses performance concerns with large sensitivity matrices in inverse problem solving.