D3PBO: Dynamic Domain Decomposition-based Parallel Bayesian Optimization for Large-scale Analog Circuit Sizing
Authors: 
Aidong Zhao, Tianchen Gu, 
Zhaori Bi, Fan Yang, Changhao Yan, Xuan Zeng, Zixiao Lin, Wenchuang Hu, Dian ZhouAuthors Info & Claims
Aidong Zhao, Tianchen Gu, Zhaori Bi, Fan Yang, Changhao Yan, Xuan Zeng, Zixiao Lin, Wenchuang Hu, Dian ZhouAuthors Info & ClaimsArticle No.: 44, Pages 1 - 25
Abstract
Bayesian optimization (BO) is an efficient global optimization method for expensive black-box functions, but the expansion for high-dimensional problems and large sample budgets still remains a severe challenge. In order to extend BO for large-scale analog circuit synthesis, a novel computationally efficient parallel BO method, D3PBO, is proposed for high-dimensional problems in this work. We introduce the dynamic domain decomposition method based on maximum variance between clusters. The search space is decomposed into subdomains progressively to limit the maximal number of observations in each domain. The promising domain is explored by multi-trust region-based batch BO with the local Gaussian process (GP) model. As the domain decomposition progresses, the basin-shaped domain is identified using a GP-assisted quadratic regression method and exploited by the local search method BOBYQA to achieve a faster convergence rate. The time complexity of D3PBO is constant for each iteration. Experiments demonstrate that D3PBO obtains better results with significantly less runtime consumption compared to state-of-the-art methods. For the circuit optimization experiments, D3PBO achieves up to 10× runtime speedup compared to TuRBO with better solutions.
References
[1]
Lauren A. Hannah and David B. Dunson. 2012. Ensemble methods for convex regression with applications to geometric programming based circuit design. In Proceedings of the 29th International Conference on Machine Learning (ICML ’12). 147–154.
[2]
M. delM. Hershenson, S. P. Boyd, and T. H. Lee. 2001. Optimal design of a CMOS op-amp via geometric programming. IEEE Transactions on Computer-aided Design of Integrated Circuits and Systems 20, 1 (2001), 1–21. DOI:
[3]
D. Boolchandani, A Ahmed, and Vineet Sahula. 2008. Improved support vector machine regression for analog circuits macromodeling using efficient kernel functions. In Proceedings of IEEE International Workshop on Symbolic and Numerical Methods, Modeling and Applications to Circuit Design, 61–67.
[4]
A. Jafari, S. Sadri, and M. Zekri. 2010. Design optimization of analog integrated circuits by using artificial neural networks. In 2010 International Conference of Soft Computing and Pattern Recognition. 385–388. DOI:
[5]
Yaping Li, Yong Wang, Yusong Li, Ranran Zhou, and Zhaojun Lin. 2020. An artificial neural network assisted optimization system for analog design space exploration. IEEE Transactions on Computer-aided Design of Integrated Circuits and Systems 39, 10 (2020), 2640–2653. DOI:
[6]
Mourad Fakhfakh, Yann Cooren, Amin Sallem, Mourad Loulou, and Patrick Siarry. 2010. Analog circuit design optimization through the particle swarm optimization technique. Analog Integrated Circuits and Signal Processing 63 (April2010), 71–82. DOI:
[7]
G. Alpaydin, S. Balkir, and G. Dundar. 2003. An evolutionary approach to automatic synthesis of high-performance analog integrated circuits. IEEE Transactions on Evolutionary Computation 7, 3 (2003), 240–252. DOI:
[8]
Zhaori Bi, Dian Zhou, Sheng-Guo Wang, and Xuan Zeng. 2017. Optimization and quality estimation of circuit design via random region covering method. ACM Transactions on Design Automation of Electronic Systems 23, 1, Article 1 (Aug.2017), 25 pages. DOI:
[9]
Bobak Shahriari, Kevin Swersky, Ziyu Wang, Ryan P. Adams, and Nando de Freitas. 2016. Taking the human out of the loop: A review of Bayesian optimization. Proceedings of the IEEE 104, 1 (2016), 148–175. DOI:
[10]
Eric Brochu, Vlad Cora, and Nando Freitas. 2010. A tutorial on Bayesian optimization of expensive cost functions, with application to active user modeling and hierarchical reinforcement learning. CoRR abs/1012.2599 (122010).
[11]
Wenlong Lyu, Pan Xue, Fan Yang, Changhao Yan, Zhiliang Hong, Xuan Zeng, and Dian Zhou. 2018. An efficient Bayesian optimization approach for automated optimization of analog circuits. IEEE Transactions on Circuits and Systems I: Regular Papers 65, 6 (2018), 1954–1967. DOI:
[12]
Wenlong Lyu, Fan Yang, Changhao Yan, Dian Zhou, and Xuan Zeng. 2018. Batch Bayesian optimization via multi-objective acquisition ensemble for automated analog circuit design. In Proceedings of the 35th International Conference on Machine Learning (ICML ’18). 3306–3314. https://proceedings.mlr.press/v80/lyu18a.html
[13]
Kirthevasan Kandasamy, Jeff Schneider, and Barnabás Póczos. 2015. High dimensional Bayesian optimisation and bandits via additive models. In Proceedings of the 32nd International Conference on Machine Learning (ICML ’15). 295–304.
[14]
Zi Wang and Stefanie Jegelka. 2017. Max-value entropy search for efficient bayesian optimization. In Proceedings of the 34th International Conference on Machine Learning (ICML ’17). 3627–3635.
[15]
Zi Wang, Clement Gehring, Pushmeet Kohli, and Stefanie Jegelka. 2018. Batched large-scale Bayesian optimization in high-dimensional spaces. ArXiv abs/1706.01445 (2018).
[16]
Tuotian Liao and Lihong Zhang. 2022. High-dimensional many-objective Bayesian optimization for LDE-aware analog IC sizing. IEEE Transactions on Very Large Scale Integration Systems 30, 1 (2022), 15–28. DOI:
[17]
Ziyu Wang, Frank Hutter, Masrour Zoghi, David Matheson, and Nando De Freitas. 2016. Bayesian optimization in a billion dimensions via random embeddings. Journal of Artificial Intelligence Research 55, 1 (2016), 361–387.
[18]
Amin Nayebi, Alexander Munteanu, and Matthias Poloczek. 2019. A framework for Bayesian optimization in embedded subspaces. In Proceedings of the 36th International Conference on Machine Learning (ICML ’19). 4752–4761.
[19]
David Eriksson and Martin Jankowiak. 2021. High-dimensional Bayesian optimization with sparse axis-aligned subspaces. In Proceedings of the 37th Conference on Uncertainty in Artificial Intelligence (UAI ’21). 493–503. https://proceedings.mlr.press/v161/eriksson21a.html
[20]
Ahmet F. Budak, Prateek Bhansali, Bo Liu, Nan Sun, David Z. Pan, and Chandramouli V. Kashyap. 2021. DNN-Opt: An RL inspired optimization for analog circuit sizing using deep neural networks. In 2021 58th ACM/IEEE Design Automation Conference. 1219–1224. DOI:
[21]
Chen Chen, Hongyi Wang, Xinyue Song, Feng Liang, Kaikai Wu, and Tao Tao. 2022. High-dimensional Bayesian optimization for analog integrated circuit sizing based on dropout and gm/ID methodology. IEEE Transactions on Computer-aided Design of Integrated Circuits and Systems 41, 11 (2022), 4808–4820. DOI:
[22]
David Eriksson, Michael Pearce, Jacob R. Gardner, Ryan Turner, and Matthias Poloczek. 2019. Scalable global optimization via local Bayesian optimization. In Proceedings of the 33rd International Conference on Neural Information Processing Systems (NIPS ’19). Article 493, 5496–5507 pages.
[23]
Linnan Wang, Rodrigo Fonseca, and Yuandong Tian. 2020. Learning search space partition for black-box optimization using Monte Carlo tree search. In Proceedings of the 34th International Conference on Neural Information Processing Systems (NIPS ’20). Article 1637, 12 pages.
[24]
M. Powell. 2009. The BOBYQA Algorithm for Bound Constrained Optimization without Derivatives. Technical Report, Department of Applied Mathematics and Theoretical Physics.
[25]
Milton Abramowitz and Irene A. Stegun (Eds.). 1965. Handbook of Mathematical Functions With Formulas, Graphs, and Mathematical Tables (NBS Applied Mathematics Series 55). National Bureau of Standards, Washington, DC.
[26]
Carl Edward Rasmussen and Christopher K. I. Williams. 2005. Gaussian Processes for Machine Learning. The MIT Press. DOI:
[27]
Niranjan Srinivas, Andreas Krause, Sham M. Kakade, and Matthias W. Seeger. 2009. Gaussian process bandits without regret: An experimental design approach. CoRR abs/0912.3995 (2009). arXiv:0912.3995
[28]
Donald Jones, C. Perttunen, and B. Stuckman. 1993. Lipschitzian optimisation without the Lipschitz constant. Journal of Optimization Theory and Applications 79 (Jan.1993), 157–181. DOI:
[29]
Richard H. Byrd, Peihuang Lu, Jorge Nocedal, and Ciyou Zhu. 1995. A limited memory algorithm for bound constrained optimization. SIAM Journal on Scientific Computing 16, 5 (1995), 1190–1208. DOI:
[30]
Nobuyuki Otsu. 1979. A threshold selection method from gray-level histograms. IEEE Transactions on Systems, Man, and Cybernetics 9, 1 (1979), 62–66. DOI:
[31]
Dong C. Liu and Jorge Nocedal. 1989. On the limited memory BFGS method for large scale optimization. Mathematical Programming 45, 3 (Dec.1989), 503–528.
[32]
Konstantinos Touloupas, Nikos Chouridis, and Paul P. Sotiriadis. 2021. Local Bayesian optimization for analog circuit sizing. In 2021 58th ACM/IEEE Design Automation Conference. 1237–1242. DOI:
[33]
Michael Bartholomew Biggs. 2008. Equality Constrained Optimization. Springer US, Boston, MA, 1–14. DOI:
[34]
Geoff Pleiss, Jacob Gardner, Kilian Weinberger, and Andrew Gordon Wilson. 2018. Constant-time predictive distributions for Gaussian processes. In Proceedings of the 35th International Conference on Machine Learning (ICML ’18). 4114–4123. https://proceedings.mlr.press/v80/pleiss18a.html
[35]
Nikolaus Hansen, Sibylle D. Müller, and Petros Koumoutsakos. 2003. Reducing the time complexity of the derandomized evolution strategy with covariance matrix adaptation (CMA-ES). Evolutionary Computation 11, 1 (2003), 1–18. DOI:
[36]
Rainer Storn and Kenneth Price. 1997. Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces. Journal of Global Optimization 11 (Jan.1997), 341–359. DOI:
[37]
Thomas Desautels, Andreas Krause, and Joel Burdick. 2012. Parallelizing exploration-exploitation tradeoffs in Gaussian process bandit optimization. Proceedings of the 29th International Conference on Machine Learning (ICML ’12), 2, 3873–3923.
[38]
Shuhan Zhang, Fan Yang, Dian Zhou, and Xuan Zeng. 2020. An efficient asynchronous batch Bayesian optimization approach for analog circuit synthesis. In 2020 57th ACM/IEEE Design Automation Conference. 1–6. DOI:
[39]
Zushu Yan, Pui-In Mak, Man-Kay Law, and Rui P. Martins. 2013. A 0.016-mm \(^{2}\) 144- \(\mu\) W three-stage amplifier capable of driving 1-to-15 nF capacitive load with \(\gt\) 0.95-MHz GBW. IEEE Journal of Solid-State Circuits 48, 2 (2013), 527–540. DOI:
[40]
Yishi Yang, Hengliang Zhu, Zhaori Bi, Changhao Yan, Dian Zhou, Yangfeng Su, and Xuan Zeng. 2017. Smart-MSP: A self-adaptive multiple starting point optimization approach for analog circuit synthesis. IEEE Transactions on Computer-aided Design of Integrated Circuits and Systems PP (July2017), 1–1. DOI:
[41]
Mingjun Fan, Junyan Ren, Ning Li, Ye Fan, and Jun Xu. 2010. A 1.8-V 11-bit 40-MS/s 21-mW pipelined ADC. Analog Integrated Circuits and Signal Processing 63 (June2010), 495–501. DOI:
[42]
Guanghua Shu, Mingjun Fan, Chen Shu, Cheng Chen, Ning Li, and Junyan Ren. 2010. A 12-bit 50-MS/s pipelined analog-to-digital converter in 65nm CMOS. In 2010 10th IEEE International Conference on Solid-state and Integrated Circuit Technology. 563–565. DOI:
Index Terms
- D3PBO: Dynamic Domain Decomposition-based Parallel Bayesian Optimization for Large-scale Analog Circuit Sizing
Recommendations
LinEasyBO: Scalable Bayesian Optimization Approach for Analog Circuit Synthesis via One-Dimensional Subspaces
MLCAD '22: Proceedings of the 2022 ACM/IEEE Workshop on Machine Learning for CADA large body of literature has proved that the Bayesian optimization framework is especially efficient and effective in analog circuit synthesis. However, most of the previous research works only focus on designing informative surrogate models or ...
Domain decomposition preconditioning for parallel PDE software
Engineering computational technologyDomain decomposition methods have been applied to the solution of engineering problems for many years. Over the past two decades however the growth in the use of parallel computing platforms has ensured that interest in these methods, which offer the ...
A Gradient Method Approach to Optimization-Based Multidisciplinary Simulations and Nonoverlapping Domain Decomposition Algorithms
It has been shown recently that optimization-based nonoverlapping domain decomposition algorithms are connected to many well-known algorithms. Using a gradient-type iterative strategy for the optimization problem, we present further discussion on how to ...
Comments
Information & Contributors
Information
Published In
May 2024
374 pages
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Publisher
Association for Computing Machinery
New York, NY, United States
Journal Family
Publication History
Published: 14 March 2024
Online AM: 31 January 2024
Accepted: 27 January 2024
Revised: 23 December 2023
Received: 25 September 2023
Published in TODAES Volume 29, Issue 3
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- National Key R&D Program of China
- National Natural Science Foundation of China (NSFC)
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 174Total Downloads
- Downloads (Last 12 months)174
- Downloads (Last 6 weeks)35
Reflects downloads up to 26 Jul 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in