MathNAS: If Blocks Have a Role in Mathematical Architecture Design

Wang Qinsi, Jinghan Ke, Zhi Liang, Sihai Zhang

Keywords: Neural Architecture Search

TL;DR: This work introduces MathNAS, the first architecturally-general NAS framework based on mathematical programming, which reduces network search complexity from exponential to polynomial levels while maintaining excellent network performance.

Abstract:

Neural Architecture Search (NAS) has emerged as a favoured method for unearthing effective neural architectures.
Recent development of large models has intensified the demand for faster search speeds and more accurate search results.
However, designing large models by NAS is challenging due to the dramatical increase of search space and the associated huge performance evaluation cost.
Consider a typical modular search space widely used in NAS, in which a neural architecture consists of $m$ block nodes and a block node has $n$ alternative blocks.
Facing the space containing $n^m$ candidate networks, existing NAS methods attempt to find the best one by searching and evaluating candidate networks directly.
Different from the general strategy that takes architecture search as a whole problem, we propose a novel divide-and-conquer strategy by making use of the modular nature of the search space.
Here, we introduce MathNAS, a general NAS framework based on mathematical programming.
In MathNAS, the performances of all possible building blocks in the search space are calculated first, and then the performance of a network is directly predicted based on the performances of its building blocks.
Although estimating block performances involves network training, just as what happens for network performance evaluation in existing NAS methods, predicting network performance is completely training-free and thus extremely fast. In contrast to the $n^m$ candidate networks to evaluate in existing NAS methods, which requires training and a formidable computational burden, there are only $m*n$ possible blocks to handle in MathNAS.
Therefore, our approach effectively reduces the complexity of network performance evaluation.
The superiority of MathNAS is validated on multiple large-scale CV and NLP benchmark datasets.
Notably on ImageNet-1k, MathNAS achieves 82.5\% top-1 accuracy, 1.2\% and 0.96\% higher than Swin-T and LeViT-256, respectively.
In addition, when deployed on mobile device, MathNAS achieves real-time search and dynamic network switching within 1s (0.4s on TX2 GPU), surpassing baseline dynamic networks in on-device performance.

Submission Number: 4286