CVNov 18, 2018

Learning to infer: RL-based search for DNN primitive selection on Heterogeneous Embedded Systems

arXiv:1811.07315v112 citations
Originality Incremental advance
AI Analysis

This addresses the bottleneck of CNN inference latency for real-time industrial applications on low-cost embedded devices, representing an incremental improvement in optimization methods.

The paper tackles the problem of high inference latency and compatibility issues for CNNs on heterogeneous embedded systems by proposing QS-DNN, an RL-based search method that finds optimal library and primitive combinations, achieving up to 45x speedup on CPU and 2x on GPGPU compared to baselines.

Deep Learning is increasingly being adopted by industry for computer vision applications running on embedded devices. While Convolutional Neural Networks' accuracy has achieved a mature and remarkable state, inference latency and throughput are a major concern especially when targeting low-cost and low-power embedded platforms. CNNs' inference latency may become a bottleneck for Deep Learning adoption by industry, as it is a crucial specification for many real-time processes. Furthermore, deployment of CNNs across heterogeneous platforms presents major compatibility issues due to vendor-specific technology and acceleration libraries. In this work, we present QS-DNN, a fully automatic search based on Reinforcement Learning which, combined with an inference engine optimizer, efficiently explores through the design space and empirically finds the optimal combinations of libraries and primitives to speed up the inference of CNNs on heterogeneous embedded devices. We show that, an optimized combination can achieve 45x speedup in inference latency on CPU compared to a dependency-free baseline and 2x on average on GPGPU compared to the best vendor library. Further, we demonstrate that, the quality of results and time "to-solution" is much better than with Random Search and achieves up to 15x better results for a short-time search.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes