LGCVSep 23, 2019

Class-dependent Compression of Deep Neural Networks

arXiv:1909.10364v38 citations
Originality Incremental advance
AI Analysis

This addresses the need for efficient deep learning models in applications like medical detection where class imbalance is critical, though it is incremental as it builds on existing compression methods.

The paper tackles the problem of compressing deep neural networks for resource-constrained devices by proposing a class-dependent compression technique that prioritizes reducing false negatives, achieving up to 35% lower false negatives, 99% fewer parameters, and higher AUC_ROC compared to baseline compressed models.

Today's deep neural networks require substantial computation resources for their training, storage, and inference, which limits their effective use on resource-constrained devices. Many recent research activities explore different options for compressing and optimizing deep models. On the one hand, in many real-world applications, we face the data imbalance challenge, i.e. when the number of labeled instances of one class considerably outweighs the number of labeled instances of the other class. On the other hand, applications may pose a class imbalance problem, i.e. higher number of false positives produced when training a model and optimizing its performance may be tolerable, yet the number of false negatives must stay low. The problem originates from the fact that some classes are more important for the application than others, e.g. detection problems in medical and surveillance domains. Motivated by the success of the lottery ticket hypothesis, in this paper we propose an iterative deep model compression technique, which keeps the number of false negatives of the compressed model close to the one of the original model at the price of increasing the number of false positives if necessary. Our experimental evaluation using two benchmark data sets shows that the resulting compressed sub-networks 1) achieve up to 35% lower number of false negatives than the compressed model without class optimization, 2) provide an overall higher AUC_ROC measure, and 3) use up to 99% fewer parameters compared to the original network.

Code Implementations1 repo
Foundations

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

Your Notes