Optimization of time-consuming experimental conditions using pseudo-experimental data guided by adaptive polynomial regression
Not on the map. Why?
Abstract (arXiv)
Bayesian optimization (BO) is an optimization method that sequentially proposes the next candidate explainable variables for optimizing target variables by balancing exploration and exploitation. BO is often used under a limited evaluation budget, such as hyperparameter tuning of deep learning. Despite its effectiveness, conventional BO may have poor convergence in practical experimental science where each evaluation is often costly and time-consuming. Recently, BO methods have been proposed that accelerate optimization by using pseudo-experimental data that simulate experimental data. However, when only a limited number of experimental data are available, the generated pseudo-experimental data may be of insufficient quality. In this study, we developed PolyBO to improve optimization time by generating high-quality pseudo-experimental data even when the number of trials is limited. PolyBO performs BO efficiently by generating pseudo-experimental data with an adaptively updated versatile parametric model. This low-capacity polynomial regression model is intended to enable efficient BO even with limited experimental data. PolyBO updates the BO surrogate model with a combined dataset consisting of experimental data and pseudo-experimental data and then performs optimization. Using synthetic benchmark functions with diverse landscapes, we found that PolyBO reduced the optimization time by a median of 42%. For a real-world material composition optimization problem, PolyBO reduced the optimization time by a median of 96% compared with conventional methods. Overall, PolyBO achieves efficient optimization in settings where each experiment requires a long time.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 15 of its 53 references that are in the map. First posted on arXiv 24 Jul 2026.
Builds on
15 of 53 references.
References · 15
- 2018UMAP: Uniform Manifold Approximation and Projection for Dimension Reductioncited by 2,898
- 2016Automatic chemical design using a data-driven continuous representation of moleculescited by 765
- 2015High Dimensional Bayesian Optimisation and Bandits via Additive Modelscited by 139
- 2016COCO: A Platform for Comparing Continuous Optimizers in a Black-Box Settingcited by 138
- 2020Sample-Efficient Optimization in the Latent Space of Deep Generative Models via Weighted Retrainingcited by 123
- 2022Recent Advances in Bayesian Optimizationcited by 76
- 2021High-Dimensional Bayesian Optimisation with Variational Autoencoders and Deep Metric Learningcited by 54
- 2016Multi-fidelity Gaussian Process Bandit Optimisationcited by 31
- 2022Multi-Fidelity Cost-Aware Bayesian Optimizationcited by 20
- 2023Multi-fidelity Bayesian Optimization: A Reviewcited by 12
- 2025Exploring Exploration in Bayesian Optimizationcited by 9
- 2019Bayesian Optimization using Pseudo-Pointscited by 7
3 more
- 2023Unleashing the Potential of Acquisition Functions in High-Dimensional Bayesian Optimizationcited by 5
- 2023High-Dimensional Bayesian Optimization via Semi-Supervised Learning with Optimized Unlabeled Data Samplingcited by 5
- 2021Policy Optimization in Dynamic Bayesian Network Hybrid Models of Biomanufacturing Processescited by 4
Built on by
Not cited yet.