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

MeTa Learning-Based Optimization of Unsupervised Domain Adaptation Deep Networks

Author

Listed:
  • Hsiau-Wen Lin

    (Department of Information Management, Chihlee University of Technology, Taipei 220305, Taiwan)

  • Trang-Thi Ho

    (Department of Computer Science and Information Engineering, Tamkang University, Taipei 251301, Taiwan)

  • Ching-Ting Tu

    (Department of Applied Mathematics, National Chung Hsing University, Taichung 402202, Taiwan)

  • Hwei-Jen Lin

    (Department of Computer Science and Information Engineering, Tamkang University, Taipei 251301, Taiwan)

  • Chen-Hsiang Yu

    (Multidisciplinary Graduate Engineering, College of Engineering, Northeastern University, Boston, MA 02115, USA)

Abstract

This paper introduces a novel unsupervised domain adaptation (UDA) method, MeTa Discriminative Class-Wise MMD (MCWMMD), which combines meta-learning with a Class-Wise Maximum Mean Discrepancy (MMD) approach to enhance domain adaptation. Traditional MMD methods align overall distributions but struggle with class-wise alignment, reducing feature distinguishability. MCWMMD incorporates a meta-module to dynamically learn a deep kernel for MMD, improving alignment accuracy and model adaptability. This meta-learning technique enhances the model’s ability to generalize across tasks by ensuring domain-invariant and class-discriminative feature representations. Despite the complexity of the method, including the need for meta-module training, it presents a significant advancement in UDA. Future work will explore scalability in diverse real-world scenarios and further optimize the meta-learning framework. MCWMMD offers a promising solution to the persistent challenge of domain adaptation, paving the way for more adaptable and generalizable deep learning models.

Suggested Citation

  • Hsiau-Wen Lin & Trang-Thi Ho & Ching-Ting Tu & Hwei-Jen Lin & Chen-Hsiang Yu, 2025. "MeTa Learning-Based Optimization of Unsupervised Domain Adaptation Deep Networks," Mathematics, MDPI, vol. 13(2), pages 1-24, January.
  • Handle: RePEc:gam:jmathe:v:13:y:2025:i:2:p:226-:d:1564626
    as

    Download full text from publisher

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

    File URL: https://www.mdpi.com/2227-7390/13/2/226/
    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:2025:i:2:p:226-:d:1564626. 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.