aspireai.
PUBLIC EDITION

An LLM agent taught itself the gm/ID method and designed six opamps in SKY130 that stayed DRC-clean and LVS-matched at all 15 PVT corners

AspireAI community · arXiv (submitted to ISCAS 2027)
Analog design normally runs from specification to signed-off layout by hand, with LLM agents typically sizing circuits through optimizer loops and stopping at the schematic. OPERA instead has a general-purpose agent learn the gm/ID method from a designer, choose per-device transconductance and minimum currents from characterized lookup tables, and size from equations with a few knobs left to search, then write a reusable layout generator that closes the layout and extraction loop at designer-approved gates. In SKY130 it designed a shared constant-gm bias and six opamps (5T, folded-cascode and telescopic OTAs, plus Miller, folded-cascode and telescopic two-stage) for f-units at or above 50 MHz, phase margin at or above 60 degrees, slew rate of 25 V/microsecond into 1 pF and minimum dc gain of 30 to 60 dB. All six layouts came out DRC-clean and LVS-matched, and the extracted netlists met every target at all 15 PVT corners, with f-units at or above 53.7 MHz, phase margin at or above 62.1 degrees and slew rate at or above 27.9 V/microsecond; the benchmark netlists are released.
Read the story and explore more from the AspireAI community.
Discover more stories
Stay curious.
THE BIG PICTURE
A FRESH PERSPECTIVE
Research
One distance function matched sparse-autoencoder features across layers and compressed feature circuits into supernodes
Two sparse-autoencoder analyses have resisted scaling: matching semantically similar features across layers, and compressing large feature circuits into interpretable supernodes. This paper argues both are the same underlying problem, estimating semantic distances between SAE features that sit on different activation manifolds. Its representation treats each feature not as a single decoder vector but as an activation-weighted distribution over the hidden states expressing it, projects those distributions into a shared reference space, and compares them with Wasserstein distance. The representation is proved invariant to activation rescaling and stable under perturbation, and recovers true matches under finite-sample margin conditions. Empirically it outperformed decoder-vector and LLM-based baselines and captured subtle functional distinctions between related features, and it compressed large feature circuits into interpretable supernodes automatically. The limitation is that this is interpretability tooling: the paper demonstrates better feature matching and circuit compression, not that downstream interpretability claims become more accurate.
Swipe into something new
01 / 1729
The conversation continues
Explore Builds — projects by Kiran Adimatyam ↗
A fresh perspective changes everything.
ASPIREAI — STAY CURIOUS.