Transferable Parasitic Estimation via Graph Contrastive Learning and Label Rebalancing in AMS Circuits
Not on the map. Why?
Abstract (arXiv)
Graph representation learning on Analog-Mixed Signal (AMS) circuits is crucial for various downstream tasks, e.g., parasitic estimation. However, the scarcity of design data, the unbalanced distribution of labels, and the inherent diversity of circuit implementations pose significant challenges to learning robust and transferable circuit representations. To address these limitations, we propose CircuitGCL, a novel graph contrastive learning framework that integrates representation scattering and label rebalancing to enhance transferability across heterogeneous circuit graphs. CircuitGCL employs a self-supervised strategy to learn topology-invariant node embeddings through hyperspherical representation scattering, eliminating dependency on large-scale data. Simultaneously, balanced mean squared error (BMSE) and balanced softmax cross-entropy (BSCE) losses are introduced to mitigate label distribution disparities between circuits, enabling robust and transferable parasitic estimation. Evaluated on parasitic capacitance estimation (edge-level task) and ground capacitance classification (node-level task) across TSMC 28nm AMS designs, CircuitGCL outperforms all state-of-the-art (SOTA) methods, with the R2 improvement of 33.64% ~ 44.20% for edge regression and F1-score gain of 0.9× ~ 2.1× for node classification. Our code is available at https://github.com/ShenShan123/CircuitGCL.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 26 of its 43 references that are in the map. First posted on arXiv 9 Jul 2025.
Builds on
26 of 43 references.
References · 26
- 2017Inductive Representation Learning on Large Graphscited by 6,320
- 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,434
- 2020Graph Contrastive Learning with Augmentationscited by 1,208
- 2018Deep Graph Infomaxcited by 1,106
- 2019Learning Imbalanced Datasets with Label-Distribution-Aware Margin Losscited by 989
- 2019Decoupling Representation and Classifier for Long-Tailed Recognitioncited by 809
- 2019Large-Scale Long-Tailed Recognition in an Open Worldcited by 705
- 2020Contrastive Multi-View Representation Learning on Graphscited by 652
- 2020Long-tail learning via logit adjustmentcited by 618
- 2019Cluster-GCN: An Efficient Algorithm for Training Deep and Large Graph Convolutional Networkscited by 541
- 2020Deep Graph Contrastive Representation Learningcited by 539
- 2020Graph Contrastive Learning with Adaptive Augmentationcited by 519
14 more
- 2019BBN: Bilateral-Branch Network with Cumulative Learning for Long-Tailed Visual Recognitioncited by 403
- 2020Balanced Meta-Softmax for Long-Tailed Visual Recognitioncited by 400
- 2020Long-tailed Recognition by Routing Diverse Distribution-Aware Expertscited by 271
- 2018What is the Effect of Importance Weighting in Deep Learning?cited by 251
- 2020Disentangling Label Distribution for Long-tailed Visual Recognitioncited by 172
- 2021Delving into Deep Imbalanced Regressioncited by 158
- 2021Augmentation-Free Self-Supervised Learning on Graphscited by 94
- 2022Balanced MSE for Imbalanced Visual Regressioncited by 89
- 2021ProGCL: Rethinking Hard Negative Mining in Graph Contrastive Learningcited by 72
- 2022Rethinking and Scaling Up Graph Contrastive Learning: An Extremely Efficient Approach with Group Discriminationcited by 69
- 2021Understanding the role of importance weighting for deep learningcited by 39
- 2023Rethinking and Simplifying Bootstrapped Graph Latentscited by 10
- 2019TS Cache: A Fast Cache with Timing-speculation Mechanism Under Low Supply Voltagescited by 3
- 2023Ultra8T: A Sub-Threshold 8T SRAM with Leakage Detectioncited by 3
Built on by
Citing papers per year: 2026: 1.
1 paper.