用多任务学习提升逻辑综合优化,解决数据少、图复杂难题。
MTLSO: A Multi-Task Learning Approach for Logic Synthesis Optimization
- 通过多任务学习融合主任务与辅助分类任务,提升小样本下的训练效果。
- 在多个数据集上实现延迟优化8.22%、面积优化5.95%的显著提升。
- 适合从事EDA自动化、AI+芯片设计的研究者和工程师参考。
电子设计自动化(EDA)对集成电路设计至关重要,近年来受益于基于人工智能的技术提升了效率。逻辑综合作为关键环节,将高层硬件描述转换为优化的网表。近期研究利用机器学习预测异或反相图(AIG)与综合方案对的品质结果(QoR),但因可用AIG数量极少导致数据严重稀缺,易引发过拟合,显著制约性能。同时,AIG结构复杂、节点众多,传统图神经网络(GNN)难以学习有效的图级表示。为此,本文提出MTLSO——一种用于逻辑综合优化的多任务学习方法。一方面,通过跨任务训练最大化有限数据的利用,引入二值多标签图分类作为辅助任务,使模型从多样监督信号中获益;另一方面,采用分层图表示学习策略,增强对大型AIG的表达性建模能力,超越传统平面GNN。在多个数据集上与先进基线对比的大量实验表明,该方法在延迟上平均提升8.22%,面积上平均提升5.95%。
原文摘要 · Abstract (English)
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.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。