Expertise Can Be Helpful for Reinforcement Learning-based Macro Placement
Chengrui Gao, Yunqi Shi, Ke Xue, Ruo-Tong Chen, Siyuan Xu, Mingxuan Yuan, Chao Qian, Zhi-Hua Zhou
Abstract
Chip placement determines the locations of electronic components on a chip layout, which directly impacts performance, power, and area (PPA) metrics, and thus is a critical step in electronic design automation (EDA). As modern chips scale to accommodate millions of components, manual placement by human experts becomes infeasible, necessitating the use of automated algorithms. Recently, reinforcement learning (RL) has emerged as a promising approach for automating macro placement, owing to its high optimization efficiency and potential for generalization. Despite their promise, existing RL-based methods often neglect the value of expert knowledge accumulated through years of engineering practice. They tend to optimize oversimplified proxy objectives, resulting in suboptimal placements that deviate significantly from expert-designed solutions. To bridge this gap, we propose a novel RL-based placement framework that integrates EDA domain expertise from two complementary perspectives: (1) Expert Knowledge Injection: Incorporating well-established placement knowledge, such as dataflow guidance, periphery bias, macro grouping, and I/O keepout constraints, to guide the learning process toward human-level solutions. (2) Expert Workflow Imitation: Emulating the post-refinement process of human experts (i.e., updating the design iteratively based on backend PPA feedback) to progressively optimize timing metrics by employing preference optimization. Experiments on the ICCAD 2015 and OpenROAD benchmarks demonstrate that our method achieves substantial improvements in PPA metrics (e.g., 32.53% in total negative slack and 7.74% in worst negative slack compared to the runner-up method on average), outperforming advanced analytical, black-box optimization, and RL-based methods.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext d21b6825-e159-4752-84af-1b37242c1e06Cited by top-tier papers1
Ask how each one uses itBuilds on11
- Direct Preference Optimization: Your Language Model is Secretly a Reward ModelRafael Rafailov, Archit Sharma, Eric Mitchell, Christopher D. Manning et al.NeurIPS 2023 · 10,924 citations
- On Joint Learning for Solving Placement and Routing in Chip DesignRuoyu Cheng, Junchi YanNeurIPS 2021 · 135 citations
- MaskPlace: Fast Chip Placement via Reinforced Visual Representation LearningYao Lai, Yao Mu, Ping LuoNeurIPS 2022 · 105 citations
- ChiPFormer: Transferable Chip Placement via Offline Decision TransformerYao Lai, Jinxin Liu, Zhentao Tang, Bin Wang et al.ICML 2023 · 69 citations
- The Policy-gradient Placement and Generative Routing Neural Networks for Chip DesignRuoyu Cheng, Xianglong Lyu, Yang Li, Junjie Ye et al.NeurIPS 2022 · 59 citations
Related papers
- Reinforcement Learning Policy as Macro Regulator Rather than Macro PlacerKe Xue, Ruo-Tong Chen, Xi Lin, Yunqi Shi et al.NeurIPS 2024 · 19 citations
- Reinforcement Learning within Tree Search for Fast Macro PlacementZijie Geng, Jie Wang, Ziyan Liu, Siyuan Xu et al.ICML 2024 · 23 citations
- Towards Automated RISC-V Microarchitecture Design with Reinforcement LearningChen Bai, Jianwang Zhai, Yuzhe Ma, Bei Yu et al.AAAI 2024 · 20 citations
- RSPlace: Rotation Sensing Macro Placement via Bidirectional Tree ExpansionTianyi Liu, Yaxin Xu, Lin Geng, Ningzhong Liu et al.AAAI 2026
- EGPlace: An Efficient Macro Placement Method via Evolutionary Search with Greedy Repositioning Guided MutationJi Deng, Zhao Li, Ji Zhang, Jun GaoICML 2025
