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.
Dynamic Pricing and Demand Learning on a Large Network of Products: A PAC-Bayesian Approach
Duke University, Fuqua School of Business(杜克大学富卡商学院);Institute for Data, Systems, and Society, MIT(麻省理工学院数据、系统与社会研究所);Operations Research Center, MIT(麻省理工学院运筹学中心)
DaringFed: A Dynamic Bayesian Persuasion Pricing for Online Federated Learning under Two-sided Incomplete Information
School of Computer Science and Technology, Wuhan University of Science and Technology(武汉科技大学计算机科学与技术学院);Key Laboratory of Social Computing and Cognitive Intelligence (Dalian University of Technology), Ministry of Education, China(大连理工大学社会计算与认知智能重点实验室(教育部));Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System, Wuhan University of Science and Technology, China(湖北省智能信息处理与实时工业系统重点实验室(武汉科技大学));College of Computer Science, Inner Mongolia University, China(内蒙古大学计算机学院);School of Computer Science and Technology, Huazhong University of Science and Technology, China(华中科技大学计算机科学与技术学院);School of Automation, Southeast University, China(东南大学自动化学院)