Schemato - An LLM for Netlist-to-Schematic Conversion

• URL: http://arxiv.org/abs/2411.13899v2
• Date: Mon, 02 Jun 2025 09:43:49 GMT
• Title: Schemato - An LLM for Netlist-to-Schematic Conversion
• Abstract summary: We present a large language model (LLM) for netlist-to-schematic conversion.<n>In particular, we consider our approach in converting netlists to.asc files, text-based schematic description used in LTSpice.<n>Experiments show thatSpiceto generates schematics with an average graph edit distance score and mean structural similarity index measure, scaled by the compilation success rate that are 1.8x and 4.3x higher than the best performing LLMs respectively.
• Score: 5.419903684361424
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Machine learning models are advancing circuit design, particularly in analog circuits. They typically generate netlists that lack human interpretability. This is a problem as human designers heavily rely on the interpretability of circuit diagrams or schematics to intuitively understand, troubleshoot, and develop designs. Hence, to integrate domain knowledge effectively, it is crucial to translate ML-generated netlists into interpretable schematics quickly and accurately. We propose Schemato, a large language model (LLM) for netlist-to-schematic conversion. In particular, we consider our approach in converting netlists to .asc files, text-based schematic description used in LTSpice. Experiments on our circuit dataset show that Schemato achieves up to 76% compilation success rate, surpassing 63% scored by the state-of-the-art LLMs. Furthermore, our experiments show that Schemato generates schematics with an average graph edit distance score and mean structural similarity index measure, scaled by the compilation success rate that are 1.8x and 4.3x higher than the best performing LLMs respectively, demonstrating its ability to generate schematics that are more accurately connected and are closer to the reference human design.

Related papers

• Weave: Verified Netlist-to-Schematic Conversion via Layered Graph Layout [0.0]
  We present Weave, a deterministic converter that turns a SPICE netlist into an LTspice.<n>asc schematic using a layered (Sugiyama-style) graph layout.<n>We achieve 100% compilation and 100% round-trip-verified connectivity equivalence.
  arXiv  Detail & Related papers  (2026-07-04T11:58:29Z)
• SINA: A Fully Automated Circuit Schematic Image to Netlist Generator Using Artificial Intelligence [0.0]
  We propose SINA, an open-source circuit schematic image-to-netlist generator.<n> SINA handles both IC- and PCB-level schematics and incorporates dedicated crossing-wires detection.<n>Our experiments demonstrate an overall netlist generation accuracy of 96.67%, which is 2.72x higher compared to state-of-the-art approaches.
  arXiv  Detail & Related papers  (2026-07-02T02:24:00Z)
• SchGen: PCB Schematic Generation with Semantic-Grounded Code Representations [14.65619005733256]
  This paper presents SchGen, the first large language model that generates editable PCB schematics from natural-language requests.<n>Current schematic formats are dominated by verbose, tool-specific syntax and geometry-heavy descriptions.<n>We introduce a semantically grounded code representation that encodes schematic editing primitives with relative placement and pin-name-based wiring.
  arXiv  Detail & Related papers  (2026-05-28T17:59:50Z)
• Wrong Code, Right Structure: Learning Netlist Representations from Imperfect LLM-Generated RTL [4.827201131867214]
  Large Language Models (LLMs) can generate Register-Transfer-Level (RTL) at scale, but their functional incorrectness has hindered their use in circuit analysis.<n>We propose a cost-effective data augmentation and training framework that exploits imperfect RTL as training data for netlist representation learning.
  arXiv  Detail & Related papers  (2026-03-10T03:52:41Z)
• SketchVL: Policy Optimization via Fine-Grained Credit Assignment for Chart Understanding and More [15.102512433806751]
  We introduce SketchVL, a novel MLLM that optimized with FinePO, a new RL algorithm designed for fine-grained credit assignment within each trajectory.<n>During training, the FinePO algorithm leverages a Fine-grained Process Reward Model (FinePRM) to score each drawing action within a trajectory, thereby precisely assigning credit for each step.<n>Experiments show that SketchVL learns to align its step-level behavior with the FinePRM, achieving an average performance gain of 7.23% over its base model.
  arXiv  Detail & Related papers  (2026-01-09T10:13:01Z)
• SketchAgent: Generating Structured Diagrams from Hand-Drawn Sketches [54.06877048295693]
  We introduce SketchAgent, a system designed to automate the transformation of hand-drawn sketches into structured diagrams.<n>SketchAgent integrates sketch recognition, symbolic reasoning, and iterative validation to produce semantically coherent and structurally accurate diagrams.<n>By streamlining the diagram generation process, SketchAgent holds great promise for applications in design, education, and engineering.
  arXiv  Detail & Related papers  (2025-08-02T07:22:51Z)
