DASS: Differentiable Architecture Search for Sparse neural networks
Hamid Mousavi, Mohammad Loni, Mina Alibeigi, Masoud Daneshtalab

TL;DR
This paper introduces DASS, a differentiable architecture search method tailored for sparse neural networks, improving accuracy and efficiency on edge devices by incorporating sparsity-aware operations and objectives.
Contribution
It proposes new sparse operations and a modified search objective enabling architecture search specifically for sparse networks, outperforming existing methods.
Findings
Outperforms state-of-the-art sparse networks on CIFAR-10 and ImageNet.
Increases MobileNet-v2 accuracy from 73.44% to 81.35%.
Achieves 3.87x faster inference time.
Abstract
The deployment of Deep Neural Networks (DNNs) on edge devices is hindered by the substantial gap between performance requirements and available processing power. While recent research has made significant strides in developing pruning methods to build a sparse network for reducing the computing overhead of DNNs, there remains considerable accuracy loss, especially at high pruning ratios. We find that the architectures designed for dense networks by differentiable architecture search methods are ineffective when pruning mechanisms are applied to them. The main reason is that the current method does not support sparse architectures in their search space and uses a search objective that is made for dense networks and does not pay any attention to sparsity. In this paper, we propose a new method to search for sparsity-friendly neural architectures. We do this by adding two new sparse…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Neural Network Applications · Machine Learning and ELM · Domain Adaptation and Few-Shot Learning
MethodsPruning · Convolution
