ShiftNAS: Improving One-shot NAS via Probability Shift
Mingyang Zhang, Xinyi Yu, Haodong Zhao, Linlin Ou

TL;DR
ShiftNAS enhances one-shot neural architecture search by adaptively shifting sampling probabilities based on subnet complexity, leading to better performance without extra computational cost.
Contribution
It introduces a novel probability shift method that adjusts sampling based on subnet complexity, improving one-shot NAS performance.
Findings
Improves accuracy of subnet architectures in one-shot NAS
Applicable to CNNs and ViTs, demonstrating model-agnosticism
Achieves better results on ImageNet without additional costs
Abstract
One-shot Neural architecture search (One-shot NAS) has been proposed as a time-efficient approach to obtain optimal subnet architectures and weights under different complexity cases by training only once. However, the subnet performance obtained by weight sharing is often inferior to the performance achieved by retraining. In this paper, we investigate the performance gap and attribute it to the use of uniform sampling, which is a common approach in supernet training. Uniform sampling concentrates training resources on subnets with intermediate computational resources, which are sampled with high probability. However, subnets with different complexity regions require different optimal training strategies for optimal performance. To address the problem of uniform sampling, we propose ShiftNAS, a method that can adjust the sampling probability based on the complexity of subnets. We…
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 · Domain Adaptation and Few-Shot Learning · Advanced Image and Video Retrieval Techniques
