mlsanityData to 14 Oct 2026

Escaping Local Optima in Global Placement

arXiv 2402.18311 ↗First posted 28 Feb 2024cs.LG cs.NEcited by 2

Not on the map. Why?

Abstract (arXiv)

Placement is crucial in the physical design, as it greatly affects power, performance, and area metrics. Recent advancements in analytical methods, such as DREAMPlace, have demonstrated impressive performance in global placement. However, DREAMPlace has some limitations, e.g., may not guarantee legalizable placements under the same settings, leading to fragile and unpredictable results. This paper highlights the main issue as being stuck in local optima, and proposes a hybrid optimization framework to efficiently escape the local optima, by perturbing the placement result iteratively. The proposed framework achieves significant improvements compared to state-of-the-art methods on two popular benchmarks.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 4 of its 21 references that are in the map. First posted on arXiv 28 Feb 2024.

Builds on

4 of 21 references.

References · 4

  1. 2014Identifying and attacking the saddle point problem in high-dimensional non-convex optimizationcited by 289
  2. 2017How to Escape Saddle Points Efficientlycited by 285
  3. 2017Gradient Descent Can Take Exponential Time to Escape Saddle Pointscited by 74
  4. 2022MaskPlace: Fast Chip Placement via Reinforced Visual Representation Learningcited by 43

Built on by

Cited by year

Citing papers per year: 2024: 1; 2025: 1.

2 papers.