Research map / Label-efficient and robust learning / Domain adaptation and generalization
Rethinking Joint Maximum Mean Discrepancy for Visual Domain Adaptation
Wei Wang, Haifeng Xia, Chao Huang, Zhengming Ding, Cong Wang, Haojie Li, Xiaochun Cao
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's abstract only. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Revisits joint maximum mean discrepancy (JMMD) for visual domain adaptation to make it usable inside a subspace-learning framework.
Problem
JMMD measures joint distribution differences between source and target domains in domain adaptation, but it is underexplored and hard to use in subspace learning because its empirical estimate involves a tensor-product operator whose partial derivative is difficult to obtain.
Approach
Rethinks JMMD so that its empirical estimation can be applied within a subspace-learning framework despite the tensor-product operator; the abstract is truncated so the exact formulation is not stated.
Experimental setup
Builds on: joint maximum mean discrepancy
Closest papers by meaning
- Learning an Invariant Hilbert Space for Domain Adaptation (CVPR 2017 · similarity 0.88)
- Joint Geometrical and Statistical Alignment for Visual Domain Adaptation (CVPR 2017 · similarity 0.88)
- Maximum Structural Generation Discrepancy for Unsupervised Domain Adaptation (TPAMI 2022 · similarity 0.88)
- When Unsupervised Domain Adaptation Meets Tensor Representations (ICCV 2017 · similarity 0.88)
- Mind the Class Weight Bias: Weighted Maximum Mean Discrepancy for Unsupervised Domain Adaptation (CVPR 2017 · similarity 0.87)
- A General Representation-Based Approach to Multi-Source Domain Adaptation (ICML 2025 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
