Conversation
Part of the expected utility comes from this point, the rest from the expected probabilities of the other budget-1 points
Author
|
It also adds another example notebook |
Implemented random and uncertainty as initial examples
Now baked in to IndividualScoringQueryStrat
Found I was having to implement a "many" and "single" version in order to achieve computational efficiency. This version is less clunky
Clearer that you want "targets" than "positives"
Also fixed some flake issues
Code crashes with a useless error message when there are fewer good points available than we need to fill a batch of selections
Fix bug in MCAL Regression
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
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.
From my understanding, the current implementation of active search is missing the probability of the choice point in the effective utility. This PR changes the scoring function for active search to use the probability of the point being the positive class, which recovers the behavior such that if the budget is
1then the active search is equivalent to greedy selection.