all AI news
PMBO: Enhancing Black-Box Optimization through Multivariate Polynomial Surrogates
March 13, 2024, 4:43 a.m. | Janina Schreiber, Pau Batlle, Damar Wicaksono, Michael Hecht
cs.LG updates on arXiv.org arxiv.org
Abstract: We introduce a surrogate-based black-box optimization method, termed Polynomial-model-based optimization (PMBO). The algorithm alternates polynomial approximation with Bayesian optimization steps, using Gaussian processes to model the error between the objective and its polynomial fit. We describe the algorithmic design of PMBO and compare the results of the performance of PMBO with several optimization methods for a set of analytic test functions.
The results show that PMBO outperforms the classic Bayesian optimization and is robust with …
abstract algorithm approximation arxiv bayesian box cs.lg cs.ms design error gaussian processes math.oc multivariate optimization polynomial processes results the algorithm through type
More from arxiv.org / cs.LG updates on arXiv.org
Jobs in AI, ML, Big Data
AI Research Scientist
@ Vara | Berlin, Germany and Remote
Data Architect
@ University of Texas at Austin | Austin, TX
Data ETL Engineer
@ University of Texas at Austin | Austin, TX
Lead GNSS Data Scientist
@ Lurra Systems | Melbourne
Data Science Analyst
@ Mayo Clinic | AZ, United States
Sr. Data Scientist (Network Engineering)
@ SpaceX | Redmond, WA