Make behavior of Cholesky caching more clear #1504
Closed
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.
Motivation
General context: Caching is confusing and can lead to subtle issues. I have been trying to understand it better in order to reduce memory usage and improve runtime, since I've been seeing cache misses and tensors persisting longer than necessary. This PR doesn't fix that, but does make things a tiny bit more transparent.
Two things are making the "_cache_root_decomposition" method harder to understand than necessary:
self._baseline_L
and returnsNone
rather than just returningbaseline_L
, so when someone sees a call to_cache_root_decomposition
they will not immediately realizeself._baseline_L
has been set.self._baseline_L
and it also invisibly uses LinearOperator's caching.This PR makes things more transparent by
baseline_L
rather than setting it as a side effectHave you read the Contributing Guidelines on pull requests?
Yes
Test Plan
Unit tests