Class-dependent Compression of Deep Neural Networks
Rahim Entezari, Olga Saukh

TL;DR
This paper introduces a class-dependent deep neural network compression method that reduces false negatives and parameters, improving performance in imbalanced data scenarios relevant to critical applications.
Contribution
It proposes an iterative compression technique inspired by the lottery ticket hypothesis that maintains low false negatives for important classes while significantly reducing model size.
Findings
Achieves up to 35% fewer false negatives
Provides higher AUC_ROC scores
Reduces parameters by up to 99%
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsImbalanced Data Classification Techniques · Machine Learning and Data Classification · Machine Learning and Algorithms
