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

Rewarded Meta-Pruning: Meta Learning with Rewards for Channel Pruning

Author

Listed:
  • Athul Shibu

    (Department of Artificial Intelligence, Kyungpook National University, Buk-gu, Daegu 41566, Republic of Korea)

  • Abhishek Kumar

    (Department of Artificial Intelligence, Kyungpook National University, Buk-gu, Daegu 41566, Republic of Korea)

  • Heechul Jung

    (Department of Artificial Intelligence, Kyungpook National University, Buk-gu, Daegu 41566, Republic of Korea)

  • Dong-Gyu Lee

    (Department of Artificial Intelligence, Kyungpook National University, Buk-gu, Daegu 41566, Republic of Korea)

Abstract

Convolutional neural networks (CNNs) have gained recognition for their remarkable performance across various tasks. However, the sheer number of parameters and the computational demands pose challenges, particularly on edge devices with limited processing power. In response to these challenges, this paper presents a novel approach aimed at enhancing the efficiency of deep learning models. Our method introduces the concept of accuracy and efficiency coefficients, offering a fine-grained control mechanism to balance the trade-off between network accuracy and computational efficiency. At our core is the Rewarded Meta-Pruning algorithm, guiding neural network training to generate pruned model weight configurations. The selection of this pruned model is based on approximations of the final model’s parameters, and it is precisely controlled through a reward function. This reward function empowers us to tailor the optimization process, leading to more effective fine-tuning and improved model performance. Extensive experiments and evaluations underscore the superiority of our proposed method when compared to state-of-the-art techniques. We conducted rigorous pruning experiments on well-established architectures such as ResNet-50, MobileNetV1, and MobileNetV2. The results not only validate the efficacy of our approach but also highlight its potential to significantly advance the field of model compression and deployment on resource-constrained edge devices.

Suggested Citation

  • Athul Shibu & Abhishek Kumar & Heechul Jung & Dong-Gyu Lee, 2023. "Rewarded Meta-Pruning: Meta Learning with Rewards for Channel Pruning," Mathematics, MDPI, vol. 11(23), pages 1-19, December.
  • Handle: RePEc:gam:jmathe:v:11:y:2023:i:23:p:4849-:d:1292784
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/23/4849/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/11/23/4849/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Athul Shibu & Dong-Gyu Lee, 2023. "EvolveNet: Evolving Networks by Learning Scale of Depth and Width," Mathematics, MDPI, vol. 11(16), pages 1-14, August.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      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:11:y:2023:i:23:p:4849-:d:1292784. 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.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.