Weighted Partial Optimal Transport for Multi-Source Partial Domain Adaptation
Övrigt konferensbidrag, 2026

We develop a theoretical and algorithmic framework for multi-source partial domain adaptation (MSPDA) by deriving a generalization bound that relates the target loss to weighted empirical source losses and source-specific partial Wasserstein distances. This bound motivates a partial optimal transport algorithm, termed MS-WARMPOT, that shares a common feature extractor across domains, addressing multi-source heterogeneity. MS-WARMPOT learns source-target sample weights that suppress outlier classes and prevent negative transfer, thereby unifying multi-source domain adaptation (MSDA) and partial domain adaptation within a single framework. Experiments on standard MSDA and MSPDA benchmarks demonstrate competitive performance against the state-of-the-art methods.

Partial Domain Adaptation

Generalization Bounds

Multi-Source Domain Adaptation

Optimal Transport

Författare

Jayadev Naram

Chalmers, Elektroteknik, Kommunikation, Antenner och Optiska Nätverk

Ziming Wang

Chalmers, Matematiska vetenskaper, Tillämpad matematik och statistik

Rebecka Jörnsten

Chalmers, Matematiska vetenskaper, Tillämpad matematik och statistik

Giuseppe Durisi

Chalmers, Elektroteknik, Kommunikation, Antenner och Optiska Nätverk

Catch, Adapt, and Operate: Monitoring ML Models Under Drift Workshop, ICLR 2026
Rio de Janeiro, Brazil,

Infrastruktur

C3SE (-2020, Chalmers Centre for Computational Science and Engineering)

Ämneskategorier (SSIF 2025)

Artificiell intelligens

Mer information

Senast uppdaterat

2026-09-08