IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v13y2024i1p108-d1556419.html
   My bibliography  Save this article

Probabilistic Automated Model Compression via Representation Mutual Information Optimization

Author

Listed:
  • Wenjie Nie

    (Department of Artificial lntelligence, Xiamen University, Xiamen 361101, China)

  • Shengchuan Zhang

    (Department of Artificial lntelligence, Xiamen University, Xiamen 361101, China)

  • Xiawu Zheng

    (Department of Artificial lntelligence, Xiamen University, Xiamen 361101, China)

Abstract

Deep neural networks, despite their remarkable success in computer vision tasks, often face deployment challenges due to high computational demands and memory usage. Addressing this, we introduce a probabilistic framework for automated model compression (Prob-AMC) that optimizes pruning, quantization, and knowledge distillation simultaneously using information theory. Our approach is grounded in maximizing the mutual information between the original and compressed network representations, ensuring the preservation of essential features under resource constraints. Specifically, we employ layer-wise self-representation mutual information analysis, sampling-based pruning and quantization allocation, and progressive knowledge distillation using the optimal compressed model as a teacher assistant. Through extensive experiments on CIFAR-10 and ImageNet, we demonstrate that Prob-AMC achieves a superior compression ratio of 33.41× on ResNet-18 with only a 1.01% performance degradation, outperforming state-of-the-art methods in terms of both compression efficiency and accuracy. This optimization process is highly practical, requiring merely a few GPU hours, and bridges the gap between theoretical information measures and practical model compression, offering significant insights for efficient deep learning deployment.

Suggested Citation

  • Wenjie Nie & Shengchuan Zhang & Xiawu Zheng, 2024. "Probabilistic Automated Model Compression via Representation Mutual Information Optimization," Mathematics, MDPI, vol. 13(1), pages 1-18, December.
  • Handle: RePEc:gam:jmathe:v:13:y:2024:i:1:p:108-:d:1556419
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/1/108/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/13/1/108/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:13:y:2024:i:1:p:108-:d:1556419. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.