Movement Penalized Bayesian Optimization with Application to Wind Energy Systems
Shyam Sundhar Ramesh, Pier Giuseppe Sessa, Andreas Krause, Ilija Bogunovic
Abstract
Contextual Bayesian optimization (CBO) is a powerful framework for sequential decision-making given side information, with important applications, e.g., in wind energy systems. In this setting, the learner receives context (e.g., weather conditions) at each round, and has to choose an action (e.g., turbine parameters). Standard algorithms assume no cost for switching their decisions at every round. However, in many practical applications, there is a cost associated with such changes, which should be minimized. We introduce the episodic CBO with movement costs problem and, based on the online learning approach for metrical task systems of Coester and Lee (2019), propose a novel randomized mirror descent algorithm that makes use of Gaussian Process confidence bounds. We compare its performance with the offline optimal sequence for each episode and provide rigorous regret guarantees. We further demonstrate our approach on the important real-world application of altitude optimization for Airborne Wind Energy Systems. In the presence of substantial movement costs, our algorithm consistently outperforms standard CBO algorithms.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext ca46b4c0-9218-4487-a290-44a56dee23f1Cited by top-tier papers3
- SnAKe: Bayesian Optimization with Pathwise ExplorationJose Pablo Folch, Shiqiang Zhang, Robert M. Lee, Behrang Shafei et al.NeurIPS 2022 · 24 citations
- Transition Constrained Bayesian Optimization via Markov Decision ProcessesJose Pablo Folch, Calvin Tsay, Robert M. Lee, Behrang Shafei et al.NeurIPS 2024 · 10 citations
- Barely Random Algorithms and Collective Metrical Task SystemsRomain Cosson, Laurent MassouliéNeurIPS 2024 · 4 citations
Builds on7
- Online Optimization with Memory and Competitive ControlGuanya Shi, Yiheng Lin, Soon-Jo Chung, Yisong Yue et al.NeurIPS 2020 · 66 citations
- Chasing Nested Convex Bodies Nearly OptimallySébastien Bubeck, Bo'az Klartag, Yin Tat Lee, Yuanzhi Li et al.SODA 2020 · 41 citations
- Chasing Convex Bodies OptimallyMark SellkeSODA 2020 · 36 citations
- Learning to Play Sequential Games versus Unknown OpponentsPier Giuseppe Sessa, Ilija Bogunovic, Maryam Kamgarpour, Andreas KrauseNeurIPS 2020 · 34 citations
- Contextual Games: Multi-Agent Learning with Side InformationPier Giuseppe Sessa, Ilija Bogunovic, Andreas Krause, Maryam KamgarpourNeurIPS 2020 · 26 citations
Related papers
- Model-based Causal Bayesian OptimizationScott Sussex, Anastasia Makarova, Andreas KrauseICLR 2023 · 1 citation
- Bayesian Optimization of Risk MeasuresSait Cakmak, Raul Astudillo, Peter I. Frazier, Enlu ZhouNeurIPS 2020 · 65 citations
- Bayesian Optimization with Cost-varying Variable SubsetsSebastian Tay, Chuan Sheng Foo, Daisuke Urano, Richalynn Leong et al.NeurIPS 2023 · 9 citations
- Bayesian Optimization under Stochastic Delayed FeedbackArun Verma, Zhongxiang Dai, Bryan Kian Hsiang LowICML 2022 · 15 citations
- Joint Online Learning and Decision-making via Dual Mirror DescentAlfonso Lobos, Paul Grigas, Zheng WenICML 2021 · 12 citations
