-
Notifications
You must be signed in to change notification settings - Fork 107
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
Refactor greedy algorithms #757
Conversation
- add weak_greedy, adaptive_weak_greedy algorithms which work on generic surrogates for the approximation error - make rb versions special instances of weak_greedy/adaptive_weak_greedy - rename rb versions to rb_greedy/rb_adaptive_greedy and deprecate old names
Codecov Report
|
Codecov Report
|
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.
I did not check the new algorithms in detail. Just a general question: why rb_adaptive_greedy
and not adaptive_rb_greedy
? It seems to me the latter would fit the other names a bit better...
I prefer |
To be more precise: It should be |
Makes sense |
In this PR,
pymor.algorithms.greedy.greedy
is refactored into aweak_greedy
function, working with an arbitrary surrogate for the greedy approximation error, and arb_greedy
function, which callsweak_greedy
with anRBSurrogate
. Similarly,adaptive_greedy
has been refactored intoadaptive_weak_greedy
andrb_adaptive_greedy
.Further changes:
greedy
andadaptive_greedy
have been deprecated.rb_greedy
, thesamples
argument has been renamed totraining_set
.A
strong_greedy
function directly working onVectorArrays
will follow in the future.getting_started.rst
still requires updating.