mlsanityData to 7 Oct 2026

Reinforcement Learning Policy as Macro Regulator Rather than Macro Placer

arXiv 2412.07167 ↗First posted 10 Dec 2024cs.LG cs.AIcited by 10

Not on the map. Why?

Abstract (arXiv)

In modern chip design, placement aims at placing millions of circuit modules, which is an essential step that significantly influences power, performance, and area (PPA) metrics. Recently, reinforcement learning (RL) has emerged as a promising technique for improving placement quality, especially macro placement. However, current RL-based placement methods suffer from long training times, low generalization ability, and inability to guarantee PPA results. A key issue lies in the problem formulation, i.e., using RL to place from scratch, which results in limits useful information and inaccurate rewards during the training process. In this work, we propose an approach that utilizes RL for the refinement stage, which allows the RL policy to learn how to adjust existing placement layouts, thereby receiving sufficient information for the policy to act and obtain relatively dense and precise rewards. Additionally, we introduce the concept of regularity during training, which is considered an important metric in the chip design industry but is often overlooked in current RL placement methods. We evaluate our approach on the ISPD 2005 and ICCAD 2015 benchmark, comparing the global half-perimeter wirelength and regularity of our proposed method against several competitive approaches. Besides, we test the PPA performance using commercial software, showing that RL as a regulator can achieve significant PPA improvements. Our RL regulator can fine-tune placements from any method and enhance their quality. Our work opens up new possibilities for the application of RL in placement, providing a more effective and efficient approach to optimizing chip design. Our code is available at urlhttps://github.com/lamda-bbo/macro-regulator.

Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). Builds on 7 of its 35 references that are in the map. First posted on arXiv 10 Dec 2024.

Builds on

7 of 35 references.

References · 7

  1. 2017Proximal Policy Optimization Algorithmscited by 14,441
  2. 2021On Joint Learning for Solving Placement and Routing in Chip Designcited by 44
  3. 2022MaskPlace: Fast Chip Placement via Reinforced Visual Representation Learningcited by 43
  4. 2023ChiPFormer: Transferable Chip Placement via Offline Decision Transformercited by 42
  5. 2023Macro Placement by Wire-Mask-Guided Black-Box Optimizationcited by 23
  6. 2020Placement in Integrated Circuits using Cyclic Reinforcement Learning and Simulated Annealingcited by 11
  7. 2024Escaping Local Optima in Global Placementcited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 3; 2026: 7.

10 papers.