PCBSchemaGen: Reward-Guided LLM Code Synthesis for Printed Circuit Boards (PCB) Schematic Design with Structured Verification
- lab Hugging Face
- lab arXiv
- lab arXivLabs
- location cs.AI
- model Gemma 4 31B
- person Huanghaohe Zou
- product PCBBench
- product SPICE
Researchers have introduced PCBSchemaGen, a framework that enables a frozen large language model to generate verifiable and repairable printed circuit board schematics, a domain where traditional unit-test oracles do not exist [1]. The framework, detailed in a paper by Huanghaohe Zou and colleagues, addresses a core challenge in automating PCB design: correctness is defined by structured physical constraints over real integrated circuit packages and pin-level assignments, and per-task golden references are unavailable [2]. SPICE simulation, a standard tool for circuit analysis, does not validate schematic-level correctness [2]. PCBSchemaGen operates at inference time without additional training. It first induces a domain schema from IC datasheets to ground the decoding process of the language model [2]. This schema is paired with a deterministic 5-layer continuous-reward verifier that localizes errors at the pin level [2]. Candidate schematics are then refined through a Thompson Sampling arm-acquiring bandit [2]. The system was evaluated on two PCB benchmarks encompassing 227 real-IC tasks across 22 unified circuit domains [2]. One of these benchmarks is derived from public schematics and served as a fully held-out generalization test; the verifier, knowledge graph library, and prompts were frozen before any evaluation began [2]. An open-weight 31-billion-parameter model, Gemma-4-31B, achieved an average pass rate of 81.3% on PCBBench tasks under this framework [2]. The same framework transferred across both benchmarks with zero changes to the verifier code [2]. In contrast, a Circuitron-style inference-time prompting baseline using the same Gemma-4-31B backbone failed on complex system-level designs [2]. The authors suggest that inference-time refinement guided by a deterministic structural verifier represents a general approach for reference-free LLM code synthesis in domains lacking unit-test oracles [2]. The benchmarks and verifier have been made publicly available on GitHub [2]. The work appears as large language models are increasingly applied to specialized code generation tasks. A recent review of generative systems for quantum circuit and code generation found that while all surveyed systems address syntactic validity, none reported end-to-end evaluation on actual quantum hardware, highlighting a persistent gap between generated artifacts and practical deployment [3].
research-papertool-releaseinfrastructuremodel-releaseproduct-launch
Background sources we checked (8)
- arxiv.org ↗ Most LLM code-synthesis benchmarks rely on unit tests as the reward oracle, but PCB schematic design has none: correctness is defined by structured physical constraints over real IC packages and pin-level assignments, per-task golden references are unavailable, and SPICE simulati…
- arxiv.org ↗ We review thirteen generative systems and five supporting datasets for quantum circuit and quantum code generation, identified through a structured scoping review of Hugging Face, arXiv, and provenance tracing (January-February 2026). We organize the field along two axes: artifac…
- huggingface.co ↗ # Paper Pages Paper pages allow people to find artifacts related to a paper such as models, datasets and apps/demos (Spaces). Paper pages also enable the community to discuss about the paper. ## Linking a Paper to a model, dataset or Space If the repository card (`README.md`) …
- huggingface.co ↗ # How to Add a Space to ArXiv ... Demos on Hugging Face Spaces allow a wide audience to try out state-of-the-art machine learning research without writing any code. Hugging Face and ArXiv have collaborated to embed these demos directly along side papers on ArXiv! ... Thanks to th…
- huggingface.co ↗ Daily Papers - Hugging Face new Get trending papers in your email inbox once a day! Get trending papers in your email inbox! Subscribe # Daily Papers ## byAK and the research community - Daily - Weekly - Monthly Trending Papers https://huggingface.co/papers/date/2026-06-…
- en.wikipedia.org ↗ Hangzhou DeepSeek Artificial Intelligence Basic Technology Research Co., Ltd., doing business as DeepSeek, is a Chinese artificial intelligence (AI) company that develops large language models (LLMs). Based in Hangzhou, Zhejiang, DeepSeek is owned and funded by High-Flyer, a Chin…
- en.wikipedia.org ↗ A large language model (LLM) is a type of machine learning model designed for natural language processing tasks such as language generation. LLMs are language models with many parameters, and are trained with self-supervised learning on a vast amount of text.…
- en.wikipedia.org ↗ Qwen (also known as Tongyi Qianwen, Chinese: 通义千问; pinyin: Tōngyì Qiānwèn) is a family of large language models developed by Alibaba Cloud. Many Qwen models are distributed under the free and open-source Apache 2.0 license, the source-available Qwen License, or the non-commercial…