• MCeT: Behavioral Model Correctness Evaluation using Large Language Models [3.26805553822503]
  With the growing use of Large Language Models (LLM) as AI modeling assistants, more automation will be involved in generating diagrams.<n>We propose MCeT, the first fully automated tool to evaluate the correctness of a behavioral model, sequence diagrams in particular, against its corresponding requirements text.
  arXiv  Detail & Related papers  (2025-08-01T13:41:58Z)
• SAFT: Structure-Aware Fine-Tuning of LLMs for AMR-to-Text Generation [50.277959544420455]
  SAFT is a structure-aware fine-tuning approach that injects graph topology into pretrained language models.<n>We compute direction-sensitive positional encodings from the magnetic Laplacian of transformed AMRs.<n> SAFT sets a new state-of-the-art on AMR 3.0 with a 3.5 BLEU improvement over baselines.
  arXiv  Detail & Related papers  (2025-07-15T18:12:57Z)
• AutoSchemaKG: Autonomous Knowledge Graph Construction through Dynamic Schema Induction from Web-Scale Corpora [51.77079220622184]
  We present AutoKG, a framework for fully autonomous knowledge graph construction.<n>We leverage large language models to simultaneously extract knowledge triples and induce comprehensive schemas directly from text.<n>We construct ATLAS (Automated Triple Linking And Induction), a family of knowledge graphs with 900+ million nodes and 5.9 billion edges.
  arXiv  Detail & Related papers  (2025-05-29T16:34:58Z)
• Compile Scene Graphs with Reinforcement Learning [69.36723767339001]
  Next-token prediction is the fundamental principle for training large language models (LLMs)<n>We introduce R1-SGG, a multimodal LLM (M-LLM) initially trained via supervised fine-tuning (SFT) on the scene graph dataset.<n>We design a set of graph-centric rewards, including three recall-based variants -- Hard Recall, Hard Recall+Relax, and Soft Recall.
  arXiv  Detail & Related papers  (2025-04-18T10:46:22Z)
• DeepCell: Multiview Representation Learning for Post-Mapping Netlists [11.789986571844535]
  DeepCell is a representation learning framework that integrates structural and functional insights from both PM netlists and AIGs. At its core, DeepCell employs the novel Mask Circuit Modeling (MCM) mechanism, which refines PM netlist representations in a self-supervised manner. DeepCell sets a new benchmark in PM netlist representation, outperforming existing methods in predictive accuracy and reconstruction fidelity.
  arXiv  Detail & Related papers  (2025-02-05T02:39:47Z)
• Knowledge Graph-based Retrieval-Augmented Generation for Schema Matching [3.7548609506798485]
  We propose a Knowledge Graph-based Retrieval-Augmented Generation model for large language models (LLMs) matching.<n>In particular, KG-RAG4SM introduces novel vector-based, graph-based, and query-based graph retrievals.<n>We show that KG-RAG4SM outperforms the state-of-the-art (SOTA) methods by 35.89% and 30.50% in terms of precision and F1 score on the MIMIC dataset.
  arXiv  Detail & Related papers  (2025-01-15T09:32:37Z)
• AnalogXpert: Automating Analog Topology Synthesis by Incorporating Circuit Design Expertise into Large Language Models [10.986618360243526]
  We propose AnalogXpert, a LLM-based agent aiming at solving practical topology synthesis problem. First, we represent analog topology as SPICE code and introduce a subcircuit library to reduce the design space. Second, we decompose the problem into two sub-tasks through the use of CoT and incontext learning techniques. Third, we introduce a proofreading strategy that allows LLMs to incrementally correct the errors in the initial design.
  arXiv  Detail & Related papers  (2024-12-17T09:08:08Z)
• SynerGen-VL: Towards Synergistic Image Understanding and Generation with Vision Experts and Token Folding [66.74446220401296]
  We propose SynerGen-VL, a simple yet powerful encoder-free MLLM capable of both image understanding and generation. We introduce the token folding mechanism and the vision-expert-based progressive alignment pretraining strategy, which effectively support high-resolution image understanding. Our code and models shall be released.
  arXiv  Detail & Related papers  (2024-12-12T18:59:26Z)
• Matchmaker: Self-Improving Large Language Model Programs for Schema Matching [60.23571456538149]
  We propose a compositional language model program for schema matching, comprised of candidate generation, refinement and confidence scoring. Matchmaker self-improves in a zero-shot manner without the need for labeled demonstrations. Empirically, we demonstrate on real-world medical schema matching benchmarks that Matchmaker outperforms previous ML-based approaches.
  arXiv  Detail & Related papers  (2024-10-31T16:34:03Z)
