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

逻辑综合遇到机器学习:用精确性换取泛化

Logic Synthesis Meets Machine Learning: Trading Exactness for Generalization

University of Tokyo(东京大学);Universidade Federal de Pelotas(佩洛塔斯联邦大学);National Taiwan University(台湾大学);University of Texas at Austin(得克萨斯大学奥斯汀分校);Universidade Federal do Rio Grande do Sul(南里奥格兰德联邦大学);Technische Universitaet Dresden(德累斯顿工业大学);University of Wisconsin–Madison(威斯康星大学麦迪逊分校);IBM;Cornell University(康奈尔大学);Universidade Federal de Santa Catarina(圣卡塔琳娜联邦大学);University of Utah(犹他大学);UC Berkeley(加州大学伯克利分校);Google AI(谷歌人工智能)
Shubham Rai, Walter Lau Neto, Yukio Miyasaka, Xinpei Zhang, Mingfei Yu, Qingyang Yi Masahiro Fujita, Guilherme B. Manske, Matheus F. Pontes, Leomar S. da Rosa J… 展开作者

Shubham Rai, Walter Lau Neto, Yukio Miyasaka, Xinpei Zhang, Mingfei Yu, Qingyang Yi Masahiro Fujita, Guilherme B. Manske, Matheus F. Pontes, Leomar S. da Rosa Junior, Marilton S. de Aguiar, Paulo F. Butzen, Po-Chun Chien, Yu-Shan Huang, Hoa-Ren Wang, Jie-Hong R. Jiang, Jiaqi Gu, Zheng Zhao, Zixuan Jiang, David Z. Pan, Brunno A. de Abreu, Isac de Souza Campos, Augusto Berndt, Cristina Meinhardt, Jonata T. Carvalho, Mateus Grellert, Sergio Bampi, Aditya Lohana, Akash Kumar, Wei Zeng, Azadeh Davoodi, Rasit O. Topaloglu, Yuan Zhou, Jordan Dotzel, Yichi Zhang, Hanyu Wang, Zhiru Zhang, Valerio Tenace, Pierre-Emmanuel Gaillardon, Alan Mishchenko, Satrajit Chatterjee

摘要:

逻辑综合是硬件设计中的一个基本步骤,其目标是找到布尔函数的结构表示,同时最小化延迟和面积。如果函数是完全指定的,则实现准确地表示该函数。如果函数未完全指定,则实现必须仅在护理集上为真。虽然逻辑综合中的大多数算法依赖于SAT和布尔方法来精确地实现护理集,但我们研究了逻辑综合中的学习,试图以精确性换取泛化。这项工作与机器学习直接相关,其中护理集是训练集,并且期望实现在验证集上推广。我们根据在IWLS 2020上进行的竞赛结果提出了学习不完全指定的函数。比赛的目标是实现由一组用于训练的护理minterms给出的100个函数,同时使用从同一函数中采样的一组验证minterms来测试实现。我们提供了这个基准测试套件,并对不同的学习方法进行了详细的比较分析

英文摘要:

Logic synthesis is a fundamental step in hardware design whose goal is to find structural representations of Boolean functions while minimizing delay and area. If the function is completely-specified, the implementation accurately represents the function. If the function is incompletely-specified, the implementation has to be true only on the care set. While most of the algorithms in logic synthesis rely on SAT and Boolean methods to exactly implement the care set, we investigate learning in logic synthesis, attempting to trade exactness for generalization. This work is directly related to machine learning where the care set is the training set and the implementation is expected to generalize on a validation set. We present learning incompletely-specified functions based on the results of a competition conducted at IWLS 2020. The goal of the competition was to implement 100 functions given by a set of care minterms for training, while testing the implementation using a set of validation minterms sampled from the same function. We make this benchmark suite available and offer a detailed comparative analysis of the different approaches to learning

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

↑