Skip to content
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

Evaluate oracle at target task and fidelity #2727

Closed
wants to merge 2 commits into from

Conversation

esantorella
Copy link
Contributor

Summary:
BenchmarkRunner.evaluate_oracle now evaluates at the target task and fidelity.

A weakness of this solution is that it requires passing the search space to the runner. Generally, there is too much information that must be on both the problem and the runner; this could be addressed by making the problem an attribute of the runner rather than the other way around.

Reviewed By: sdaulton

Differential Revision: D61884295

esantorella and others added 2 commits August 29, 2024 12:10
…bjective_problem_from_botorch; support constrained MOO (facebook#2722)

Summary:
Pull Request resolved: facebook#2722

Context: These functions have a lot of overlapping functionality. Combining them makes it easier to extend their functionality (for example, by supporting constrained MOO).

This PR:
* Combines `create_single_problem_objective_from_botorch` and `create_multi_objective_problem_from_botorch` into `create_problem_from_botorch`
* Reads `lower_is_better` off the test problem -- BoTorch test problems assume minimization unless `negate` is set to True -- instead of requiring the user to pass it (multi-objective problems used to always have lower_is_better=True, so this is more accurate and prevents mismatch)
* Adds support for constrained MOO problems from Botorch
* Remove stub for constrained MOO problem that only existed to test for an exception that is no longer raised

Differential Revision: D61877865

Reviewed By: Balandat
Summary:
`BenchmarkRunner.evaluate_oracle` now evaluates at the target task and fidelity.

A weakness of this solution is that it requires passing the search space to the runner. Generally, there is too much information that must be on both the problem and the runner; this could be addressed by making the problem an attribute of the runner rather than the other way around.

Reviewed By: sdaulton

Differential Revision: D61884295
@facebook-github-bot facebook-github-bot added the CLA Signed Do not delete this pull request or issue due to inactivity. label Aug 29, 2024
@facebook-github-bot
Copy link
Contributor

This pull request was exported from Phabricator. Differential Revision: D61884295

@codecov-commenter
Copy link

Codecov Report

All modified and coverable lines are covered by tests ✅

Project coverage is 95.41%. Comparing base (5d91216) to head (f4cb63e).

Additional details and impacted files
@@            Coverage Diff             @@
##             main    #2727      +/-   ##
==========================================
+ Coverage   95.40%   95.41%   +0.01%     
==========================================
  Files         490      490              
  Lines       47828    47857      +29     
==========================================
+ Hits        45631    45664      +33     
+ Misses       2197     2193       -4     

☔ View full report in Codecov by Sentry.
📢 Have feedback on the report? Share it here.

@facebook-github-bot
Copy link
Contributor

This pull request has been merged in 9106255.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
CLA Signed Do not delete this pull request or issue due to inactivity. fb-exported Merged
Projects
None yet
Development

Successfully merging this pull request may close these issues.

3 participants