Transferable Parasitic Estimation via Graph Contrastive Learning and Label Rebalancing in AMS Circuits

2025-07-09 · Shan Shen, Shenglu Hua, Jiajun Zou, Jiawei Liu, Jianwang Zhai, Chuan Shi, Wenjian Yu 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 $R^2$ improvement of $33.64\% \sim 44.20\%$ for edge regression and F1-score gain of $0.9\times \sim 2.1\times$ for node classification. Our code is available at https://github.com/ShenShan123/CircuitGCL.

📄 PDF Abstract BibTeX arXiv:2507.06535

Code (0)

등록된 구현이 없습니다.

Tasks

Graph Representation Learning Contrastive Learning Node Classification

ParasGB: A Graph Benchmark Suite for Parasitic Estimation on AMS Circuits

2026-07-25 · Jiajun Zou, Jiawei Liu, Ao Liu, Junnong Tian 외 arxiv

As chip manufacturing processes advance to deep submicron nodes, parasitic interconnect effects increasingly dominate the performance of analog and mixed-signal (AMS) circuits and often lead to costly layout iterations. …

Parameter Prediction Graph Learning

Augment with Care: Contrastive Learning for Combinatorial Problems

2022-02-17 · Haonan Duan, Pashootan Vaezipoor, Max B. Paulus, Yangjun Ruan 외

Supervised learning can improve the design of state-of-the-art solvers for combinatorial problems, but labelling large numbers of combinatorial instances is often impractical due to exponential worst-case complexity. Ins…

Contrastive Learning

CCGL: Contrastive Cascade Graph Learning

2021-07-27 · Xovee Xu, Fan Zhou, Kunpeng Zhang, Siyuan Liu

Supervised learning, while prevalent for information cascade modeling, often requires abundant labeled data in training, and the trained model is not easy to generalize across tasks and datasets. It often learns task-spe…

Data Augmentation Graph Learning Graph Representation Learning Information Cascade Popularity Prediction+2

Deep-Learning-Based Pre-Layout Parasitic Capacitance Prediction on SRAM Designs

2025-07-09 · Shan Shen, Dingcheng Yang, Yuyang Xie, Chunyan Pei 외 arxiv

To achieve higher system energy efficiency, SRAM in SoCs is often customized. The parasitic effects cause notable discrepancies between pre-layout and post-layout circuit simulations, leading to difficulty in converging …

Graph Neural Network

Few-shot Message-Enhanced Contrastive Learning for Graph Anomaly Detection

2023-11-17 · Fan Xu, Nan Wang, Xuezhi Wen, Meiqi Gao 외

Graph anomaly detection plays a crucial role in identifying exceptional instances in graph data that deviate significantly from the majority. It has gained substantial attention in various domains of information security…

Anomaly Detection Contrastive Learning Graph Anomaly Detection