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

Adaptive Hard Parameter Sharing Method Based on Multi-Task Deep Learning

Author

Listed:
  • Hongxia Wang

    (School of Statistics and Data Science, Nanjing Audit University, Nanjing 211815, China)

  • Xiao Jin

    (School of Statistics and Data Science, Nanjing Audit University, Nanjing 211815, China)

  • Yukun Du

    (School of Statistics and Data Science, Nanjing Audit University, Nanjing 211815, China)

  • Nan Zhang

    (School of Statistics and Data Science, Nanjing Audit University, Nanjing 211815, China)

  • Hongxia Hao

    (School of Statistics and Data Science, Nanjing Audit University, Nanjing 211815, China)

Abstract

Multi-task learning (MTL) improves the performance achieved on each task by exploiting the relevant information between tasks. At present, most of the mainstream deep MTL models are based on hard parameter sharing mechanisms, which can reduce the risk of model overfitting. However, negative knowledge transfer may occur, which hinders the performance improvement achieved for each task. In this paper, for situations when multiple tasks are jointly trained, we propose the adaptive hard parameter sharing method. On the basis of the adaptive hard parameter sharing method, the number of nodes in the network is dynamically updated by setting a continuous gradient difference-based sign threshold and a warm-up training iteration threshold through the relationships between the parameters and the loss function. After each task fully utilizes the shared information, adaptive nodes are used to further optimize each task, reducing the impact of negative migration. By using simulation studies and instance analyses, we demonstrate theoretical proof that the performance of the proposed method is better than that of the competing method.

Suggested Citation

  • Hongxia Wang & Xiao Jin & Yukun Du & Nan Zhang & Hongxia Hao, 2023. "Adaptive Hard Parameter Sharing Method Based on Multi-Task Deep Learning," Mathematics, MDPI, vol. 11(22), pages 1-18, November.
  • Handle: RePEc:gam:jmathe:v:11:y:2023:i:22:p:4639-:d:1279666
    as

    Download full text from publisher

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

    File URL: https://www.mdpi.com/2227-7390/11/22/4639/
    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:11:y:2023:i:22:p:4639-:d:1279666. 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.