Improving Routability Prediction via NAS Using a Smooth One-shot Augmented Predictor
Routability optimization in modern EDA tools has benefited greatly from using machine learning (ML) models. Constructing and optimizing the performance of ML models continues to be a challenge. Neural Architecture Search (NAS) serves as a tool to aid in the construction and improvement of these models. Traditional NAS techniques struggle to perform well on routability prediction as a result of two primary factors. First, the separation between the training objective and the search objective adds noise to the NAS process. Secondly, the increased variance of the search objective further complicates performing NAS. We craft a novel NAS technique, coined SOAP-NAS, to address these challenges through novel data augmentation techniques and a novel combination of one-shot and predictor-based NAS. Results show that our technique outperforms existing solutions by 40% closer to the ideal performance measured by ROC-AUC (area under the receiver operating characteristic curve) in DRC hotspot detection. SOAPNet is able to achieve an ROC-AUC of 0.9802 and a query time of only 0.461 ms.
Code (0)
등록된 구현이 없습니다.
Tasks
Data AugmentationNeural Architecture SearchSimilar Papers 제목 키워드 기반
Automatic Routability Predictor Development Using Neural Architecture Search
The rise of machine learning technology inspires a boom of its applications in electronic design automation (EDA) and helps improve the degree of automation in chip designs. However, manually crafted machine learning mod…
BIG-bench Machine LearningNeural Architecture SearchRoutePlacer: An End-to-End Routability-Aware Placer with Graph Neural Network
Placement is a critical and challenging step of modern chip design, with routability being an essential indicator of placement quality. Current routability-oriented placers typically apply an iterative two-stage approach…
Graph Neural NetworkLearning Augmented Exact Exponential Algorithms
The field of learning-augmented algorithms has demonstrated that machine-learned predictions can bypass worst-case lower bounds across a wide range of problems. So far, however, the focus has been almost exclusively on p…
Attention Routing: track-assignment detailed routing using attention-based reinforcement learning
In the physical design of integrated circuits, global and detailed routing are critical stages involving the determination of the interconnected paths of each net on a circuit while satisfying the design constraints. Exi…
reinforcement-learningReinforcement LearningReinforcement Learning (RL)The Importance of Being Smoothly Calibrated
Recent work has highlighted the centrality of smooth calibration [Kakade and Foster, 2008] as a robust measure of calibration error. We generalize, unify, and extend previous results on smooth calibration, both as a robu…