Research map / Graph learning / Graph algorithms and clustering
A Hierarchical Circuit Symbolic Discovery Framework for Efficient Logic Optimization
Yinqi Bai, Jie Wang, Tong Xialiang, Longdi Pan, Jilai Pan, Mingxuan Yuan, Jianye HAO
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| add hierarchical layer-by-layer symbolic tree learning (ablation) | HIS · six circuits (avg recall) | prediction recall: Hyp 0.81 -> 0.82; Square 0.74 -> 0.94; DesPerf 0.77 -> 0.83; Ethernet 0.81 -> 0.99 | Improved |
| add group reward advantage in PPO (ablation) | HIS · six circuits | prediction recall: DesPerf 0.51 -> 0.83; Hyp 0.88 -> 0.82 | Mixed |
| add tree-structured parent and sibling aggregation (ablation) | HIS · six circuits | prediction recall: Multiplier 0.51 -> 0.94; Ethernet 0.91 -> 0.99 | Improved |
| use HIS scoring function in Mfs2 with k=50% | Default Mfs2 · six challenging circuits | runtime: average runtime reduction of 40.27% | Improved |
| use HIS scoring function in Mfs2 with k=50% | Default Mfs2 · Hyp | runtime (s): 265.93 -> 85.46 | Improved |
| apply HIS-Mfs2 twice (2HIS) with k=40% | HIS-Mfs2 · six circuits | optimized size and depth: average reduction of 7.43% in size and depth; runtime reduced by 7.82% | Improved |
| apply HIS-Mfs2 twice (2HIS) with k=30% | HIS-Mfs2 · six circuits | optimized size and runtime: average reduction of 6.95% in size and depth; runtime reduction of 27.22% | Improved |
| replace COG GNN scorer with HIS symbolic scorer | COG-Mfs2 · six circuits | online runtime: 22.91% average runtime improvement | Improved |
| replace CMO scorer with HIS | CMO-Mfs2 · six circuits | online runtime: 11.96% average runtime improvement | Improved |
| replace GNN scorer COG with HIS symbolic scorer | COG · EPFL circuits | inference time: 296x speedup | Improved |
Closest papers by meaning
- A Circuit Domain Generalization Framework for Efficient Logic Synthesis in Chip Design (ICML 2024 · similarity 0.90)
- Towards Next-Generation Logic Synthesis: A Scalable Neural Circuit Generation Framework (NeurIPS 2024 · similarity 0.89)
- Retrieval-Guided Reinforcement Learning for Boolean Circuit Minimization (ICLR 2024 · similarity 0.87)
- DeepGate4: Efficient and Effective Representation Learning for Circuit Design at Scale (ICLR 2025 · similarity 0.87)
- Functional Matching of Logic Subgraphs: Beyond Structural Isomorphism (NeurIPS 2025 · similarity 0.87)
- CircuitFusion: Multimodal Circuit Representation Learning for Agile Chip Design (ICLR 2025 · similarity 0.87)
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.
