LGNEFeb 7, 2023

LUT-NN: Empower Efficient Neural Network Inference with Centroid Learning and Table Lookup

arXiv:2302.03213v236 citationsh-index: 38
AI Analysis

This addresses efficiency challenges for on-device AI applications, offering a novel system-level approach with significant performance gains.

The paper tackles the problem of high computational cost in on-device deep neural network inference by proposing LUT-NN, a system that uses centroid learning and table lookup to approximate outputs without computations, achieving accuracy similar to original models with reductions in FLOPs (up to 16x), model size (up to 7x), latency (up to 6.8x), memory (up to 6.5x), and power (up to 41.7%).

On-device Deep Neural Network (DNN) inference consumes significant computing resources and development efforts. To alleviate that, we propose LUT-NN, the first system to empower inference by table lookup, to reduce inference cost. LUT-NN learns the typical features for each operator, named centroid, and precompute the results for these centroids to save in lookup tables. During inference, the results of the closest centroids with the inputs can be read directly from the table, as the approximated outputs without computations. LUT-NN integrates two major novel techniques: (1) differentiable centroid learning through backpropagation, which adapts three levels of approximation to minimize the accuracy impact by centroids; (2) table lookup inference execution, which comprehensively considers different levels of parallelism, memory access reduction, and dedicated hardware units for optimal performance. LUT-NN is evaluated on multiple real tasks, covering image and speech recognition, and nature language processing. Compared to related work, LUT-NN improves accuracy by 66% to 92%, achieving similar level with the original models. LUT-NN reduces the cost at all dimensions, including FLOPs ($\leq$ 16x), model size ($\leq$ 7x), latency ($\leq$ 6.8x), memory ($\leq$ 6.5x), and power ($\leq$ 41.7%).

Foundations

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

Your Notes