贝叶斯优化
子空间拓扑
加速
无导数优化
计算机科学
高斯过程
数学优化
连续优化
高斯分布
全局优化
最优化问题
替代模型
算法
数学
人工智能
并行计算
元优化
多群优化
物理
量子力学
作者
Tianchen Gu,Wangzhen Li,Aidong Zhao,Zhaori Bi,Xudong Li,Fan Yang,Changhao Yan,Walter Hu,Dian Zhou,Tao Cui,Xin Liu,Zaikun Zhang,Xuan Zeng
标识
DOI:10.1109/tcad.2023.3314519
摘要
In this article, we propose a novel batch Bayesian and Gaussian process enhanced subspace derivative free optimization (DFO) method to solve high-dimensional and simulation-expensive analog circuit optimization problems. The existing optimization methods, such as Bayesian optimization and trust region-based DFO, suffer from under-fitting surrogate models in high-dimensional problems, which leads to inefficient optimization and suboptimal solutions. To address this issue, we propose a novel approach that integrates a batch Bayesian querying strategy for exploring the global design space and a Gaussian process (GP) enhanced subspace DFO method for exploiting promising regions in effective low-dimensional subspace. The GP is used to approximate the gradient pattern for subspace establishment, significantly enhancing the simulation efficiency. The selection of promising regions is based on an innovative region acquisition function that estimates the weighted local expected improvement. The effectiveness of the proposed method is demonstrated on real-life analog circuits, achieving ${2.05\times - 17.65\times }$ simulation number speedup and ${1.37\times - 16.11\times }$ runtime speedup compared with the state-of-the-art optimization methods.
科研通智能强力驱动
Strongly Powered by AbleSci AI