Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
110 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

AOWS: Adaptive and optimal network width search with latency constraints (2005.10481v1)

Published 21 May 2020 in cs.CV and cs.LG

Abstract: Neural architecture search (NAS) approaches aim at automatically finding novel CNN architectures that fit computational constraints while maintaining a good performance on the target platform. We introduce a novel efficient one-shot NAS approach to optimally search for channel numbers, given latency constraints on a specific hardware. We first show that we can use a black-box approach to estimate a realistic latency model for a specific inference platform, without the need for low-level access to the inference computation. Then, we design a pairwise MRF to score any channel configuration and use dynamic programming to efficiently decode the best performing configuration, yielding an optimal solution for the network width search. Finally, we propose an adaptive channel configuration sampling scheme to gradually specialize the training phase to the target computational constraints. Experiments on ImageNet classification show that our approach can find networks fitting the resource constraints on different target platforms while improving accuracy over the state-of-the-art efficient networks.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (5)
  1. Maxim Berman (14 papers)
  2. Leonid Pishchulin (10 papers)
  3. Ning Xu (151 papers)
  4. Matthew B. Blaschko (65 papers)
  5. Gerard Medioni (33 papers)
Citations (28)

Summary

We haven't generated a summary for this paper yet.