arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2204.09320cs.LGcs.CVcs.NE
收藏

SpiderNet:基于Train-Free搜索的混合差分-进化体系结构搜索

SpiderNet: Hybrid Differentiable-Evolutionary Architecture Search via Train-Free Metrics

Red Hat(红帽公司);Newcastle University(纽卡斯尔大学)

Rob Geada, Andrew Stephen McGough

摘要:

神经结构搜索(NAS)算法旨在消除人工神经网络设计的负担,并已被证明能够为各种众所周知的问题设计优秀的模型。然而,这些算法需要以用户配置或硬编码决策的形式的各种设计参数,这限制了可以发现的网络的种类。这意味着NAS算法并没有消除模型设计调优,它们只是转移了需要应用调优的地方的负担。在本文中,我们提出了蜘蛛网,一个混合微分进化和硬件感知算法,快速,有效地产生国家的最先进的网络。更重要的是,SpiderNet是一个最小配置NAS算法的概念验证;在其他算法中看到的大多数设计选择都被纳入SpiderNet的动态演化搜索空间,将用户选择的数量最小化到只有两个:减少单元数和初始通道数。SpiderNet生成的模型与最先进的模型具有很强的竞争力,并且在准确性、运行时间、内存大小和参数计数方面优于随机搜索。

英文摘要:

Neural Architecture Search (NAS) algorithms are intended to remove the burden of manual neural network design, and have shown to be capable of designing excellent models for a variety of well-known problems. However, these algorithms require a variety of design parameters in the form of user configuration or hard-coded decisions which limit the variety of networks that can be discovered. This means that NAS algorithms do not eliminate model design tuning, they instead merely shift the burden of where that tuning needs to be applied. In this paper, we present SpiderNet, a hybrid differentiable-evolutionary and hardware-aware algorithm that rapidly and efficiently produces state-of-the-art networks. More importantly, SpiderNet is a proof-of-concept of a minimally-configured NAS algorithm; the majority of design choices seen in other algorithms are incorporated into SpiderNet's dynamically-evolving search space, minimizing the number of user choices to just two: reduction cell count and initial channel count. SpiderNet produces models highly-competitive with the state-of-the-art, and outperforms random search in accuracy, runtime, memory size, and parameter count.

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

↑