Fast Computation of the Multi-Points Expected Improvement with Applications in Batch Selection. Chevalier, C. & Ginsbourger, D. In Nicosia, G. & Pardalos, P., editors, Learning and Intelligent Optimization, pages 59–69, Berlin, Heidelberg, 2013. Springer Berlin Heidelberg. abstract bibtex The Multi-points Expected Improvement criterion (or $}{$q$}{$-EI) has recently been studied in batch-sequential Bayesian Optimization. This paper deals with a new way of computing $}{$q$}{$-EI, without using Monte-Carlo simulations, through a closed-form formula. The latter allows a very fast computation of $}{$q$}{$-EI for reasonably low values of $}{$q$}{$(typically, less than 10). New parallel kriging-based optimization strategies, tested on different toy examples, show promising results.
@InProceedings{1Chevalier2013,
author = {Chevalier, Cl{\'e}ment and Ginsbourger, David},
title = {Fast Computation of the Multi-Points Expected Improvement with Applications in Batch Selection},
address = {Berlin, Heidelberg},
booktitle = {Learning and Intelligent Optimization},
editor = {Nicosia, Giuseppe and Pardalos, Panos},
isbn = {978-3-642-44973-4},
pages = {59--69},
publisher = {Springer Berlin Heidelberg},
year = {2013},
abstract = {The Multi-points Expected Improvement criterion (or {\$}{\$}q{\$}{\$}-EI) has recently been studied in batch-sequential Bayesian Optimization. This paper deals with a new way of computing {\$}{\$}q{\$}{\$}-EI, without using Monte-Carlo simulations, through a closed-form formula. The latter allows a very fast computation of {\$}{\$}q{\$}{\$}-EI for reasonably low values of {\$}{\$}q{\$}{\$}(typically, less than 10). New parallel kriging-based optimization strategies, tested on different toy examples, show promising results.}
}
Downloads: 0
{"_id":"Br3i6TkZwdqFrwbLC","bibbaseid":"chevalier-ginsbourger-fastcomputationofthemultipointsexpectedimprovementwithapplicationsinbatchselection-2013","author_short":["Chevalier, C.","Ginsbourger, D."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"propositions":[],"lastnames":["Chevalier"],"firstnames":["Clément"],"suffixes":[]},{"propositions":[],"lastnames":["Ginsbourger"],"firstnames":["David"],"suffixes":[]}],"title":"Fast Computation of the Multi-Points Expected Improvement with Applications in Batch Selection","address":"Berlin, Heidelberg","booktitle":"Learning and Intelligent Optimization","editor":[{"propositions":[],"lastnames":["Nicosia"],"firstnames":["Giuseppe"],"suffixes":[]},{"propositions":[],"lastnames":["Pardalos"],"firstnames":["Panos"],"suffixes":[]}],"isbn":"978-3-642-44973-4","pages":"59–69","publisher":"Springer Berlin Heidelberg","year":"2013","abstract":"The Multi-points Expected Improvement criterion (or $}{$q$}{$-EI) has recently been studied in batch-sequential Bayesian Optimization. This paper deals with a new way of computing $}{$q$}{$-EI, without using Monte-Carlo simulations, through a closed-form formula. The latter allows a very fast computation of $}{$q$}{$-EI for reasonably low values of $}{$q$}{$(typically, less than 10). New parallel kriging-based optimization strategies, tested on different toy examples, show promising results.","bibtex":"@InProceedings{1Chevalier2013,\n author = {Chevalier, Cl{\\'e}ment and Ginsbourger, David},\n title = {Fast Computation of the Multi-Points Expected Improvement with Applications in Batch Selection},\n address = {Berlin, Heidelberg},\n booktitle = {Learning and Intelligent Optimization},\n editor = {Nicosia, Giuseppe and Pardalos, Panos},\n isbn = {978-3-642-44973-4},\n pages = {59--69},\n publisher = {Springer Berlin Heidelberg},\n year = {2013},\n abstract = {The Multi-points Expected Improvement criterion (or {\\$}{\\$}q{\\$}{\\$}-EI) has recently been studied in batch-sequential Bayesian Optimization. This paper deals with a new way of computing {\\$}{\\$}q{\\$}{\\$}-EI, without using Monte-Carlo simulations, through a closed-form formula. The latter allows a very fast computation of {\\$}{\\$}q{\\$}{\\$}-EI for reasonably low values of {\\$}{\\$}q{\\$}{\\$}(typically, less than 10). New parallel kriging-based optimization strategies, tested on different toy examples, show promising results.}\n}\n\n","author_short":["Chevalier, C.","Ginsbourger, D."],"editor_short":["Nicosia, G.","Pardalos, P."],"key":"1Chevalier2013","id":"1Chevalier2013","bibbaseid":"chevalier-ginsbourger-fastcomputationofthemultipointsexpectedimprovementwithapplicationsinbatchselection-2013","role":"author","urls":{},"metadata":{"authorlinks":{}},"html":""},"bibtype":"inproceedings","biburl":"https://bibbase.org/network/files/BysjCxT6svBAknXkE","dataSources":["qAPjQpsx8e9aJNrSa","bC3rJfRcd5d7KcP8R"],"keywords":[],"search_terms":["fast","computation","multi","points","expected","improvement","applications","batch","selection","chevalier","ginsbourger"],"title":"Fast Computation of the Multi-Points Expected Improvement with Applications in Batch Selection","year":2013}