-
Notifications
You must be signed in to change notification settings - Fork 314
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
[Feature Request] Optimization over high-dim discrete / combinatorial search spaces #477
Comments
This is a combinatorial optimization problem, for which many of our current models / optimization approaches are not well suited. Specifically, under the hood we by perform a continuous relaxation of the integer parameters and optimize in that relaxed space using gradient-based optimization (this is where EHVI shines in more conventional problems with continuous parameters). As a result, the optimizer often ends up re-evaluating the same point, which likely results in the poor performance you're seeing. For problems like this one generally wants to use alternative modeling and, more importantly, optimization approaches. @dme65 and @sdaulton have been working on related problems, we plan to eventually make these available in Ax as well. |
@Balandat Thank you for your response. I understand that the performance degradation can be expected when I apply EHVI to the combinatorial optimization including the knapsack problem. I'm looking forward to new models/optimization methods for the problem. Can I close this issue since my question was answered. Or, should I keep it open as a tracker of the feature request? |
Feel free to leave it open. I'll rename it to make it more clear that this is a feature request. |
We will now be tracking wishlist items / feature requests in a master issue for improved visibility: #566. Of course please feel free to still open new feature requests issues; we'll take care of thinking them through and adding them to the master issue. |
Putting this back on the wishlist for now, but we are planning to open-source models for this in the long-term |
Thank you for the great library!
I'm new to Ax and trying it with simple benchmark functions. I found that the EHVI might be less effective than simple Sobol sampling when I test it with the multi-objective knapsack problem. As can be seen in the following plots, EHVI found fewer solutions. In addition, it tended to violate the constraints (objective1 < 479 and objective2 < 545) and tried to maximize the objectives.
I'm not sure, but this is partly because EHVI-based method sample the same points multiple times, and partly because it samples infeasible region. It samples
-1
while the range of the parameters is 0 or 1 as follows:Parameter definition:
Log message:
I'm wondering whether it was expected behavior or I configured the EHVI wrongly. Here's a notebook to reproduce the experiment. Could you give me any comments about it?
The text was updated successfully, but these errors were encountered: