mlsanityData to 14 Oct 2026

CoEvoP&R: Co-Evolving Placement Objectives with Routing Feedback via Large Language Models

arXiv 2607.17398 ↗First posted 19 Jul 2026cs.LG cs.AI cs.NEcited by 0

Not on the map. Why?

Abstract (arXiv)

Analytical placers rely on differentiable objective functions to guide placement, typically combining intermediate surrogate metrics such as half-perimeter wirelength (HPWL) and cell-density penalties. However, these placement-stage surrogates remain misaligned with downstream routed and timing quality. Prior work reduces this gap with human-designed terms or learned black-box surrogates, but the former requires expert retuning and the latter is difficult to explain, debug, or deploy in analytical placement flows. CoEvoP&R addresses these limitations with a large language model (LLM)-based framework that automatically evolves analytical placement objectives. At each generation, the prompt combines the restricted objective interface, baseline context, and archived prior candidates with routing-related feedback from placement, timing proxy, and routing tools. The LLM proposes readable differentiable objectives, which are embedded and validated in DREAMPlace, evaluated through a timing proxy and an actual router, and stored with their feedback to guide later generations. Across eight ChiP-Bench Nangate45 designs and three seeds, CoEvoP&R reduces post-route routed wirelength and congestion by 16.9% and 36.7%, with gains of 0.70 ns in worst negative slack and a 912 ns reduction in total negative slack magnitude over native DREAMPlace. Across eight ICCAD 2015 Superblue designs, it reduces post-route routed wirelength and congestion by 5.4% and 23.2%. Code is available at https://github.com/FCHXWH823/CoEvoP-R.git.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 1 of its 27 references that are in the map. First posted on arXiv 19 Jul 2026.

Builds on

1 of 27 references.

References · 1

  1. 2024Benchmarking End-To-End Performance of AI-Based Chip Placement Algorithmscited by 14

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2026LLM Router: Rethinking Routing with Prefill Activations
  2. 2026From Sampled Outcomes to Capability Distributions: Rethinking Supervision for LLM Routing
  3. 2026TwinRouterBench: Fast Static and Live Dynamic Evaluation for Realistic Agentic LLM Routing
  4. 2026See it to Place it: Evolving Macro Placements with Vision-Language Models
  5. 2026CLDRoute: Conditional Latent Diffusion for Routability Map Generation in Physical Design
  6. 2026RouteWeaver: Weaving Mode Selection and Execution into Unified LLM Routing
  7. 2025GridRoute: A Benchmark for LLM-Based Route Planning with Cardinal Movement in Grid Environments
  8. 2026RLCascadeRouter: Quality-Estimator-Free Cascade Routing via Reinforcement Learning