Multifidelity Bayesian Optimization for Binomial Output

The key idea of Bayesian optimization is replacing an expensive target function with a cheap surrogate model. By selection of an acquisition function for Bayesian optimization, we trade off between exploration and exploitation. The acquisition function typically depends on the mean and the variance...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Matyushin, Leonid, Zaytsev, Alexey, Alenkin, Oleg, Ustuzhanin, Andrey
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Matyushin, Leonid
Zaytsev, Alexey
Alenkin, Oleg
Ustuzhanin, Andrey
description The key idea of Bayesian optimization is replacing an expensive target function with a cheap surrogate model. By selection of an acquisition function for Bayesian optimization, we trade off between exploration and exploitation. The acquisition function typically depends on the mean and the variance of the surrogate model at a given point. The most common Gaussian process-based surrogate model assumes that the target with fixed parameters is a realization of a Gaussian process. However, often the target function doesn't satisfy this approximation. Here we consider target functions that come from the binomial distribution with the parameter that depends on inputs. Typically we can vary how many Bernoulli samples we obtain during each evaluation. We propose a general Gaussian process model that takes into account Bernoulli outputs. To make things work we consider a simple acquisition function based on Expected Improvement and a heuristic strategy to choose the number of samples at each point thus taking into account precision of the obtained output.
doi_str_mv 10.48550/arxiv.1902.06937
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1902_06937</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1902_06937</sourcerecordid><originalsourceid>FETCH-LOGICAL-a677-a3ef51b4d3c5eb04f884235ca252c41befc7dd89f0069ee3acf5ab2c4dde1453</originalsourceid><addsrcrecordid>eNotj71qwzAURrVkKEkfoFP1AnYlS4rssQltUkjw0O7mWrqCC_7DkUudp89fp2848HEOYy9SpDo3RrzB-Ee_qSxElop1oewTs8epiRTIY0Nx5huY8UTQ8XKI1NIZIvUdD_3IN9T1LUHDyykOU1yxRYDmhM__u2Tfnx8_231yKHdf2_dDAmtrE1AYjKy1V85gLXTIc50p4yAzmdOyxuCs93kRxFUHUYELBuor8h6lNmrJXh-vd_FqGKmFca5uAdU9QF0As4FB5Q</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Multifidelity Bayesian Optimization for Binomial Output</title><source>arXiv.org</source><creator>Matyushin, Leonid ; Zaytsev, Alexey ; Alenkin, Oleg ; Ustuzhanin, Andrey</creator><creatorcontrib>Matyushin, Leonid ; Zaytsev, Alexey ; Alenkin, Oleg ; Ustuzhanin, Andrey</creatorcontrib><description>The key idea of Bayesian optimization is replacing an expensive target function with a cheap surrogate model. By selection of an acquisition function for Bayesian optimization, we trade off between exploration and exploitation. The acquisition function typically depends on the mean and the variance of the surrogate model at a given point. The most common Gaussian process-based surrogate model assumes that the target with fixed parameters is a realization of a Gaussian process. However, often the target function doesn't satisfy this approximation. Here we consider target functions that come from the binomial distribution with the parameter that depends on inputs. Typically we can vary how many Bernoulli samples we obtain during each evaluation. We propose a general Gaussian process model that takes into account Bernoulli outputs. To make things work we consider a simple acquisition function based on Expected Improvement and a heuristic strategy to choose the number of samples at each point thus taking into account precision of the obtained output.</description><identifier>DOI: 10.48550/arxiv.1902.06937</identifier><language>eng</language><subject>Computer Science - Learning ; Statistics - Machine Learning</subject><creationdate>2019-02</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1902.06937$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1902.06937$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Matyushin, Leonid</creatorcontrib><creatorcontrib>Zaytsev, Alexey</creatorcontrib><creatorcontrib>Alenkin, Oleg</creatorcontrib><creatorcontrib>Ustuzhanin, Andrey</creatorcontrib><title>Multifidelity Bayesian Optimization for Binomial Output</title><description>The key idea of Bayesian optimization is replacing an expensive target function with a cheap surrogate model. By selection of an acquisition function for Bayesian optimization, we trade off between exploration and exploitation. The acquisition function typically depends on the mean and the variance of the surrogate model at a given point. The most common Gaussian process-based surrogate model assumes that the target with fixed parameters is a realization of a Gaussian process. However, often the target function doesn't satisfy this approximation. Here we consider target functions that come from the binomial distribution with the parameter that depends on inputs. Typically we can vary how many Bernoulli samples we obtain during each evaluation. We propose a general Gaussian process model that takes into account Bernoulli outputs. To make things work we consider a simple acquisition function based on Expected Improvement and a heuristic strategy to choose the number of samples at each point thus taking into account precision of the obtained output.</description><subject>Computer Science - Learning</subject><subject>Statistics - Machine Learning</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj71qwzAURrVkKEkfoFP1AnYlS4rssQltUkjw0O7mWrqCC_7DkUudp89fp2848HEOYy9SpDo3RrzB-Ee_qSxElop1oewTs8epiRTIY0Nx5huY8UTQ8XKI1NIZIvUdD_3IN9T1LUHDyykOU1yxRYDmhM__u2Tfnx8_231yKHdf2_dDAmtrE1AYjKy1V85gLXTIc50p4yAzmdOyxuCs93kRxFUHUYELBuor8h6lNmrJXh-vd_FqGKmFca5uAdU9QF0As4FB5Q</recordid><startdate>20190219</startdate><enddate>20190219</enddate><creator>Matyushin, Leonid</creator><creator>Zaytsev, Alexey</creator><creator>Alenkin, Oleg</creator><creator>Ustuzhanin, Andrey</creator><scope>AKY</scope><scope>EPD</scope><scope>GOX</scope></search><sort><creationdate>20190219</creationdate><title>Multifidelity Bayesian Optimization for Binomial Output</title><author>Matyushin, Leonid ; Zaytsev, Alexey ; Alenkin, Oleg ; Ustuzhanin, Andrey</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a677-a3ef51b4d3c5eb04f884235ca252c41befc7dd89f0069ee3acf5ab2c4dde1453</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Computer Science - Learning</topic><topic>Statistics - Machine Learning</topic><toplevel>online_resources</toplevel><creatorcontrib>Matyushin, Leonid</creatorcontrib><creatorcontrib>Zaytsev, Alexey</creatorcontrib><creatorcontrib>Alenkin, Oleg</creatorcontrib><creatorcontrib>Ustuzhanin, Andrey</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv Statistics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Matyushin, Leonid</au><au>Zaytsev, Alexey</au><au>Alenkin, Oleg</au><au>Ustuzhanin, Andrey</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Multifidelity Bayesian Optimization for Binomial Output</atitle><date>2019-02-19</date><risdate>2019</risdate><abstract>The key idea of Bayesian optimization is replacing an expensive target function with a cheap surrogate model. By selection of an acquisition function for Bayesian optimization, we trade off between exploration and exploitation. The acquisition function typically depends on the mean and the variance of the surrogate model at a given point. The most common Gaussian process-based surrogate model assumes that the target with fixed parameters is a realization of a Gaussian process. However, often the target function doesn't satisfy this approximation. Here we consider target functions that come from the binomial distribution with the parameter that depends on inputs. Typically we can vary how many Bernoulli samples we obtain during each evaluation. We propose a general Gaussian process model that takes into account Bernoulli outputs. To make things work we consider a simple acquisition function based on Expected Improvement and a heuristic strategy to choose the number of samples at each point thus taking into account precision of the obtained output.</abstract><doi>10.48550/arxiv.1902.06937</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.1902.06937
ispartof
issn
language eng
recordid cdi_arxiv_primary_1902_06937
source arXiv.org
subjects Computer Science - Learning
Statistics - Machine Learning
title Multifidelity Bayesian Optimization for Binomial Output
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-21T14%3A00%3A40IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Multifidelity%20Bayesian%20Optimization%20for%20Binomial%20Output&rft.au=Matyushin,%20Leonid&rft.date=2019-02-19&rft_id=info:doi/10.48550/arxiv.1902.06937&rft_dat=%3Carxiv_GOX%3E1902_06937%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true