mlsanityData to 14 Oct 2026

Movement Penalized Bayesian Optimization with Application to Wind Energy Systems

arXiv 2210.08087 ↗First posted 14 Oct 2022stat.ML cs.LGcited by 7

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). Builds on 26 of its 53 references that are in the map. First posted on arXiv 14 Oct 2022.

Builds on

26 of 53 references.

References · 26

  1. 2017On Kernelized Multi-armed Banditscited by 352
  2. 2017Multi-fidelity Bayesian Optimisation with Continuous Approximationscited by 121
  3. 2015Batch Bayesian Optimization via Local Penalizationcited by 104
  4. 2018Information Directed Sampling and Bandits with Heteroscedastic Noisecited by 76
  5. 2020Distributionally Robust Bayesian Optimizationcited by 61
  6. 2018A General Framework for Multi-fidelity Bayesian Optimization with Gaussian Processescited by 52
  7. 2016Truncated Variance Reduction: A Unified Approach to Bayesian Optimization and Level-Set Estimationcited by 40
  8. 2019On Online Learning in Kernelized Markov Decision Processescited by 35
  9. 2016Batched Gaussian Process Bandit Optimization via Determinantal Point Processescited by 33
  10. 2019Beyond Online Balanced Descent: An Optimal Algorithm for Smoothed Online Optimizationcited by 31
  11. 2018Smoothed Online Optimization for Regression and Controlcited by 26
  12. 2018Chasing Nested Convex Bodies Nearly Optimallycited by 21
14 more
  1. 2019Chasing Convex Bodies Optimallycited by 18
  2. 2019No-Regret Learning in Unknown Games with Correlated Payoffscited by 18
  3. 2020Learning to Play Sequential Games versus Unknown Opponentscited by 18
  4. 2019Chasing Convex Bodies with Linear Competitive Ratiocited by 15
  5. 2022SnAKe: Bayesian Optimization with Pathwise Explorationcited by 14
  6. 2022Scaling Gaussian Process Optimization by Evaluating a Few Unique Candidates Multiple Timescited by 13
  7. 2019Online Optimization with Predictions and Non-convex Lossescited by 12
  8. 2018Metrical task systems on trees via mirror descent and unfair gluingcited by 11
  9. 2021Contextual Games: Multi-Agent Learning with Side Informationcited by 11
  10. 2019Cost-aware Multi-objective Bayesian optimisationcited by 8
  11. 2020Mixed Strategies for Robust Optimization of Unknown Objectivescited by 8
  12. 2018Competitively Chasing Convex Bodiescited by 7
  13. 2019Pure entropic regularization for metrical task systemscited by 5
  14. 2020Bayesian optimization for modular black-box systems with switching costscited by 5

Built on by

Cited by year

Citing papers per year: 2023: 3; 2024: 3; 2025: 1.

7 papers.