{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T11:31:25Z","timestamp":1763724685787,"version":"3.41.0"},"reference-count":42,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2024,3,14]],"date-time":"2024-03-14T00:00:00Z","timestamp":1710374400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key R&D Program of China","doi-asserted-by":"crossref","award":["2020YFA0711900, and 2020YFA0711901"],"award-info":[{"award-number":["2020YFA0711900, and 2020YFA0711901"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62141407, 62304052, 61974032, 61929102, 61674042, and 62090025"],"award-info":[{"award-number":["62141407, 62304052, 61974032, 61929102, 61674042, and 62090025"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Des. Autom. Electron. Syst."],"published-print":{"date-parts":[[2024,5,31]]},"abstract":"<jats:p>\n            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, D\n            <jats:sup>3<\/jats:sup>\n            PBO, 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 D\n            <jats:sup>3<\/jats:sup>\n            PBO is constant for each iteration. Experiments demonstrate that D\n            <jats:sup>3<\/jats:sup>\n            PBO obtains better results with significantly less runtime consumption compared to state-of-the-art methods. For the circuit optimization experiments, D\n            <jats:sup>3<\/jats:sup>\n            PBO achieves up to 10\u00d7 runtime speedup compared to TuRBO with better solutions.\n          <\/jats:p>","DOI":"10.1145\/3643811","type":"journal-article","created":{"date-parts":[[2024,1,31]],"date-time":"2024-01-31T11:58:41Z","timestamp":1706702321000},"page":"1-25","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["D\n            <sup>3<\/sup>\n            PBO:\n            <u>D<\/u>\n            ynamic\n            <u>D<\/u>\n            omain\n            <u>D<\/u>\n            ecomposition-based\n            <u>P<\/u>\n            arallel\n            <u>B<\/u>\n            ayesian\n            <u>O<\/u>\n            ptimization for Large-scale Analog Circuit Sizing"],"prefix":"10.1145","volume":"29","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3512-0320","authenticated-orcid":false,"given":"Aidong","family":"Zhao","sequence":"first","affiliation":[{"name":"State Key Laboratory of Integrated Chips and Systems, Fudan University, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9390-2761","authenticated-orcid":false,"given":"Tianchen","family":"Gu","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Integrated Chips and Systems, Fudan University, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7315-3150","authenticated-orcid":false,"given":"Zhaori","family":"Bi","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Integrated Chips and Systems, Fudan University, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2164-8175","authenticated-orcid":false,"given":"Fan","family":"Yang","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Integrated Chips and Systems, Fudan University, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8936-3945","authenticated-orcid":false,"given":"Changhao","family":"Yan","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Integrated Chips and Systems, Fudan University, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8097-4053","authenticated-orcid":false,"given":"Xuan","family":"Zeng","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Integrated Chips and Systems, Fudan University, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-0451-338X","authenticated-orcid":false,"given":"Zixiao","family":"Lin","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, UCSD, San Diego, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6748-1916","authenticated-orcid":false,"given":"Wenchuang","family":"Hu","sequence":"additional","affiliation":[{"name":"Precision Medicine Center, West China Hospital, Sichuan University, Chengdu, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2648-5232","authenticated-orcid":false,"given":"Dian","family":"Zhou","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Integrated Chips and Systems, Fudan University, Shanghai, China and Department of Electrical Engineering, University of Texas at Dallas, Richardson, USA"}]}],"member":"320","published-online":{"date-parts":[[2024,3,14]]},"reference":[{"key":"e_1_3_2_2_2","first-page":"147","volume-title":"Proceedings of the 29th International Conference on Machine Learning (ICML \u201912)","author":"Hannah Lauren A.","year":"2012","unstructured":"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 \u201912). 147\u2013154."},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/43.905671"},{"key":"e_1_3_2_4_2","first-page":"61","article-title":"Improved support vector machine regression for analog circuits macromodeling using efficient kernel functions","author":"Boolchandani D.","year":"2008","unstructured":"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\u201367.","journal-title":"Proceedings of IEEE International Workshop on Symbolic and Numerical Methods, Modeling and Applications to Circuit Design"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/SOCPAR.2010.5686736"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2019.2961322"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10470-009-9361-3"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2003.808914"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/3084685"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2015.2494218"},{"key":"e_1_3_2_11_2","article-title":"A tutorial on Bayesian optimization of expensive cost functions, with application to active user modeling and hierarchical reinforcement learning","volume":"1012","author":"Brochu Eric","year":"2010","unstructured":"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).","journal-title":"CoRR"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2017.2768826"},{"key":"e_1_3_2_13_2","first-page":"3306","volume-title":"Proceedings of the 35th International Conference on Machine Learning (ICML \u201918)","author":"Lyu Wenlong","year":"2018","unstructured":"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 \u201918). 3306\u20133314. https:\/\/proceedings.mlr.press\/v80\/lyu18a.html"},{"key":"e_1_3_2_14_2","first-page":"295","volume-title":"Proceedings of the 32nd International Conference on Machine Learning (ICML \u201915)","author":"Kandasamy Kirthevasan","year":"2015","unstructured":"Kirthevasan Kandasamy, Jeff Schneider, and Barnab\u00e1s P\u00f3czos. 2015. High dimensional Bayesian optimisation and bandits via additive models. In Proceedings of the 32nd International Conference on Machine Learning (ICML \u201915). 295\u2013304."},{"key":"e_1_3_2_15_2","first-page":"3627","volume-title":"Proceedings of the 34th International Conference on Machine Learning (ICML \u201917)","author":"Wang Zi","year":"2017","unstructured":"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 \u201917). 3627\u20133635."},{"key":"e_1_3_2_16_2","article-title":"Batched large-scale Bayesian optimization in high-dimensional spaces","volume":"1706","author":"Wang Zi","year":"2018","unstructured":"Zi Wang, Clement Gehring, Pushmeet Kohli, and Stefanie Jegelka. 2018. Batched large-scale Bayesian optimization in high-dimensional spaces. ArXiv abs\/1706.01445 (2018).","journal-title":"ArXiv"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2021.3102088"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.5555\/3013558.3013569"},{"key":"e_1_3_2_19_2","first-page":"4752","volume-title":"Proceedings of the 36th International Conference on Machine Learning (ICML \u201919)","author":"Nayebi Amin","year":"2019","unstructured":"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 \u201919). 4752\u20134761."},{"key":"e_1_3_2_20_2","first-page":"493","volume-title":"Proceedings of the 37th Conference on Uncertainty in Artificial Intelligence (UAI \u201921)","author":"Eriksson David","year":"2021","unstructured":"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 \u201921). 493\u2013503. https:\/\/proceedings.mlr.press\/v161\/eriksson21a.html"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/DAC18074.2021.9586139"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2022.3147431"},{"key":"e_1_3_2_23_2","volume-title":"Proceedings of the 33rd International Conference on Neural Information Processing Systems (NIPS \u201919)","author":"Eriksson David","year":"2019","unstructured":"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 \u201919). Article 493, 5496\u20135507 pages."},{"key":"e_1_3_2_24_2","volume-title":"Proceedings of the 34th International Conference on Neural Information Processing Systems (NIPS \u201920)","author":"Wang Linnan","year":"2020","unstructured":"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 \u201920). Article 1637, 12 pages."},{"key":"e_1_3_2_25_2","article-title":"The BOBYQA Algorithm for Bound Constrained Optimization without Derivatives.","author":"Powell M.","year":"2009","unstructured":"M. Powell. 2009. The BOBYQA Algorithm for Bound Constrained Optimization without Derivatives. Technical Report, Department of Applied Mathematics and Theoretical Physics.","journal-title":"Technical Report, Department of Applied Mathematics and Theoretical Physics"},{"key":"e_1_3_2_26_2","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1115\/1.3625776"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/3206.001.0001"},{"key":"e_1_3_2_28_2","article-title":"Gaussian process bandits without regret: An experimental design approach","volume":"0912","author":"Srinivas Niranjan","year":"2009","unstructured":"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","journal-title":"CoRR"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00941892"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1137\/0916069"},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1979.4310076"},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01589116"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/DAC18074.2021.9586172"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-78723-7_16"},{"key":"e_1_3_2_35_2","first-page":"4114","volume-title":"Proceedings of the 35th International Conference on Machine Learning (ICML \u201918)","author":"Pleiss Geoff","year":"2018","unstructured":"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 \u201918). 4114\u20134123. https:\/\/proceedings.mlr.press\/v80\/pleiss18a.html"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1162\/106365603321828970"},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008202821328"},{"key":"e_1_3_2_38_2","first-page":"3873","article-title":"Parallelizing exploration-exploitation tradeoffs in Gaussian process bandit optimization","volume":"2","author":"Desautels Thomas","year":"2012","unstructured":"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 \u201912), 2, 3873\u20133923.","journal-title":"Proceedings of the 29th International Conference on Machine Learning (ICML \u201912)"},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1109\/DAC18072.2020.9218592"},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1109\/JSSC.2012.2229070"},{"key":"e_1_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2017.2729461"},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10470-010-9453-0"},{"key":"e_1_3_2_43_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICSICT.2010.5667331"}],"container-title":["ACM Transactions on Design Automation of Electronic Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3643811","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3643811","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:57:46Z","timestamp":1750294666000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3643811"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,14]]},"references-count":42,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,5,31]]}},"alternative-id":["10.1145\/3643811"],"URL":"https:\/\/doi.org\/10.1145\/3643811","relation":{},"ISSN":["1084-4309","1557-7309"],"issn-type":[{"type":"print","value":"1084-4309"},{"type":"electronic","value":"1557-7309"}],"subject":[],"published":{"date-parts":[[2024,3,14]]},"assertion":[{"value":"2023-09-25","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-01-27","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-03-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}