-
Issue descriptionI have two questions/ideas regarding the Chebyshev scalarization:
Best, Johannes |
Beta Was this translation helpful? Give feedback.
Replies: 1 comment 1 reply
-
Hi Johannes,
Yes using an infeasability cost would still be necessary because the values are not necessarily strictly positive (in fact they will typically be negative for maximization in the current implementation). Note: you may want to pass only the feasible Y values values to
If you want to minimize a quadratic/absolute distance to a specific point, why not just write a custom function to do this? Call this
This entire objective can be passed to an acquisition function simply by making it a I'm don't think we should overload the functionality of Returning to the first question. The another approach for constrained multi-objective BO would be to use feasibility weighted outputs. E.g. Apply feasiblity weighting (with an infeasible cost) to your objectives, call this
This is the technique used in https://proceedings.mlr.press/v162/daulton22a/daulton22a.pdf in Appendix F.3, in the context of robust optimization under input noise. |
Beta Was this translation helpful? Give feedback.
Hi Johannes,
Yes using an infeasability cost would still be necessary because the values are not necessarily strictly positive (in fact they will typically be negative for maximization in the current implementation). Note: you may want to pass only the feasible Y values values to
get_chebyshev_scalarization
because the normalization bounds inget_chebyshev_scalarization
are defined to adequately cover the Pareto frontier and in the constrained case, we are generally only interested in the feasible Pareto frontier.