학술논문

BBGP-sDFO: Batch Bayesian and Gaussian Process Enhanced Subspace Derivative Free Optimization for High-Dimensional Analog Circuit Synthesis
Document Type
Periodical
Source
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on. 43(2):417-430 Feb, 2024
Subject
Components, Circuits, Devices and Systems
Computing and Processing
Analog circuits
Integrated circuit modeling
Bayes methods
Gaussian processes
Optimization methods
Mathematical models
Training
Analog circuit synthesis
Bayesian optimization (BO)
derivative free optimization (DFO)
high-dimensional optimization
subspace technique
Language
ISSN
0278-0070
1937-4151
Abstract
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.