分块布尔二次规划的最优DNN基元选择
Optimal DNN Primitive Selection with Partitioned Boolean Quadratic Programming
摘要:
深度神经网络(DNN)在现场部署时需要非常大量的计算来进行训练和推理。已经提出了许多不同的算法来实现DNN的计算成本最高的层。此外,这些算法中的每一个都有大量的变体,这些变体提供了并行性、数据局部性、内存占用和执行时间的不同权衡。此外,特定的算法在专门的数据布局和格式上的操作效率更高。我们陈述了在存在数据格式变换的情况下的最优基元选择问题,并通过展示在分区布尔二次分配问题(PBQP)中的嵌入来表明它是NP难的。我们通过PBQP求解器提出了一个分析解决方案,并在嵌入式平台和通用平台上通过使用70多个DNN原语库优化几个流行的DNN来实验评估我们的方法。我们的实验表明,显着的收益是可能的,对国家的最先进的供应商库,通过使用一个原则性的分析解决方案的布局选择的问题,在存在的数据格式转换。
英文摘要:
Deep Neural Networks (DNNs) require very large amounts of computation both for training and for inference when deployed in the field. Many different algorithms have been proposed to implement the most computationally expensive layers of DNNs. Further, each of these algorithms has a large number of variants, which offer different trade-offs of parallelism, data locality, memory footprint, and execution time. In addition, specific algorithms operate much more efficiently on specialized data layouts and formats. We state the problem of optimal primitive selection in the presence of data format transformations, and show that it is NP-hard by demonstrating an embedding in the Partitioned Boolean Quadratic Assignment problem (PBQP). We propose an analytic solution via a PBQP solver, and evaluate our approach experimentally by optimizing several popular DNNs using a library of more than 70 DNN primitives, on an embedded platform and a general purpose platform. We show experimentally that significant gains are possible versus the state of the art vendor libraries by using a principled analytic solution to the problem of layout selection in the presence of data format transformations.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。