mlsanityData to 7 Oct 2026

NeuroSteiner: A Graph Transformer for Wirelength Estimation

arXiv 2407.03792 ↗First posted 4 Jul 2024cs.LG stat.MLcited by 0

Not on the map. Why?

Abstract (arXiv)

A core objective of physical design is to minimize wirelength (WL) when placing chip components on a canvas. Computing the minimal WL of a placement requires finding rectilinear Steiner minimum trees (RSMTs), an NP-hard problem. We propose NeuroSteiner, a neural model that distills GeoSteiner, an optimal RSMT solver, to navigate the cost--accuracy frontier of WL estimation. NeuroSteiner is trained on synthesized nets labeled by GeoSteiner, alleviating the need to train on real chip designs. Moreover, NeuroSteiner's differentiability allows to place by minimizing WL through gradient descent. On ISPD 2005 and 2019, NeuroSteiner can obtain 0.3% WL error while being 60% faster than GeoSteiner, or 0.2% and 30%.

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

Builds on

10 of 27 references.

References · 10

  1. 2017Attention Is All You Needcited by 59,932
  2. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  3. 2018How Powerful are Graph Neural Networks?cited by 4,355
  4. 2018Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networkscited by 878
  5. 2022Recipe for a General, Powerful, Scalable Graph Transformercited by 702
  6. 2018Attention, Learn to Solve Routing Problems!cited by 646
  7. 2018Machine Learning for Combinatorial Optimization: a Methodological Tour d'Horizoncited by 612
  8. 2017Learning Combinatorial Optimization Algorithms over Graphscited by 557
  9. 2019Exact Combinatorial Optimization with Graph Convolutional Neural Networkscited by 313
  10. 2020Learning the Travelling Salesperson Problem Requires Rethinking Generalizationcited by 96

Built on by

Not cited yet.