Pith. sign in

REVIEW 1 cited by

Latency-Aware Differentiable Neural Architecture Search

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2001.06392 v2 pith:KHNBT3QR submitted 2020-01-17 cs.CV

classification cs.CV
keywords searchlatencyarchitecturedifferentiablehardwarenetworkaccuracyapproach
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Differentiable neural architecture search methods became popular in recent years, mainly due to their low search costs and flexibility in designing the search space. However, these methods suffer the difficulty in optimizing network, so that the searched network is often unfriendly to hardware. This paper deals with this problem by adding a differentiable latency loss term into optimization, so that the search process can tradeoff between accuracy and latency with a balancing coefficient. The core of latency prediction is to encode each network architecture and feed it into a multi-layer regressor, with the training data which can be easily collected from randomly sampling a number of architectures and evaluating them on the hardware. We evaluate our approach on NVIDIA Tesla-P100 GPUs. With 100K sampled architectures (requiring a few hours), the latency prediction module arrives at a relative error of lower than 10%. Equipped with this module, the search method can reduce the latency by 20% meanwhile preserving the accuracy. Our approach also enjoys the ability of being transplanted to a wide range of hardware platforms with very few efforts, or being used to optimizing other non-differentiable factors such as power consumption.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. AdaScale: Dynamic Context-aware DNN Scaling via Automated Adaptation Loop on Mobile Devices

    cs.AI 2024-12 conditional novelty 4.0 of 10

    AdaScale continuously rescales a deployed neural network to match a mobile device's fluctuating resources, reporting faster inference and lower energy use while keeping accuracy loss small.

Pith tools