Event-Triggered Time-Varying Bayesian Optimization

We consider the problem of sequentially optimizing a time-varying objective function using time-varying Bayesian optimization (TVBO). Current approaches to TVBO require prior knowledge of a constant rate of change to cope with stale data arising from time variations. However, in practice, the rate o...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Brunzema, Paul, von Rohr, Alexander, Solowjow, Friedrich, Trimpe, Sebastian
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 Brunzema, Paul
von Rohr, Alexander
Solowjow, Friedrich
Trimpe, Sebastian
description We consider the problem of sequentially optimizing a time-varying objective function using time-varying Bayesian optimization (TVBO). Current approaches to TVBO require prior knowledge of a constant rate of change to cope with stale data arising from time variations. However, in practice, the rate of change is usually unknown. We propose an event-triggered algorithm, ET-GP-UCB, that treats the optimization problem as static until it detects changes in the objective function and then resets the dataset. This allows the algorithm to adapt online to realized temporal changes without the need for exact prior knowledge. The event trigger is based on probabilistic uniform error bounds used in Gaussian process regression. We derive regret bounds for adaptive resets without exact prior knowledge of the temporal changes and show in numerical experiments that ET-GP-UCB outperforms competing GP-UCB algorithms on both synthetic and real-world data. The results demonstrate that ET-GP-UCB is readily applicable without extensive hyperparameter tuning.
doi_str_mv 10.48550/arxiv.2208.10790
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2208_10790</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2208_10790</sourcerecordid><originalsourceid>FETCH-LOGICAL-a670-fb447cd90c3a2d30924941893a9c4289e4f0af4cc369ba1efd9a50c5703346693</originalsourceid><addsrcrecordid>eNotzr9uwjAQgHEvHRDlAZjICzi92Jc_N7YIaCUklog1Ohw7OomkyEQIePoW2unbPv2UmmeQYpXn8MbxKpfUGKjSDEqCiTKrix9GXUfpOh99m9TSe73neJOhSz745s_CQ7I7jdLLnUf5Hl7VS-Dj2c_-O1X1elUvP_V2t_lavm81FyXocEAsXUvgLJvWAhkkzCqyTA5NRR4DcEDnbEEHznxoiXNweQnWYlGQnarF3_aJbk5R-l9V88A3T7z9AcJcPlY</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Event-Triggered Time-Varying Bayesian Optimization</title><source>arXiv.org</source><creator>Brunzema, Paul ; von Rohr, Alexander ; Solowjow, Friedrich ; Trimpe, Sebastian</creator><creatorcontrib>Brunzema, Paul ; von Rohr, Alexander ; Solowjow, Friedrich ; Trimpe, Sebastian</creatorcontrib><description>We consider the problem of sequentially optimizing a time-varying objective function using time-varying Bayesian optimization (TVBO). Current approaches to TVBO require prior knowledge of a constant rate of change to cope with stale data arising from time variations. However, in practice, the rate of change is usually unknown. We propose an event-triggered algorithm, ET-GP-UCB, that treats the optimization problem as static until it detects changes in the objective function and then resets the dataset. This allows the algorithm to adapt online to realized temporal changes without the need for exact prior knowledge. The event trigger is based on probabilistic uniform error bounds used in Gaussian process regression. We derive regret bounds for adaptive resets without exact prior knowledge of the temporal changes and show in numerical experiments that ET-GP-UCB outperforms competing GP-UCB algorithms on both synthetic and real-world data. The results demonstrate that ET-GP-UCB is readily applicable without extensive hyperparameter tuning.</description><identifier>DOI: 10.48550/arxiv.2208.10790</identifier><language>eng</language><subject>Computer Science - Learning ; Statistics - Machine Learning</subject><creationdate>2022-08</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,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2208.10790$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2208.10790$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Brunzema, Paul</creatorcontrib><creatorcontrib>von Rohr, Alexander</creatorcontrib><creatorcontrib>Solowjow, Friedrich</creatorcontrib><creatorcontrib>Trimpe, Sebastian</creatorcontrib><title>Event-Triggered Time-Varying Bayesian Optimization</title><description>We consider the problem of sequentially optimizing a time-varying objective function using time-varying Bayesian optimization (TVBO). Current approaches to TVBO require prior knowledge of a constant rate of change to cope with stale data arising from time variations. However, in practice, the rate of change is usually unknown. We propose an event-triggered algorithm, ET-GP-UCB, that treats the optimization problem as static until it detects changes in the objective function and then resets the dataset. This allows the algorithm to adapt online to realized temporal changes without the need for exact prior knowledge. The event trigger is based on probabilistic uniform error bounds used in Gaussian process regression. We derive regret bounds for adaptive resets without exact prior knowledge of the temporal changes and show in numerical experiments that ET-GP-UCB outperforms competing GP-UCB algorithms on both synthetic and real-world data. The results demonstrate that ET-GP-UCB is readily applicable without extensive hyperparameter tuning.</description><subject>Computer Science - Learning</subject><subject>Statistics - Machine Learning</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotzr9uwjAQgHEvHRDlAZjICzi92Jc_N7YIaCUklog1Ohw7OomkyEQIePoW2unbPv2UmmeQYpXn8MbxKpfUGKjSDEqCiTKrix9GXUfpOh99m9TSe73neJOhSz745s_CQ7I7jdLLnUf5Hl7VS-Dj2c_-O1X1elUvP_V2t_lavm81FyXocEAsXUvgLJvWAhkkzCqyTA5NRR4DcEDnbEEHznxoiXNweQnWYlGQnarF3_aJbk5R-l9V88A3T7z9AcJcPlY</recordid><startdate>20220823</startdate><enddate>20220823</enddate><creator>Brunzema, Paul</creator><creator>von Rohr, Alexander</creator><creator>Solowjow, Friedrich</creator><creator>Trimpe, Sebastian</creator><scope>AKY</scope><scope>EPD</scope><scope>GOX</scope></search><sort><creationdate>20220823</creationdate><title>Event-Triggered Time-Varying Bayesian Optimization</title><author>Brunzema, Paul ; von Rohr, Alexander ; Solowjow, Friedrich ; Trimpe, Sebastian</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a670-fb447cd90c3a2d30924941893a9c4289e4f0af4cc369ba1efd9a50c5703346693</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Computer Science - Learning</topic><topic>Statistics - Machine Learning</topic><toplevel>online_resources</toplevel><creatorcontrib>Brunzema, Paul</creatorcontrib><creatorcontrib>von Rohr, Alexander</creatorcontrib><creatorcontrib>Solowjow, Friedrich</creatorcontrib><creatorcontrib>Trimpe, Sebastian</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>Brunzema, Paul</au><au>von Rohr, Alexander</au><au>Solowjow, Friedrich</au><au>Trimpe, Sebastian</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Event-Triggered Time-Varying Bayesian Optimization</atitle><date>2022-08-23</date><risdate>2022</risdate><abstract>We consider the problem of sequentially optimizing a time-varying objective function using time-varying Bayesian optimization (TVBO). Current approaches to TVBO require prior knowledge of a constant rate of change to cope with stale data arising from time variations. However, in practice, the rate of change is usually unknown. We propose an event-triggered algorithm, ET-GP-UCB, that treats the optimization problem as static until it detects changes in the objective function and then resets the dataset. This allows the algorithm to adapt online to realized temporal changes without the need for exact prior knowledge. The event trigger is based on probabilistic uniform error bounds used in Gaussian process regression. We derive regret bounds for adaptive resets without exact prior knowledge of the temporal changes and show in numerical experiments that ET-GP-UCB outperforms competing GP-UCB algorithms on both synthetic and real-world data. The results demonstrate that ET-GP-UCB is readily applicable without extensive hyperparameter tuning.</abstract><doi>10.48550/arxiv.2208.10790</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2208.10790
ispartof
issn
language eng
recordid cdi_arxiv_primary_2208_10790
source arXiv.org
subjects Computer Science - Learning
Statistics - Machine Learning
title Event-Triggered Time-Varying Bayesian Optimization
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-16T09%3A35%3A32IST&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=Event-Triggered%20Time-Varying%20Bayesian%20Optimization&rft.au=Brunzema,%20Paul&rft.date=2022-08-23&rft_id=info:doi/10.48550/arxiv.2208.10790&rft_dat=%3Carxiv_GOX%3E2208_10790%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