English
Related papers

Related papers: Bayesian Algorithm Execution: Estimating Computabl…

200 papers

Several scenarios require the optimization of non-convex black-box functions, that are noisy expensive to evaluate functions with unknown analytical expression, whose gradients are hence not accessible. For example, the hyper-parameter…

Machine Learning · Computer Science 2025-02-12 Eduardo C. Garrido-Merchán

We consider Bayesian optimization of an expensive-to-evaluate black-box objective function, where we also have access to cheaper approximations of the objective. In general, such approximations arise in applications such as reinforcement…

Machine Learning · Statistics 2016-11-16 Matthias Poloczek , Jialei Wang , Peter I. Frazier

Bayesian Optimization is the state of the art technique for the optimization of black boxes, i.e., functions where we do not have access to their analytical expression nor its gradients, they are expensive to evaluate and its evaluation is…

Artificial Intelligence · Computer Science 2021-01-13 Eduardo C. Garrido Merchán , Luis C. Jariego Pérez

We consider Bayesian algorithm execution (BAX), a framework for efficiently selecting evaluation points of an expensive function to infer a property of interest encoded as the output of a base algorithm. Since the base algorithm typically…

Machine Learning · Computer Science 2024-10-29 Chu Xin Cheng , Raul Astudillo , Thomas Desautels , Yisong Yue

Bayesian optimization provides an effective method to optimize expensive-to-evaluate black box functions. It has been widely applied to problems in many fields, including notably in computer science, e.g. in machine learning to optimize…

Machine Learning · Computer Science 2025-11-18 Mike Diessner , Joseph O'Connor , Andrew Wynn , Sylvain Laizet , Yu Guan , Kevin Wilson , Richard D. Whalley

Many expensive black-box optimisation problems are sensitive to their inputs. In these problems it makes more sense to locate a region of good designs, than a single-possibly fragile-optimal design. Expensive black-box functions can be…

Machine Learning · Computer Science 2021-12-16 Nicholas D. Sanders , Richard M. Everson , Jonathan E. Fieldsend , Alma A. M. Rahat

We propose an efficient transfer Bayesian optimization method, which finds the maximum of an expensive-to-evaluate black-box function by using data on related optimization tasks. Our method uses auxiliary information that represents the…

Machine Learning · Statistics 2019-09-18 Tomoharu Iwata , Takuma Otsuka

Bayesian optimization is a data-efficient technique that has been shown to be extremely powerful to optimize expensive, black-box, and possibly noisy objective functions. Many applications involve optimizing probabilities and mixtures which…

Machine Learning · Computer Science 2026-03-11 Federico Pavesi , Antonio Candelieri , Noémie Jaquier

Bayesian optimization is a powerful global optimization technique for expensive black-box functions. One of its shortcomings is that it requires auxiliary optimization of an acquisition function at each iteration. This auxiliary…

Machine Learning · Statistics 2014-02-28 Ziyu Wang , Babak Shakibi , Lin Jin , Nando de Freitas

The aim of black-box optimization is to optimize an objective function within the constraints of a given evaluation budget. In this problem, it is generally assumed that the computational cost for evaluating a point is large; thus, it is…

Machine Learning · Statistics 2019-12-03 Masahiro Nomura , Kenshi Abe

Bayesian optimisation has proven to be a powerful tool for expensive global black-box optimisation problems. In this paper, we propose new Bayesian optimisation variants of the popular Knowledge Gradient acquisition functions for problems…

Machine Learning · Computer Science 2025-12-22 Xietao Wang Lin , Juan Ungredda , Max Butler , James Town , Alma Rahat , Hemant Singh , Juergen Branke

We consider optimization of composite objective functions, i.e., of the form $f(x)=g(h(x))$, where $h$ is a black-box derivative-free expensive-to-evaluate function with vector-valued outputs, and $g$ is a cheap-to-evaluate real-valued…

Machine Learning · Statistics 2019-06-05 Raul Astudillo , Peter I. Frazier

Bayesian optimization has demonstrated impressive success in finding the optimum input x* and output f* = f(x*) = max f(x) of a black-box function f. In some applications, however, the optimum output f* is known in advance and the goal is…

Machine Learning · Statistics 2020-08-18 Vu Nguyen , Michael A. Osborne

Bayesian optimization is a popular method for solving the problem of global optimization of an expensive-to-evaluate black-box function. It relies on a probabilistic surrogate model of the objective function, upon which an acquisition…

Machine Learning · Statistics 2022-06-22 Jungtaek Kim , Seungjin Choi , Minsu Cho

In many applications, ranging from logistics to engineering, a designer is faced with a sequence of optimization tasks for which the objectives are in the form of black-box functions that are costly to evaluate. Furthermore, higher-fidelity…

Machine Learning · Computer Science 2025-01-09 Yunchuan Zhang , Sangwoo Park , Osvaldo Simeone

The optimization of expensive-to-evaluate black-box functions over combinatorial structures is an ubiquitous task in machine learning, engineering and the natural sciences. The combinatorial explosion of the search space and costly…

Machine Learning · Statistics 2018-10-11 Ricardo Baptista , Matthias Poloczek

Bayesian optimization is a methodology for global optimization of unknown and expensive objectives. It combines a surrogate Bayesian regression model with an acquisition function to decide where to evaluate the objective. Typical regression…

Machine Learning · Computer Science 2023-04-04 Afonso Eduardo , Michael U. Gutmann

Bayesian Optimization is a sample-efficient black-box optimization procedure that is typically applied to problems with a small number of independent objectives. However, in practice we often wish to optimize objectives defined over many…

Machine Learning · Computer Science 2021-10-29 Wesley J. Maddox , Maximilian Balandat , Andrew Gordon Wilson , Eytan Bakshy

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

Bayesian optimization is an effective method for finding extrema of a black-box function. We propose a new type of Bayesian optimization for learning user preferences in high-dimensional spaces. The central assumption is that the underlying…

Machine Learning · Statistics 2020-08-17 Petrus Mikkola , Milica Todorović , Jari Järvi , Patrick Rinke , Samuel Kaski
‹ Prev 1 2 3 10 Next ›