arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 2102.06599cs.LGcs.PL
收藏

作为程序转换探索的神经架构搜索

Neural Architecture Search as Program Transformation Exploration

University of Edinburgh(爱丁堡大学)

Jack Turner, Elliot J. Crowley, Michael O'Boyle

摘要:

提高深度神经网络(DNN)的性能对编译器和神经架构搜索(NAS)社区都很重要。编译器应用程序转换以便利用硬件并行性和存储层次结构。然而,合法性问题意味着他们未能利用神经网络的自然鲁棒性。相比之下,NAS技术通过诸如卷积的分组或检查之类的操作来改变网络,从而利用DNN的弹性。在这项工作中,我们表示这样的神经架构操作程序转换的合法性取决于一个概念的代表能力。这允许它们与现有的转换组合成统一的优化框架。这种统一使我们能够将现有的NAS操作表示为更简单的转换的组合。至关重要的是,它允许我们生成和探索新的张量卷积。我们在TVM中对组合框架进行了原型设计,并能够在不同的DNN中找到优化,从而显着减少推理时间-在大多数情况下超过3 $\times$。此外,我们的计划大大减少了NAS搜索时间。代码位于~ \href{https://github.com/jack-willturner/nas-as-program-transformation-exploration}{this https url}。

英文摘要:

Improving the performance of deep neural networks (DNNs) is important to both the compiler and neural architecture search (NAS) communities. Compilers apply program transformations in order to exploit hardware parallelism and memory hierarchy. However, legality concerns mean they fail to exploit the natural robustness of neural networks. In contrast, NAS techniques mutate networks by operations such as the grouping or bottlenecking of convolutions, exploiting the resilience of DNNs. In this work, we express such neural architecture operations as program transformations whose legality depends on a notion of representational capacity. This allows them to be combined with existing transformations into a unified optimization framework. This unification allows us to express existing NAS operations as combinations of simpler transformations. Crucially, it allows us to generate and explore new tensor convolutions. We prototyped the combined framework in TVM and were able to find optimizations across different DNNs, that significantly reduce inference time - over 3$\times$ in the majority of cases. Furthermore, our scheme dramatically reduces NAS search time. Code is available at~\href{https://github.com/jack-willturner/nas-as-program-transformation-exploration}{this https url}.

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

↑