mlsanityData to 7 Oct 2026

Bayesian Optimization for Function Compositions with Applications to Dynamic Pricing

arXiv 2303.11954 ↗First posted 21 Mar 2023cs.LG math.OCcited by 3

Not on the map. Why?

Abstract (arXiv)

Bayesian Optimization (BO) is used to find the global optima of black box functions. In this work, we propose a practical BO method of function compositions where the form of the composition is known but the constituent functions are expensive to evaluate. By assuming an independent Gaussian process (GP) model for each of the constituent black-box function, we propose Expected Improvement (EI) and Upper Confidence Bound (UCB) based BO algorithms and demonstrate their ability to outperform not just vanilla BO but also the current state-of-art algorithms. We demonstrate a novel application of the proposed methods to dynamic pricing in revenue management when the underlying demand function is expensive to evaluate.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 7 of its 33 references that are in the map. First posted on arXiv 21 Mar 2023.

Builds on

7 of 33 references.

References · 7

  1. 2018A Tutorial on Bayesian Optimizationcited by 734
  2. 2016Efficiency of minimizing compositions of convex functions and smooth mapscited by 59
  3. 2016Tight Complexity Bounds for Optimizing Composite Objectivescited by 47
  4. 2019Bayesian Optimization of Composite Functionscited by 45
  5. 2021Bayesian Optimization with High-Dimensional Outputscited by 32
  6. 2020Bayesian Optimization with Machine Learning Algorithms Towards Anomaly Detectioncited by 10
  7. 2015MOCCA: mirrored convex/concave optimization for nonconvex composite functionscited by 1

Built on by

Cited by year

Citing papers per year: 2023: 2; 2024: 0; 2025: 1.

3 papers.