atlas

Research map / Graph learning / Graph self-supervised learning

AnalogGenie-Lite: Enhancing Scalability and Precision in Circuit Topology Discovery through Lightweight Graph Modeling

ICML 2025 · Graph learning › Graph self-supervised learning · approach: Diffusion-based graph generation

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes AnalogGenie-Lite, a small decoder-only transformer that generates analog circuit topologies using a pruned device-pin graph, mined frequent subgraph tokens, and Chinese Postman Eulerian sequences, improving scalability and validity over prior methods.

Problem

Generating novel analog IC topologies is hard: text and prior graph representations are error-prone, scale poorly with device count, and produce long sequences that limit transformer-based generation.

Approach

Combines three lightweight graph-modeling steps: removing device-self nodes and using n-1 edges for shared nets (O(n) instead of O(n^2)), mining frequent subgraphs with gSpan and replacing them with pin tokens, and encoding the circuit as a Chinese Postman (minimum-duplication Eulerian) closed walk.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Replace AnalogGenie's graph representation with lightweight graph pruning (ablation)AnalogGenie-Lite · Analog circuit topology generationvalidity (%): 73.5 -> 80.1Helped
Add frequent-subgraph mining and subgraph simplification (ablation)AnalogGenie-Lite (Graph) · Analog circuit topology generationvalidity (%): 80.1 -> 87.3Helped
Use optimal Chinese Postman sequence modeling (ablation)AnalogGenie-Lite (Graph+Subgraph) · Analog circuit topology generationvalidity (%): 87.3 -> 97Helped
Use lightweight graph pruning, frequent-subgraph simplification, and optimal sequence modelingAnalogGenie-Lite · Analog circuit topology generationscalability (devices): 63 -> 324Helped
Use lightweight graph pruning, frequent-subgraph simplification, and optimal sequence modelingAnalogGenie-Lite · Analog circuit topology generationvalidity (%): 73.5 -> 97Helped
Add frequent-subgraph mining and subgraph simplification (ablation)AnalogGenie-Lite (Graph) · Analog circuit topology generationscalability (devices): 183 -> 227Helped
Use optimal Chinese Postman sequence modeling (ablation)AnalogGenie-Lite (Graph+Subgraph) · Analog circuit topology generationscalability (devices): 227 -> 324Helped
Use lightweight graph pruning, frequent-subgraph simplification, and optimal sequence modelingAnalogGenie-Lite · Op-AmpFoM: 13744.8 -> 15017.7Helped
Use lightweight graph pruning, frequent-subgraph simplification, and optimal sequence modelingAnalogGenie-Lite · Power converterFoM: 3.3 -> 4.02Helped
Use lightweight graph pruning, frequent-subgraph simplification, and optimal sequence modelingAnalogGenie-Lite · Analog circuit topology generationMMD: 0.0532 -> 0.0408Helped

Surprising findings

Limitations

Experimental setup

Datasets: AnalogGenie circuit topology database (3350 topologies, 11 types) protein graphs ego graphs community graphs molecule graphs 3D point cloud graphs

Benchmarks: analog circuit topology generation validity/scalability/novelty/performance on 3350-topology database cross-domain graph compression on protein, ego, community, molecule, 3D point cloud graphs

Metrics: validity scalability (max devices) versatility novelty (diff circuit %) MMD FoM sequence compression ratio

Baselines: AnalogCoder Artisan CktGNN LaMAGIC AnalogGenie

Builds on: AnalogGenie gSpan Chinese Postman Problem

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy