This article considers the use of Bayesian optimization to identify robust solutions, where robust means having a high expected performance given disturbances over the decision variables and independent noise in the output. A variant of the well-known knowledge gradient acquisition function is proposed specifically to search for robust solutions, with analytic expressions for uniformly and normally distributed disturbances. An empirical evaluation on a number of test problems demonstrates that the new acquisition function outperforms alternative approaches
International audienceOptimization problems where the objective and constraint functions take minute...
We consider the problem of selecting the best of a finite but very large set of alternatives. Each a...
In this dissertation, it is shown how pattern recognition approaches developed in computer science c...
This article considers the use of Bayesian optimization to identify robust solutions, where robust m...
This article considers the use of Bayesian optimization to identify robust solutions, where robust m...
Bayesian optimization is a powerful collection of methods for optimizing stochastic expensive black ...
A new acquisition function is proposed for solving robust optimization problems via Bayesian Optimiz...
We propose a novel, theoretically-grounded, acquisition function for batch Bayesian optimisation inf...
Abstract. We extend the concept of the correlated knowledge-gradient policy for ranking and selectio...
Slides presented at the PGMO Days 2019, held the 3rd and 4th December 2019 at EDF Lab Paris-Saclay. ...
We consider the problem of robust optimization within the well-established Bayesian Optimization (BO...
Policy gradient methods are reinforcement learning algorithms that adapt a parameterized policy by f...
Tuning hyperparameters of machine learning models is important for their performance. Bayesian optim...
Bayesian optimization forms a set of powerful tools that allows efficient blackbox optimization and...
AbstractWe analyze the robustness of a knowledge gradient (KG) policy for the multi-armed bandit pro...
International audienceOptimization problems where the objective and constraint functions take minute...
We consider the problem of selecting the best of a finite but very large set of alternatives. Each a...
In this dissertation, it is shown how pattern recognition approaches developed in computer science c...
This article considers the use of Bayesian optimization to identify robust solutions, where robust m...
This article considers the use of Bayesian optimization to identify robust solutions, where robust m...
Bayesian optimization is a powerful collection of methods for optimizing stochastic expensive black ...
A new acquisition function is proposed for solving robust optimization problems via Bayesian Optimiz...
We propose a novel, theoretically-grounded, acquisition function for batch Bayesian optimisation inf...
Abstract. We extend the concept of the correlated knowledge-gradient policy for ranking and selectio...
Slides presented at the PGMO Days 2019, held the 3rd and 4th December 2019 at EDF Lab Paris-Saclay. ...
We consider the problem of robust optimization within the well-established Bayesian Optimization (BO...
Policy gradient methods are reinforcement learning algorithms that adapt a parameterized policy by f...
Tuning hyperparameters of machine learning models is important for their performance. Bayesian optim...
Bayesian optimization forms a set of powerful tools that allows efficient blackbox optimization and...
AbstractWe analyze the robustness of a knowledge gradient (KG) policy for the multi-armed bandit pro...
International audienceOptimization problems where the objective and constraint functions take minute...
We consider the problem of selecting the best of a finite but very large set of alternatives. Each a...
In this dissertation, it is shown how pattern recognition approaches developed in computer science c...