arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2408.12304cs.AI
收藏

OPTDTALS:基于最优决策树方法的近似逻辑综合

OPTDTALS: Approximate Logic Synthesis via Optimal Decision Trees Approach

Institute of Software, Chinese Academy of Sciences(中国科学院软件研究所)

Hao Hu, Shaowei Cai

AI总结:

针对近似逻辑综合(ALS)问题,提出通过学习经验准确率上的最优决策树来实现电路近似的新方法,利用最优性保证在电路复杂度与准确率间实现更可控的权衡,并在设计质量上显著优于现有最先进方法。

摘要:

对可解释人工智能(XAI)日益增长的兴趣,推动了计算最优可解释机器学习模型,尤其是决策树的有前景的研究。此类模型通常在紧凑规模或经验准确率上提供最优性。由于固有的可扩展性问题,近期的研究集中于提升效率。此类模型在实际问题中的应用相当有限。作为电路设计中的新兴问题,近似逻辑综合(ALS)旨在通过牺牲正确性来降低电路复杂度。近期,多种启发式机器学习方法已被应用于ALS中,这些方法从输入输出对的样本中学习近似电路。在本文中,我们提出了一种新的ALS方法,通过在经验准确率上学习最优决策树来实现近似。与以往的启发式ALS方法相比,最优性保证在电路复杂度与准确率之间实现了更可控的权衡。实验结果表明,与最先进的方法相比,我们的方法在近似设计的质量(电路复杂度和准确率)上取得了显著改善。

英文摘要:

The growing interest in Explainable Artificial Intelligence (XAI) motivates promising studies of computing optimal Interpretable Machine Learning models, especially decision trees. Such models generally provide optimality in compact size or empirical accuracy. Recent works focus on improving efficiency due to the natural scalability issue. The application of such models to practical problems is quite limited. As an emerging problem in circuit design, Approximate Logic Synthesis (ALS) aims to reduce circuit complexity by sacrificing correctness. Recently, multiple heuristic machine learning methods have been applied in ALS, which learns approximated circuits from samples of input-output pairs. In this paper, we propose a new ALS methodology realizing the approximation via learning optimal decision trees in empirical accuracy. Compared to previous heuristic ALS methods, the guarantee of optimality achieves a more controllable trade-off between circuit complexity and accuracy. Experimental results show clear improvements in our methodology in the quality of approximated designs (circuit complexity and accuracy) compared to the state-of-the-art approaches.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