Leveraging Trust for Joint Multi-Objective and Multi-Fidelity
Optimization
- URL: http://arxiv.org/abs/2112.13901v3
- Date: Wed, 28 Jun 2023 08:43:27 GMT
- Title: Leveraging Trust for Joint Multi-Objective and Multi-Fidelity
Optimization
- Authors: Faran Irshad, Stefan Karsch and Andreas D\"opp
- Abstract summary: This paper investigates a novel approach to Bayesian multi-objective and multi-fidelity (MOMF) optimization.
We suggest the innovative use of a trust metric to support simultaneous optimization of multiple objectives and data sources.
Our methods offer broad applicability in solving simulation problems in fields such as plasma physics and fluid dynamics.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: In the pursuit of efficient optimization of expensive-to-evaluate systems,
this paper investigates a novel approach to Bayesian multi-objective and
multi-fidelity (MOMF) optimization. Traditional optimization methods, while
effective, often encounter prohibitively high costs in multi-dimensional
optimizations of one or more objectives. Multi-fidelity approaches offer
potential remedies by utilizing multiple, less costly information sources, such
as low-resolution simulations. However, integrating these two strategies
presents a significant challenge. We suggest the innovative use of a trust
metric to support simultaneous optimization of multiple objectives and data
sources. Our method modifies a multi-objective optimization policy to
incorporate the trust gain per evaluation cost as one objective in a Pareto
optimization problem, enabling simultaneous MOMF at lower costs. We present and
compare two MOMF optimization methods: a holistic approach selecting both the
input parameters and the trust parameter jointly, and a sequential approach for
benchmarking. Through benchmarks on synthetic test functions, our approach is
shown to yield significant cost reductions - up to an order of magnitude
compared to pure multi-objective optimization. Furthermore, we find that joint
optimization of the trust and objective domains outperforms addressing them in
sequential manner. We validate our results using the use case of optimizing
laser-plasma acceleration simulations, demonstrating our method's potential in
Pareto optimization of high-cost black-box functions. Implementing these
methods in existing Bayesian frameworks is simple, and they can be readily
extended to batch optimization. With their capability to handle various
continuous or discrete fidelity dimensions, our techniques offer broad
applicability in solving simulation problems in fields such as plasma physics
and fluid dynamics.
Related papers
- Unleashing the Potential of Large Language Models as Prompt Optimizers: An Analogical Analysis with Gradient-based Model Optimizers [108.72225067368592]
We propose a novel perspective to investigate the design of large language models (LLMs)-based prompts.
We identify two pivotal factors in model parameter learning: update direction and update method.
In particular, we borrow the theoretical framework and learning methods from gradient-based optimization to design improved strategies.
arXiv Detail & Related papers (2024-02-27T15:05:32Z) - MORL-Prompt: An Empirical Analysis of Multi-Objective Reinforcement
Learning for Discrete Prompt Optimization [49.60729578316884]
RL-based techniques can be used to search for prompts that maximize a set of user-specified reward functions.
Current techniques focus on maximizing the average of reward functions, which does not necessarily lead to prompts that achieve balance across rewards.
In this paper, we adapt several techniques for multi-objective optimization to RL-based discrete prompt optimization.
arXiv Detail & Related papers (2024-02-18T21:25:09Z) - End-to-End Learning for Fair Multiobjective Optimization Under
Uncertainty [55.04219793298687]
The Predict-Then-Forecast (PtO) paradigm in machine learning aims to maximize downstream decision quality.
This paper extends the PtO methodology to optimization problems with nondifferentiable Ordered Weighted Averaging (OWA) objectives.
It shows how optimization of OWA functions can be effectively integrated with parametric prediction for fair and robust optimization under uncertainty.
arXiv Detail & Related papers (2024-02-12T16:33:35Z) - Evolutionary Solution Adaption for Multi-Objective Metal Cutting Process
Optimization [59.45414406974091]
We introduce a framework for system flexibility that allows us to study the ability of an algorithm to transfer solutions from previous optimization tasks.
We study the flexibility of NSGA-II, which we extend by two variants: 1) varying goals, that optimize solutions for two tasks simultaneously to obtain in-between source solutions expected to be more adaptable, and 2) active-inactive genotype, that accommodates different possibilities that can be activated or deactivated.
Results show that adaption with standard NSGA-II greatly reduces the number of evaluations required for optimization to a target goal, while the proposed variants further improve the adaption costs.
arXiv Detail & Related papers (2023-05-31T12:07:50Z) - An Empirical Evaluation of Zeroth-Order Optimization Methods on
AI-driven Molecule Optimization [78.36413169647408]
We study the effectiveness of various ZO optimization methods for optimizing molecular objectives.
We show the advantages of ZO sign-based gradient descent (ZO-signGD)
We demonstrate the potential effectiveness of ZO optimization methods on widely used benchmark tasks from the Guacamol suite.
arXiv Detail & Related papers (2022-10-27T01:58:10Z) - Multi-objective and multi-fidelity Bayesian optimization of laser-plasma
acceleration [0.0]
We present first results on multi-objective optimization of a simulated laser-plasma accelerator.
We find that multi-objective optimization is equal or even superior in performance to its single-objective counterparts.
We significantly reduce the computational costs of the optimization by choosing the resolution and box size of the simulations dynamically.
arXiv Detail & Related papers (2022-10-07T12:09:09Z) - Uncertainty-Aware Search Framework for Multi-Objective Bayesian
Optimization [40.40632890861706]
We consider the problem of multi-objective (MO) blackbox optimization using expensive function evaluations.
We propose a novel uncertainty-aware search framework referred to as USeMO to efficiently select the sequence of inputs for evaluation.
arXiv Detail & Related papers (2022-04-12T16:50:48Z) - A Robust Multi-Objective Bayesian Optimization Framework Considering
Input Uncertainty [0.0]
In real-life applications like engineering design, the designer often wants to take multiple objectives as well as input uncertainty into account.
We introduce a novel Bayesian optimization framework to efficiently perform multi-objective optimization considering input uncertainty.
arXiv Detail & Related papers (2022-02-25T17:45:26Z) - Multi-Fidelity Multi-Objective Bayesian Optimization: An Output Space
Entropy Search Approach [44.25245545568633]
We study the novel problem of blackbox optimization of multiple objectives via multi-fidelity function evaluations.
Our experiments on several synthetic and real-world benchmark problems show that MF-OSEMO, with both approximations, significantly improves over the state-of-the-art single-fidelity algorithms.
arXiv Detail & Related papers (2020-11-02T06:59:04Z) - Multi-Fidelity Bayesian Optimization via Deep Neural Networks [19.699020509495437]
In many applications, the objective function can be evaluated at multiple fidelities to enable a trade-off between the cost and accuracy.
We propose Deep Neural Network Multi-Fidelity Bayesian Optimization (DNN-MFBO) that can flexibly capture all kinds of complicated relationships between the fidelities.
We show the advantages of our method in both synthetic benchmark datasets and real-world applications in engineering design.
arXiv Detail & Related papers (2020-07-06T23:28:40Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.