mlsanityData to 7 Oct 2026

Bi-level Unbalanced Optimal Transport for Partial Domain Adaptation

arXiv 2506.08020 ↗First posted 19 May 2025cs.LG cs.AI cs.CVcited by 0

Not on the map. Why?

Abstract (arXiv)

Partial domain adaptation (PDA) problem requires aligning cross-domain samples while distinguishing the outlier classes for accurate knowledge transfer. The widely used weighting framework tries to address the outlier classes by introducing the reweighed source domain with a similar label distribution to the target domain. However, the empirical modeling of weights can only characterize the sample-wise relations, which leads to insufficient exploration of cluster structures, and the weights could be sensitive to the inaccurate prediction and cause confusion on the outlier classes. To tackle these issues, we propose a Bi-level Unbalanced Optimal Transport (BUOT) model to simultaneously characterize the sample-wise and class-wise relations in a unified transport framework. Specifically, a cooperation mechanism between sample-level and class-level transport is introduced, where the sample-level transport provides essential structure information for the class-level knowledge transfer, while the class-level transport supplies discriminative information for the outlier identification. The bi-level transport plan provides guidance for the alignment process. By incorporating the label-aware transport cost, the local transport structure is ensured and a fast computation formulation is derived to improve the efficiency. Extensive experiments on benchmark datasets validate the competitiveness of BUOT.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 26 of its 55 references that are in the map. First posted on arXiv 19 May 2025.

Builds on

26 of 55 references.

References · 26

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  3. 2014ImageNet Large Scale Visual Recognition Challengecited by 8,441
  4. 2015Domain-Adversarial Training of Neural Networkscited by 3,023
  5. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
  6. 2017Deep Hashing Network for Unsupervised Domain Adaptationcited by 1,181
  7. 2018Computational Optimal Transportcited by 765
  8. 2014Deep Domain Confusion: Maximizing for Domain Invariancecited by 597
  9. 2017VisDA: The Visual Domain Adaptation Challengecited by 432
  10. 2019Contrastive Adaptation Network for Unsupervised Domain Adaptationcited by 407
  11. 2017Joint Distribution Optimal Transportation for Domain Adaptationcited by 280
  12. 2018Partial Adversarial Domain Adaptationcited by 127
14 more
  1. 2018Importance Weighted Adversarial Nets for Partial Domain Adaptationcited by 90
  2. 2019Learning to Transfer Examples for Partial Domain Adaptationcited by 86
  3. 2017Partial Transfer Learning with Selective Adversarial Networkscited by 84
  4. 2020A Balanced and Uncertainty-aware Approach for Partial Domain Adaptationcited by 55
  5. 2020Deep Residual Correction Network for Partial Domain Adaptationcited by 45
  6. 2020CO-Optimal Transportcited by 42
  7. 2021Contrastive Domain Adaptationcited by 36
  8. 2020Unsupervised Domain Adaptation via Discriminative Manifold Propagationcited by 33
  9. 2021Conditional Bures Metric for Domain Adaptationcited by 25
  10. 2019Domain Adversarial Reinforcement Learning for Partial Domain Adaptationcited by 16
  11. 2020Learning Target Domain Specific Classifier for Partial Domain Adaptationcited by 16
  12. 2020Select, Label, and Mix: Learning Discriminative Invariant Feature Representations for Partial Domain Adaptationcited by 16
  13. 2021Partial Domain Adaptation without Domain Alignmentcited by 11
  14. 2022From Big to Small: Adaptive Learning to Partial-Set Domainscited by 9

Built on by

Not cited yet.