TY - GEN
T1 - A Bayesian Optimization Approach via Iteratively Least Squares for High-Dimensional Black-Box Systems’ Design Space Exploration
AU - Hou, Mingyuan
AU - Zhai, Qiaozhu
AU - Lv, Xiaoliang
AU - Zhou, Yuzhou
AU - Guan, Xiaohong
N1 - Publisher Copyright:
© 2024 IEEE.
PY - 2024
Y1 - 2024
N2 - The design space exploration in black-box systems, which lack complete mechanistic models, has wide applications in scientific and industrial research. Bayesian optimization(BO) can obtain high-quality solutions with limited evaluations, which is particularly suitable for expensive black-box optimization problems. However, existing research indicates that BO methods face challenges in high-dimensional black-box optimization problems. A BO algorithm based on iterative least squares(ILS) dimensionality reduction is proposed to reduce the impact of the dimensionality in high-dimensional black-box function optimization with low-dimensional effective subspace. The algorithm first performs dimensionality reduction by a limited dataset, iteratively conducting least squares fitting, and obtains important parameters through weight analysis of the combination with the smallest error. Subsequently, it applies Bayesian optimization only for the important parameters, while other parameters are set to the optimal values obtained from the primal dataset. Experimental results demonstrate that, compared to directly USE BO with MACE acquisition function, an advanced BO method, this method performs better in high-dimensional black-box functions with the same number of evaluations.
AB - The design space exploration in black-box systems, which lack complete mechanistic models, has wide applications in scientific and industrial research. Bayesian optimization(BO) can obtain high-quality solutions with limited evaluations, which is particularly suitable for expensive black-box optimization problems. However, existing research indicates that BO methods face challenges in high-dimensional black-box optimization problems. A BO algorithm based on iterative least squares(ILS) dimensionality reduction is proposed to reduce the impact of the dimensionality in high-dimensional black-box function optimization with low-dimensional effective subspace. The algorithm first performs dimensionality reduction by a limited dataset, iteratively conducting least squares fitting, and obtains important parameters through weight analysis of the combination with the smallest error. Subsequently, it applies Bayesian optimization only for the important parameters, while other parameters are set to the optimal values obtained from the primal dataset. Experimental results demonstrate that, compared to directly USE BO with MACE acquisition function, an advanced BO method, this method performs better in high-dimensional black-box functions with the same number of evaluations.
KW - Bayesian optimization
KW - black-box optimization
KW - dimensionality reduction
KW - iterative least squares
UR - https://www.scopus.com/pages/publications/86000775725
U2 - 10.1109/CAC63892.2024.10865021
DO - 10.1109/CAC63892.2024.10865021
M3 - 会议稿件
AN - SCOPUS:86000775725
T3 - Proceedings - 2024 China Automation Congress, CAC 2024
SP - 6936
EP - 6941
BT - Proceedings - 2024 China Automation Congress, CAC 2024
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2024 China Automation Congress, CAC 2024
Y2 - 1 November 2024 through 3 November 2024
ER -