{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,20]],"date-time":"2026-06-20T16:19:01Z","timestamp":1781972341902,"version":"3.54.5"},"reference-count":32,"publisher":"Association for Computing Machinery (ACM)","issue":"3","funder":[{"name":"Major Key Project of PCL","award":["PCL2023A03"],"award-info":[{"award-number":["PCL2023A03"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Des. Autom. Electron. Syst."],"published-print":{"date-parts":[[2026,5,31]]},"abstract":"<jats:p>Placement is a critical and time-consuming step in very-large-scale integration (VLSI) design flow. As placement methods continue to be researched, they introduce more parameters, making current methods for configuring parameters heavily reliant on human experience for each design. This article proposes a novel cross-design parameter optimization method, iPO, to accelerate parameter tuning without human involvement in different placement engines (like iEDA-iPL and DREAMPlace). Specifically, we introduce a heuristic strategy called Constant Liar to accelerate parameter tuning, allowing us to optimize parameters concurrently on different machines. Our research indicates that optimizing parameters for every design is time-consuming. To address the inefficiency of parameter tuning, we propose a cross-design parameter transfer learning strategy. This strategy measures the cosine similarity between designs in collaboration with a graph embedding algorithm representing netlists and cells. Compared with DREAMPlace on ISPD2015 benchmarks, our method achieves average improvements of 9.8% in half-perimeter wirelength (HPWL) and 12.0% in route congestion. When compared with AutoDMP, iPO shows an average improvement of 11% in HPWL and 12.3% in congestion, along with a 3.49\u00d7 speed-up in the number of search iterations. Furthermore, we extended our experiments to the iEDA-28nm benchmarks, showing average improvements of 4.7%, 2.7% and 2.8% in HPWL, worst negative slack (WNS) and total negative slack (TNS), respectively, compared with iEDA-iPL. Finally, our ablation studies on parallelization demonstrate that using 10 parallel processes results in approximately an 18\u00d7 speed-up compared with using a single process.<\/jats:p>","DOI":"10.1145\/3747292","type":"journal-article","created":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T07:19:37Z","timestamp":1751613577000},"page":"1-29","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["iPO: Constant Liar Parameter Optimization for Placement with Representation and Transfer Learning"],"prefix":"10.1145","volume":"31","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-6514-2151","authenticated-orcid":false,"given":"Xinhua","family":"Lai","sequence":"first","affiliation":[{"name":"School of Computer Science & Technology, University of the Chinese Academy of Sciences","place":["Beijing, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9075-8007","authenticated-orcid":false,"given":"Miao","family":"Liu","sequence":"additional","affiliation":[{"name":"University of the Chinese Academy of Sciences","place":["Beijing, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7145-9391","authenticated-orcid":false,"given":"Xingquan","family":"Li","sequence":"additional","affiliation":[{"name":"Peng Cheng Laboratory","place":["Shenzhen, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9486-0970","authenticated-orcid":false,"given":"Yihang","family":"Qiu","sequence":"additional","affiliation":[{"name":"University of the Chinese Academy of Sciences","place":["Beijing, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-7995-3479","authenticated-orcid":false,"given":"Shijian","family":"Chen","sequence":"additional","affiliation":[{"name":"Peng Cheng Laboratory","place":["Shenzhen, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-1989-8909","authenticated-orcid":false,"given":"Xinhao","family":"Li","sequence":"additional","affiliation":[{"name":"University of the Chinese Academy of Sciences","place":["Beijing, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3994-1401","authenticated-orcid":false,"given":"Jungang","family":"Xu","sequence":"additional","affiliation":[{"name":"School of Computer Science & Technology, University of the Chinese Academy of Sciences","place":["Beijing, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,2,10]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/3400302.3415690"},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/3569052.3578923"},{"key":"e_1_3_1_4_2","first-page":"2546","volume-title":"Proceedings of the Advances in Neural Information Processing Systems","author":"Bergstra James","year":"2011","unstructured":"James Bergstra, R\u00e9mi Bardenet, Yoshua Bengio, and Bal\u00e1zs K\u00e9gl.2011. Algorithms for hyper-parameter optimization. In Proceedings of the Advances in Neural Information Processing Systems. 2546\u20132554."},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2008.923063"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2018.2859220"},{"key":"e_1_3_1_7_2","first-page":"16508","volume-title":"Proceedings of the Advances in Neural Information Processing Systems","volume":"34","author":"Cheng Ruoyu","year":"2021","unstructured":"Ruoyu Cheng and Junchi Yan. 2021. On joint learning for solving placement and routing in chip design. In Proceedings of the Advances in Neural Information Processing Systems, Vol. 34. Curran Associates, Inc., 16508\u201316519."},{"key":"e_1_3_1_8_2","first-page":"131","article-title":"Kriging is well-suited to parallelize optimization","volume":"2","author":"Ginsbourger David","year":"2010","unstructured":"David Ginsbourger, Rodolphe Le Riche, and Laurent Carraro. 2010. Kriging is well-suited to parallelize optimization. Computational Intelligence in Expensive Optimization Problems 2 (2010), 131\u2013162.","journal-title":"Computational Intelligence in Expensive Optimization Problems"},{"key":"e_1_3_1_9_2","first-page":"481","volume-title":"Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability","author":"Kuhn Albert William Tucker Harold William","year":"1950","unstructured":"Albert William Tucker Harold William Kuhn. 1950. Nonlinear programming. In Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability. 481\u2013492."},{"key":"e_1_3_1_10_2","doi-asserted-by":"crossref","unstructured":"Meng-Kai Hsu Valeriy Balabanov and Yao-Wen Chang. 2013. TSV-aware analytical placement for 3-D IC designs based on a novel weighted-average wirelength model. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 32 4 (2013) 497\u2013509.","DOI":"10.1109\/TCAD.2012.2226584"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISEDA62518.2024.10617562"},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/MLCAD52597.2021.9531313"},{"key":"e_1_3_1_13_2","unstructured":"Yao Lai Yao Mu and Ping Luo. 2022. MaskPlace: Fast chip placement via reinforced visual representation learning. In Proceedings of the Advances in Neural Information Processing Systems 35 (2022) 24019\u201324030."},{"key":"e_1_3_1_14_2","first-page":"1188","volume-title":"Proceedings of the International Conference on Machine Learning","author":"Le Quoc","year":"2014","unstructured":"Quoc Le and Tomas Mikolov. 2014. Distributed representations of sentences and documents. In Proceedings of the International Conference on Machine Learning. PMLR, 1188\u20131196."},{"key":"e_1_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.23919\/DATE58400.2024.10546848"},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/ASP-DAC58780.2024.10473983"},{"key":"e_1_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/ASP-DAC58780.2024.10473932"},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1145\/3316781.3317803"},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/CSTIC49141.2020.9282573"},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/2593069.2593133"},{"key":"e_1_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/2699873"},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2015.2391263"},{"key":"e_1_3_1_23_2","first-page":"6","volume-title":"Proceedings of the Advances in Neural Information Processing Systems","author":"Lu Yi-Chen","year":"2020","unstructured":"Yi-Chen Lu, Sai Pentapati, and Sung Kyu Lim. 2020. VLSI placement optimization using graph neural networks. In Proceedings of the Advances in Neural Information Processing Systems. 6\u201312."},{"key":"e_1_3_1_24_2","unstructured":"Tomas Mikolov Kai Chen Greg Corrado and Jeffrey Dean. 2013. Efficient estimation of word representations in vector space. In Proceedings of the International Conference on Learning Representations."},{"key":"e_1_3_1_25_2","unstructured":"Rajasekar Venkatesan Lihui Chen Yang Liu Annamalai Narayanan Mahinthan Chandramohan and Shantanu Jaiswal. 2017. graph2vec: Learning distributed representations of graphs. In Proceedings of the International Workshop on Mining and Learning with Graphs."},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1.13188"},{"key":"e_1_3_1_27_2","doi-asserted-by":"publisher","DOI":"10.1145\/3508352.3561093"},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00499"},{"key":"e_1_3_1_29_2","volume-title":"Computer Experiments and Global Optimization","author":"Schonlau Matthias","year":"1997","unstructured":"Matthias Schonlau. 1997. Computer Experiments and Global Optimization. Ph.D. Dissertation. University of Waterloo."},{"key":"e_1_3_1_30_2","volume-title":"Electronic Design Automation: Synthesis, Verification, and Test","author":"Wang Laung-Terng","year":"2009","unstructured":"Laung-Terng Wang, Yao-Wen Chang, and Kwang-Ting Tim Cheng. 2009. Electronic Design Automation: Synthesis, Verification, and Test. Morgan Kaufmann."},{"key":"e_1_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/ASP-DAC47756.2020.9045201"},{"key":"e_1_3_1_32_2","unstructured":"Jianan Zhao Meng Qu Chaozhuo Li Hao Yan Qian Liu Rui Li Xing Xie and Jian Tang. 2023. Learning on large-scale text-attributed graphs via variational inference. In Proceedings of the International Conference on Learning Representations."},{"key":"e_1_3_1_33_2","unstructured":"Fuzhen Zhuang Zhiyuan Qi Keyu Duan Dongbo Xi Yongchun Zhu Hengshu Zhu Hui Xiong and Qing He. 2020. A comprehensive survey on transfer learning. arXiv:1911.02685. Retrieved from https:\/\/arxiv.org\/abs\/1911.02685"}],"container-title":["ACM Transactions on Design Automation of Electronic Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3747292","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T13:55:10Z","timestamp":1770731710000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3747292"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,10]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,5,31]]}},"alternative-id":["10.1145\/3747292"],"URL":"https:\/\/doi.org\/10.1145\/3747292","relation":{},"ISSN":["1084-4309","1557-7309"],"issn-type":[{"value":"1084-4309","type":"print"},{"value":"1557-7309","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,10]]},"assertion":[{"value":"2024-08-28","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-04-30","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-02-10","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}