Nouvel algorithme d'optimisation bayésien utilisant une approche Monte-Carlo séquentielle.

Abstract : This thesis deals with the problem of global optimization of expensive-to-evaluate functions in a Bayesian framework. We say that a function is expensive-to-evaluate when its evaluation requires a significant amount of resources (e.g., very long numerical simulations).In this context, it is important to use optimization algorithms that can deal with a limited number of function evaluations. We consider here a Bayesian approach which consists in assigning a prior to the function, under the form of a Gaussian random process. The idea is then to choose the next evaluation points using a probabilistic criterion that indicates, conditional on the previous evaluations, the most interesting regions of the research domain for the optimizer. Two difficulties in this approach can be identified: the choice of the Gaussian process prior and the maximization of the criterion. The first problem is usually solved by using a maximum likelihood approach, which turns out to be a poorly robust method, and to which we prefer a fully Bayesian approach. The contribution of this work is the introduction of a new Bayesian optimization algorithm, which maximizes the Expected Improvement (EI) criterion, and provides an answer to both problems thanks to a Sequential Monte Carlo approach. Numerical results on benchmark tests show good performances of our algorithm compared to those of several other methods of the literature.
Document type :
Theses
Complete list of metadatas

https://tel.archives-ouvertes.fr/tel-00864700
Contributor : Abes Star <>
Submitted on : Monday, September 23, 2013 - 10:12:12 AM
Last modification on : Tuesday, April 16, 2019 - 6:16:58 AM
Long-term archiving on: Tuesday, December 24, 2013 - 4:30:32 AM

File

Benassi_Romain_These_VF.pdf
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-00864700, version 1

Collections

Citation

Romain Benassi. Nouvel algorithme d'optimisation bayésien utilisant une approche Monte-Carlo séquentielle.. Autre. Supélec, 2013. Français. ⟨NNT : 2013SUPL0011⟩. ⟨tel-00864700⟩

Share

Metrics

Record views

1269

Files downloads

2231