mlsanityData to 7 Oct 2026

MTLSO: A Multi-Task Learning Approach for Logic Synthesis Optimization

arXiv 2409.06077 ↗First posted 9 Sep 2024cs.LG cs.AIcited by 2

Not on the map. Why?

Abstract (arXiv)

Electronic Design Automation (EDA) is essential for IC design and has recently benefited from AI-based techniques to improve efficiency. Logic synthesis, a key EDA stage, transforms high-level hardware descriptions into optimized netlists. Recent research has employed machine learning to predict Quality of Results (QoR) for pairs of And-Inverter Graphs (AIGs) and synthesis recipes. However, the severe scarcity of data due to a very limited number of available AIGs results in overfitting, significantly hindering performance. Additionally, the complexity and large number of nodes in AIGs make plain GNNs less effective for learning expressive graph-level representations. To tackle these challenges, we propose MTLSO - a Multi-Task Learning approach for Logic Synthesis Optimization. On one hand, it maximizes the use of limited data by training the model across different tasks. This includes introducing an auxiliary task of binary multi-label graph classification alongside the primary regression task, allowing the model to benefit from diverse supervision sources. On the other hand, we employ a hierarchical graph representation learning strategy to improve the model's capacity for learning expressive graph-level representations of large AIGs, surpassing traditional plain GNNs. Extensive experiments across multiple datasets and against state-of-the-art baselines demonstrate the superiority of our method, achieving an average performance gain of 8.22% for delay and 5.95% for area.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 13 of its 26 references that are in the map. First posted on arXiv 9 Sep 2024.

Builds on

13 of 26 references.

References · 13

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  2. 2017Inductive Representation Learning on Large Graphscited by 6,284
  3. 2018How Powerful are Graph Neural Networks?cited by 4,355
  4. 2020Principal Neighbourhood Aggregation for Graph Netscited by 477
  5. 2020Multi-Task Learning with Deep Neural Networks: A Surveycited by 374
  6. 2018Towards Sparse Hierarchical Graph Classifierscited by 100
  7. 2021Machine Learning for Electronic Design Automation: A Surveycited by 71
  8. 2019DRiLLS: Deep Reinforcement Learning for Logic Synthesiscited by 47
  9. 2021OpenABC-D: A Large-Scale Dataset For Machine Learning Guided Integrated Circuit Synthesiscited by 30
  10. 2023Mitigating Task Interference in Multi-Task Learning via Explicit Task Routing with Non-Learnable Primitivescited by 18
  11. 2022FlowTune: End-to-end Automatic Logic Optimization Exploration via Domain-specific Multi-armed Banditcited by 10
  12. 2022LOSTIN: Logic Optimization via Spatio-Temporal Information with Hybrid Graph Modelscited by 7
1 more
  1. 2023Verilog-to-PyG -- A Framework for Graph Learning and Augmentation on RTL Designscited by 4

Built on by

Cited by year

Citing papers per year: 2025: 2.

2 papers.