GCN-RL Circuit Designer: Transferable Transistor Sizing with Graph Neural Networks and Reinforcement Learning
Hanrui Wang,Kuan Wang,Jiacheng Yang,Linxiao Shen,Nan Sun,Hae-Seung Lee,Song Han +6 more
- 20 Jul 2020
- pp 1-6
TL;DR: In this paper, a graph convolutional neural network (GCN) based circuit designer was proposed to transfer the knowledge between different technology nodes and topologies, inspired by the simple fact that circuit is a graph.
read more
Abstract: Automatic transistor sizing is a challenging problem in circuit design due to the large design space, complex performance tradeoffs, and fast technology advancements. Although there have been plenty of work on transistor sizing targeting on one circuit, limited research has been done on transferring the knowledge from one circuit to another to reduce the re-design overhead. In this paper, we present GCN-RL Circuit Designer, leveraging reinforcement learning (RL) to transfer the knowledge between different technology nodes and topologies. Moreover, inspired by the simple fact that circuit is a graph, we learn on the circuit topology representation with graph convolutional neural networks (GCN). The GCN-RL agent extracts features of the topology graph whose vertices are transistors, edges are wires. Our learning-based optimization consistently achieves the highest Figures of Merit (FoM) on four different circuits compared with conventional black box optimization methods (Bayesian Optimization, Evolutionary Algorithms), random search and human expert designs. Experiments on transfer learning between five technology nodes and two circuit topologies demonstrate that RL with transfer learning can achieve much higher FoMs than methods without knowledge transfer. Our transferable optimization method makes transistor sizing and design porting more effective and efficient.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Pretraining Graph Neural Networks for few-shot Analog Circuit Modeling and Design
TL;DR: In this article , a supervised pretraining approach is proposed to learn circuit representations that can be adapted to new circuit topologies or unseen prediction tasks, which can be useful for few-shot generalization to unseen circuit metrics.
Fast Surrogate-assisted Constrained Multi-objective Optimization for Analog Circuit Sizing via Self-adaptive Incremental Learning
TL;DR: In this article , an efficient surrogate-assisted constrained multi-objective evolutionary algorithm for analog circuit sizing via self-adaptive incremental learning is proposed, which reduces the total optimization time in four aspects: by reusing the previously trained models, the incremental learning technique is introduced to reduce the time complexity of training the Kriging model from O(n3) to O (n2), where n is the number of training points.
15
A Comprehensive Survey on Distributed Training of Graph Neural Networks
Haiyang Lin,Mingyu Yan,Xiaochun Ye,Dongrui Fan,Shirui Pan,Wenguang Chen,Yuan Xie +6 more
TL;DR: A comprehensive survey on distributed training of graph neural networks covering various optimization techniques, workflows, computational patterns, communication patterns, frameworks, and hardware platforms.
AnGeL: Fully-Automated Analog Circuit Generator Using a Neural Network Assisted Semi-Supervised Learning Approach
TL;DR: A database including labeled and unlabeled data is presented including a fully-automated analog circuit generator framework, AnGeL, which performs all the schematic circuit design steps from deciding the circuit topology to determining the circuit parameters i.e. sizing.
14
High-Dimensional Bayesian Optimization for Analog Integrated Circuit Sizing Based on Dropout and g<sub>m</sub>/I<sub>D</sub> Methodology
TL;DR: In this paper , the authors proposed a new Bayesian optimization (cBO) algorithm, which can scale BO to more larger scale circuit and improve the optimization result, according to the fact that a specification of the analog integrated circuit is mainly determined by a few transistors.
14
References
•Posted Content
Semi-Supervised Classification with Graph Convolutional Networks
Thomas Kipf,Max Welling +1 more
TL;DR: A scalable approach for semi-supervised learning on graph-structured data that is based on an efficient variant of convolutional neural networks which operate directly on graphs which outperforms related methods by a significant margin.
22.7K
Graph Attention Networks
Petar Veličković,Guillem Cucurull,Arantxa Casanova,Adriana Romero,Pietro Liò,Yoshua Bengio +5 more
- 15 Feb 2018
TL;DR: Graph Attention Networks (GATs) as mentioned in this paper leverage masked self-attentional layers to address the shortcomings of prior methods based on graph convolutions or their approximations.
•Proceedings Article
Semi-Supervised Classification with Graph Convolutional Networks
Thomas Kipf,Max Welling +1 more
- 09 Sep 2016
TL;DR: In this paper, a scalable approach for semi-supervised learning on graph-structured data is presented based on an efficient variant of convolutional neural networks which operate directly on graphs.
Mastering the game of Go without human knowledge
David Silver,Julian Schrittwieser,Karen Simonyan,Ioannis Antonoglou,Aja Huang,Arthur Guez,Thomas Hubert,Lucas Baker,Matthew Lai,Adrian Bolton,Yutian Chen,Timothy P. Lillicrap,Fan Hui,Laurent Sifre,George van den Driessche,Thore Graepel,Demis Hassabis +16 more
TL;DR: An algorithm based solely on reinforcement learning is introduced, without human data, guidance or domain knowledge beyond game rules, that achieves superhuman performance, winning 100–0 against the previously published, champion-defeating AlphaGo.
The Graph Neural Network Model
TL;DR: A new neural network model, called graph neural network (GNN) model, that extends existing neural network methods for processing the data represented in graph domains, and implements a function tau(G,n) isin IRm that maps a graph G and one of its nodes n into an m-dimensional Euclidean space.