Journal Article10.1109/tcad.2022.3147431
High-Dimensional Bayesian Optimization for Analog Integrated Circuit Sizing Based on Dropout and g<sub>m</sub>/I<sub>D</sub> Methodology
14
TL;DR: In this paper , the authors proposed a new Bayesian optimization (cBO) algorithm, which can scale BO to more larger scale circuit and improve the optimization result, according to the fact that a specification of the analog integrated circuit is mainly determined by a few transistors.
read more
Abstract: Bayesian optimization (BO) is popular for a analog circuit sizing problem recently. However, BO can only work well in small-scale circuit. Scaling BO to common circuit optimization (typically dimension > 10) is difficult due to the curse of dimensionality. In this article, we proposed a new BO algorithm (cBO), which can scale BO to more larger scale circuit and improve the optimization result. First, according to the fact that a specification of the analog integrated circuit is mainly determined by a few transistors, dropout strategy is adopted in our algorithm. At each iteration, only a subset of selected variables to be optimized. A variables selection strategy based on mutual information analysis and a new fill-in strategy are proposed. Second, the <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$g_{m}/I_{D}$ </tex-math></inline-formula> methodology-based optimization strategy is proposed. Optimization variables are not width and the length of transistors, but <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$g_{m}/I_{D}$ </tex-math></inline-formula> , <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$I_{D}$ </tex-math></inline-formula> and length. <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$g_{m}$ </tex-math></inline-formula> , <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$I_{D}$ </tex-math></inline-formula> and <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$g_{m}/I_{D}$ </tex-math></inline-formula> have a direct relationship to circuit performance. This is equivalent to search in circuit feature space, which could achieve better performance and handle constraints more easily. Four commonly used circuits, including low dropout regulator, two stage amplifiers, Bandgap voltage reference (VR), and VR are used for validation. Compared with other high-dimensional BO, common BO, and commercial tools (Cadence ADE_GXL), the proposed algorithm is found to produce the best optimization result and best stability. And, the ablation study shows the effectiveness and efficiency of two ingredients of the proposed algorithm.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Bayesian optimisation for efficient material discovery: a mini review.
Yimeng Jin,Priyanka Kumari +1 more
TL;DR: In this article , a short review aiming at connecting algorithmic advancement to material applications is provided, where open algorithmic challenges are discussed and supported by recent material applications and three exemplary material design problems are analysed to demonstrate how BO could be useful.
15
BBGP-sDFO: Batch Bayesian and Gaussian Process Enhanced Subspace Derivative Free Optimization for High-Dimensional Analog Circuit Synthesis
Tianchen Gu,Wangzhen Li,Aidong Zhao,Zhaori Bi,Xudong Li,Fan Yang,Changhao Yan,Wenchuang Hu,Dian Zhou,Tao Cui,Xin Liu,Zaikun Zhang,Xuan Zeng +12 more
TL;DR: A batch Bayesian querying strategy for exploring the global design space and a Gaussian process enhanced subspace derivative free optimization (DFO) method for exploiting promising regions in effective low-dimensional subspace are proposed.
8
A Study on Exploring and Exploiting the High-dimensional Design Space for Analog Circuit Design Automation : (Invited Paper)
Ren-Yuan Lyu,Yuan Meng,Aizhi Zhao,Zhaori Bi,Keren Zhu,Fan Yang,Changhao Yan,Dian Zhou,Xuan Zeng +8 more
- 22 Jan 2024
2
A Survey on Smart Optimisation Techniques for 6G-oriented Integrated Circuits Design
Thang Quoc Nguyen,Trang Hoang,Lihong Zhang,Octavia A. Dobre,T. Duong +4 more
1
D <sup>3</sup> PBO: <u>D</u> ynamic <u>D</u> omain <u>D</u> ecomposition-based <u>P</u> arallel <u>B</u> ayesian <u>O</u> ptimization for Large-scale Analog Circuit Sizing
Aizhi Zhao,Tianchen Gu,Zhaori Bi,Fan Yang,Changhao Yan,Xuan Zeng,Ziying Lin,Walter Hu,Dian Zhou +8 more
TL;DR: D 3 PBO is a novel parallel BO method for large-scale analog circuit sizing that significantly reduces the time complexity and improves the solution quality compared to state-of-the-art methods.
1
References
Gaussian processes in machine learning
TL;DR: In this paper, the authors give a basic introduction to Gaussian Process regression models and present the simple equations for incorporating training data and examine how to learn the hyperparameters using the marginal likelihood.
•Proceedings Article
Practical Bayesian Optimization of Machine Learning Algorithms
Jasper Snoek,Hugo Larochelle,Ryan P. Adams +2 more
- 03 Dec 2012
TL;DR: This work describes new algorithms that take into account the variable cost of learning algorithm experiments and that can leverage the presence of multiple cores for parallel experimentation and shows that these proposed algorithms improve on previous automatic procedures and can reach or surpass human expert-level optimization for many algorithms.
Estimating mutual information.
TL;DR: Two classes of improved estimators for mutual information M(X,Y), from samples of random points distributed according to some joint probability density mu(x,y), based on entropy estimates from k -nearest neighbor distances are presented.
4.2K
Lipschitzian optimization without the Lipschitz constant
TL;DR: In this article, the Lipschitz constant is viewed as a weighting parameter that indicates how much emphasis to place on global versus local search, which accounts for the fast convergence of the new algorithm on the test functions.
Cooperative Coevolution: An Architecture for Evolving Coadapted Subcomponents
TL;DR: Given a simple string- matching task, it is shown that evolutionary pressure to increase the overall fitness of the ecosystem can provide the needed stimulus for the emergence of an appropriate number of interdependent subcomponents that cover multiple niches, evolve to an appropriate level of generality, and adapt as the number and roles of their fellowSubcomponents change over time.