• The Graph's Apprentice: Teaching an LLM Low Level Knowledge for Circuit Quality Estimation [34.37154877681809]
  We introduce VeriDistill, the first end-to-end machine learning model that directly processes raw Verilog code to predict circuit quality-of-result metrics. Our model employs a novel knowledge distillation method, transferring low-level circuit insights via graphs into the predictor based on LLM. Experiments show VeriDistill outperforms state-of-the-art baselines on large-scale Verilog datasets.
  arXiv  Detail & Related papers  (2024-10-30T04:20:10Z)
• A Single Transformer for Scalable Vision-Language Modeling [74.05173379908703]
  We present SOLO, a single transformer for visiOn-Language mOdeling. A unified single Transformer architecture, like SOLO, effectively addresses these scalability concerns in LVLMs. In this paper, we introduce the first open-source training recipe for developing SOLO, an open-source 7B LVLM.
  arXiv  Detail & Related papers  (2024-07-08T22:40:15Z)
• AMSNet: Netlist Dataset for AMS Circuits [8.601352527168821]
  We develop an automatic technique for converting schematics into netlists, and create dataset AMSNet. With a growing size, AMSNet can significantly facilitate exploration of MLLM applications in AMS circuit design.
  arXiv  Detail & Related papers  (2024-05-15T02:46:04Z)
• Image2Sentence based Asymmetrical Zero-shot Composed Image Retrieval [92.13664084464514]
  The task of composed image retrieval (CIR) aims to retrieve images based on the query image and the text describing the users' intent. Existing methods have made great progress with the advanced large vision-language (VL) model in CIR task, however, they generally suffer from two main issues: lack of labeled triplets for model training and difficulty of deployment on resource-restricted environments. We propose Image2Sentence based Asymmetric zero-shot composed image retrieval (ISA), which takes advantage of the VL model and only relies on unlabeled images for composition learning.
  arXiv  Detail & Related papers  (2024-03-03T07:58:03Z)
• LLM4EDA: Emerging Progress in Large Language Models for Electronic Design Automation [74.7163199054881]
  Large Language Models (LLMs) have demonstrated their capability in context understanding, logic reasoning and answer generation. We present a systematic study on the application of LLMs in the EDA field. We highlight the future research direction, focusing on applying LLMs in logic synthesis, physical design, multi-modal feature extraction and alignment of circuits.
  arXiv  Detail & Related papers  (2023-12-28T15:09:14Z)
• DiagrammerGPT: Generating Open-Domain, Open-Platform Diagrams via LLM Planning [62.51232333352754]
  Text-to-image (T2I) generation has seen significant growth over the past few years. Despite this, there has been little work on generating diagrams with T2I models. We present DiagrammerGPT, a novel two-stage text-to-diagram generation framework. We show that our framework produces more accurate diagrams, outperforming existing T2I models.
  arXiv  Detail & Related papers  (2023-10-18T17:37:10Z)
• Evaluating and Explaining Large Language Models for Code Using Syntactic Structures [74.93762031957883]
  This paper introduces ASTxplainer, an explainability method specific to Large Language Models for code. At its core, ASTxplainer provides an automated method for aligning token predictions with AST nodes. We perform an empirical evaluation on 12 popular LLMs for code using a curated dataset of the most popular GitHub projects.
  arXiv  Detail & Related papers  (2023-08-07T18:50:57Z)
• How to Turn Your Knowledge Graph Embeddings into Generative Models [10.466244652188777]
  Some of the most successful knowledge graph embedding (KGE) models for link prediction can be interpreted as energy-based models. This work re-interprets the score functions of these KGEs as circuits. Our interpretation comes with little or no loss of performance for link prediction.
  arXiv  Detail & Related papers  (2023-05-25T11:30:27Z)
• Intelligent Circuit Design and Implementation with Machine Learning [0.0]
  I present multiple fast yet accurate machine learning models covering a wide range of chip design stages. I present APOLLO, a fully automated power modeling framework. I also present RouteNet for early routability prediction.
  arXiv  Detail & Related papers  (2022-06-07T06:17:52Z)
• Modality-Aware Triplet Hard Mining for Zero-shot Sketch-Based Image Retrieval [51.42470171051007]
  This paper tackles the Zero-Shot Sketch-Based Image Retrieval (ZS-SBIR) problem from the viewpoint of cross-modality metric learning. By combining two fundamental learning approaches in DML, e.g., classification training and pairwise training, we set up a strong baseline for ZS-SBIR. We show that Modality-Aware Triplet Hard Mining (MATHM) enhances the baseline with three types of pairwise learning.
  arXiv  Detail & Related papers  (2021-12-15T08:36:44Z)
• Modeling Gate-Level Abstraction Hierarchy Using Graph Convolutional Neural Networks to Predict Functional De-Rating Factors [0.0]
  The paper proposes a methodology for modeling a gate-level netlist using a Graph Convolutional Network (GCN) The model predicts the overall functional de-rating factors of sequential elements of a given circuit.
  arXiv  Detail & Related papers  (2021-04-05T08:38:16Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.