English
Related papers

Related papers: Faster Computation of Expected Hypervolume Improve…

200 papers

In the field of multi-objective optimization algorithms, multi-objective Bayesian Global Optimization (MOBGO) is an important branch, in addition to evolutionary multi-objective optimization algorithms (EMOAs). MOBGO utilizes Gaussian…

Machine Learning · Computer Science 2019-06-14 Kaifeng Yang , Michael Emmerich , André Deutz , Thomas Bäck

In multi-objective Bayesian optimization and surrogate-based evolutionary algorithms, Expected HyperVolume Improvement (EHVI) is widely used as the acquisition function to guide the search approaching the Pareto front. This paper focuses on…

Machine Learning · Statistics 2019-01-25 Guang Zhao , Raymundo Arroyave , Xiaoning Qian

Hypervolume improvement (HVI) is commonly employed in multi-objective Bayesian optimization algorithms to define acquisition functions due to its Pareto-compliant property. Rather than focusing on specific statistical moments of HVI, this…

Machine Learning · Computer Science 2024-05-07 Hao Wang , Kaifeng Yang , Michael Affenzeller

In many real-world scenarios, decision makers seek to efficiently optimize multiple competing objectives in a sample-efficient fashion. Multi-objective Bayesian optimization (BO) is a common approach, but many of the best-performing…

Machine Learning · Statistics 2020-11-12 Samuel Daulton , Maximilian Balandat , Eytan Bakshy

In this article, we present a framework for taking into account user preferences in multi-objective Bayesian optimization in the case where the objectives are expensive-to-evaluate black-box functions. A novel expected improvement criterion…

Optimization and Control · Mathematics 2018-09-17 Paul Feliot , Julien Bect , Emmanuel Vazquez

Many methods for performing multi-objective optimisation of computationally expensive problems have been proposed recently. Typically, a probabilistic surrogate for each objective is constructed from an initial dataset. The surrogates can…

Machine Learning · Computer Science 2022-06-17 Alma Rahat , Tinkle Chugh , Jonathan Fieldsend , Richard Allmendinger , Kaisa Miettinen

Optimizing multiple competing objectives is a common problem across science and industry. The inherent inextricable trade-off between those objectives leads one to the task of exploring their Pareto front. A meaningful quantity for the…

Machine Learning · Computer Science 2023-10-24 Jim Boelrijk , Bernd Ensing , Patrick Forré

This paper studies preference-shaped expected improvement criteria for Bayesian multiobjective optimization. We consider two indicator families which are often used for similar algorithmic purposes, but which are geometrically different.…

Optimization and Control · Mathematics 2026-05-29 Michael T. M. Emmerich

Optimizing multiple competing black-box objectives is a challenging problem in many fields, including science, engineering, and machine learning. Multi-objective Bayesian optimization (MOBO) is a sample-efficient approach for identifying…

Machine Learning · Computer Science 2021-10-28 Samuel Daulton , Maximilian Balandat , Eytan Bakshy

Hypervolume (HV)-based Bayesian optimization (BO) is one of the standard approaches for multi-objective decision-making. However, the computational cost of optimizing the acquisition function remains a significant bottleneck, primarily due…

Machine Learning · Computer Science 2025-12-08 Shuhei Watanabe

We present a multi-objective Bayesian optimisation algorithm that allows the user to express preference-order constraints on the objectives of the type "objective A is more important than objective B". These preferences are defined based on…

Machine Learning · Computer Science 2019-11-14 Majid Abdolshah , Alistair Shilton , Santu Rana , Sunil Gupta , Svetha Venkatesh

In this paper, we present a significant improvement of Quick Hypervolume algorithm, one of the state-of-the-art algorithms for calculating exact hypervolume of the space dominated by a set of d-dimensional points. This value is often used…

Neural and Evolutionary Computing · Computer Science 2017-08-14 Andrzej Jaszkiewicz

Single-objective black box optimization (also known as zeroth-order optimization) is the process of minimizing a scalar objective $f(x)$, given evaluations at adaptively chosen inputs $x$. In this paper, we consider multi-objective…

Machine Learning · Computer Science 2020-06-11 Daniel Golovin , Qiuyi Zhang

Many optimization problems arising in applications have to consider several objective functions at the same time. Evolutionary algorithms seem to be a very natural choice for dealing with multi-objective problems as the population of such…

Neural and Evolutionary Computing · Computer Science 2013-09-17 Tobias Friedrich , Frank Neumann , Christian Thyssen

Bayesian optimization (BO) algorithm is very popular for solving low-dimensional expensive optimization problems. Extending Bayesian optimization to high dimension is a meaningful but challenging task. One of the major challenges is that it…

Machine Learning · Computer Science 2025-01-13 Dawei Zhan

The hypervolume indicator is one of the most used set-quality indicators for the assessment of stochastic multiobjective optimizers, as well as for selection in evolutionary multiobjective optimization algorithms. Its theoretical properties…

Data Structures and Algorithms · Computer Science 2022-04-14 Andreia P. Guerreiro , Carlos M. Fonseca , Luís Paquete

Surrogate-based optimization relies on so-called infill criteria (acquisition functions) to decide which point to evaluate next. When Kriging is used as the surrogate model of choice (also called Bayesian optimization), one of the most…

Neural and Evolutionary Computing · Computer Science 2020-02-18 Frederik Rehbach , Martin Zaefferer , Boris Naujoks , Thomas Bartz-Beielstein

Bayesian optimization (BO) protocol based on Active Learning (AL) principles has garnered significant attention due to its ability to optimize black-box objective functions efficiently. This capability is a prerequisite for guiding…

Chemical Physics · Physics 2024-08-07 Osman Mamun , Markus Bause , Bhuiyan Shameem Mahmud Ebna Hai

Evolutionary algorithms (EAs) are the preferred method for solving black-box multi-objective optimization problems, but when gradients of the objective functions are available, it is not straightforward to exploit these efficiently. By…

Optimization and Control · Mathematics 2021-02-23 Timo M. Deist , Stefanus C. Maree , Tanja Alderliesten , Peter A. N. Bosman

Design optimization under uncertainty is notoriously difficult when the objective function is expensive to evaluate. State-of-the-art techniques, e.g, stochastic optimization or sampling average approximation, fail to learn exploitable…

Optimization and Control · Mathematics 2019-06-20 Piyush Pandita , Ilias Bilionis , Jitesh Panchal
‹ Prev 1 2 3 10 Next ›