NeuralScale: Efficient Scaling of Neurons for Resource-Constrained Deep Neural Networks
Eugene Lee, Chen-Yi Lee
Abstract
Deciding the amount of neurons during the design of a deep neural network to maximize performance is not intuitive. In this work, we attempt to search for the neuron (filter) configuration of a fixed network architecture that maximizes accuracy. Using iterative pruning methods as a proxy, we parameterize the change of the neuron (filter) number of each layer with respect to the change in parameters, allowing us to efficiently scale an architecture across arbitrary sizes. We also introduce architecture descent which iteratively refines the parameterized function used for model scaling. The combination of both proposed methods is coined as NeuralScale. To prove the efficiency of NeuralScale in terms of parameters, we show empirical simulations on VGG11, MobileNetV2 and ResNet18 using CIFAR10, CIFAR100 and TinyImageNet as benchmark datasets. Our results show an increase in accuracy of 3.04%, 8.56% and 3.41% for VGG11, MobileNetV2 and ResNet18 on CIFAR10, CIFAR100 and TinyImageNet respectively under a parameter-constrained setting (output neurons (filters) of default configuration with scaling factor of 0.25).
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers3
- Orthogonal Projection LossKanchana Ranasinghe, Muzammal Naseer, Munawar Hayat, Salman H. Khan et al.ICCV 2021 · 97 citations
- Channel Permutations for N: M SparsityJeff Pool, Chong YuNeurIPS 2021 · 75 citations
- Few-Shot and Continual Learning with Attentive Independent MechanismsEugene Lee, Cheng-Han Huang, Chen-Yi LeeICCV 2021 · 34 citations
Related papers
- Greedy Optimization Provably Wins the Lottery: Logarithmic Number of Winning Tickets is EnoughMao Ye, Lemeng Wu, Qiang LiuNeurIPS 2020 · 17 citations
- Good Subnetworks Provably Exist: Pruning via Greedy Forward SelectionMao Ye, Chengyue Gong, Lizhen Nie, Denny Zhou et al.ICML 2020 · 123 citations
- On the Predictability of Pruning Across ScalesJonathan S. Rosenfeld, Jonathan Frankle, Michael Carbin, Nir ShavitICML 2021 · 47 citations
- Model Rubik's Cube: Twisting Resolution, Depth and Width for TinyNetsKai Han, Yunhe Wang, Qiulin Zhang, Wei Zhang et al.NeurIPS 2020 · 115 citations
- AutoGrow: Automatic Layer Growing in Deep Convolutional NetworksWei Wen, Feng Yan, Yiran Chen, Hai LiKDD 2020 · 25 citations
