mlsanityData to 14 Oct 2026

PPAPlace: Differentiable Cross-Stage Objectives for Chip Placement Optimization

arXiv 2608.13790 ↗First posted 13 Aug 2026cs.LG cs.AI cs.ARcited by 0

Not on the map. Why?

Abstract (arXiv)

Macro placement significantly affects a chip's post-route performance, power, and area (PPA). Most placement methods optimize half-perimeter wirelength (HPWL) as the primary objective. However, recent benchmarking shows a near-zero correlation between HPWL and post-route timing metrics such as the worst negative slack (WNS) and total negative slack (TNS). As a result, all six evaluated artificial intelligence (AI) placers degraded PPA relative to the hierarchical baseline. Recent efforts have tried to train cross-stage predictors to close this gap. However, existing methods focus on macro-only representations and use pre-route metrics as training labels. A label fidelity study of ten circuits at four design flow stages reveals that HPWL and pre-route timing poorly reflect final post-route timing rankings. In contrast, post-global-routing achieves the best balance between final timing fidelity and label generation cost-effectiveness. Based on this finding, PPAPlace is a timing-driven differentiable surrogate predicting post-route PPA from macro and standard-cell placements. The surrogate is a dual-stream predictor that combines graph attention over the chip netlist with spatial convolution over the placement grid. It is trained on post-global-routing labels. The predicted WNS and TNS gradients flow end-to-end back to cell coordinates. PPAPlace exploits these gradients in two ways: as a co-objective injected into an analytical placer's optimization loop (PPAPlace-CoOpt), and as a post-placement refinement step that adjusts macro positions via projected gradient descent (PPAPlace-Refine). On five ChiPBench test circuits excluded from training, PPAPlace improves average WNS and TNS by 22% and 51% over the hierarchical baseline while preserving power and routability, using the same predictor without test-circuit retraining. Code is available at https://github.com/ValleyC/PPAPlace.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 9 of its 28 references that are in the map. First posted on arXiv 13 Aug 2026.

Builds on

9 of 28 references.

References · 9

  1. 2017Graph Attention Networkscited by 8,923
  2. 2022MaskPlace: Fast Chip Placement via Reinforced Visual Representation Learningcited by 43
  3. 2023ChiPFormer: Transferable Chip Placement via Offline Decision Transformercited by 42
  4. 2023Macro Placement by Wire-Mask-Guided Black-Box Optimizationcited by 23
  5. 2024Benchmarking End-To-End Performance of AI-Based Chip Placement Algorithmscited by 14
  6. 2023Hier-RTLMP: A Hierarchical Automatic Macro Placer for Large-scale Complex IP Blockscited by 11
  7. 2024Reinforcement Learning Policy as Macro Regulator Rather than Macro Placercited by 10
  8. 2024Chip Placement with Diffusion Modelscited by 5
  9. 2025BBOPlace-Bench: Benchmarking Black-Box Optimization for Chip Placementcited by 5

Built on by

Not cited yet.