Invariant Model Learning on Local-Aware Wasserstein Geodesic for Domain Adaptation

As an important learning paradigm for signal processing and pattern recognition, unsupervised domain adaptation (UDA), which deals with the learning bias induced by the changing data environments (i.e., domains), has achieved great success in real-world applications. Mainstream UDA methods commonly adopt the discrepancy optimization on the two data domains directly, which ignore the hidden information in the latent intermediate domains and cannot sufficiently learn the invariant knowledge across domains; moreover, they usually fail when the domain gap is significant. In this work, a novel learning principle called Wasserstein invariant risk (WIR) is developed to gradually reduce the bias. The core idea is to recover the latent domains along the Wasserstein geodesic with local structure preservation, and explicitly map them into an invariant space via barycenter mapping. Intuitively, the Wasserstein geodesic captures the non-Euclidean structures of the latent domains. Methodologically, the barycenter mapping along geodesic can: 1) reduce the data discrepancy gradually and explore the hidden information; 2) ensure the consistency of risk estimation across domains; 3) admit invariance property of learning model for changing environments. Extensive experiments on visual UDA classification show the superiority of WIR over SOTA methods.

Authors

Institutions

Publication Details

Published
2025-03-12
DOI
https://doi.org/10.1109/icassp49660.2025.10888490
Citations
1
Primary Topic
Domain Adaptation and Few-Shot Learning
Type
article
Field-Weighted Citation Impact
2.48

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Invariant Model Learning on Local-Aware Wasserstein Geodesic for Domain Adaptation

Yiming Zhai, Chuan-Xian Ren, You-Wei Luo
1 citations
Domain Adaptation and Few-Shot Learning
2.48
article

Invariant Model Learning on Local-Aware Wasserstein Geodesic for Domain Adaptation

Yiming Zhai, Chuan-Xian Ren, You-Wei Luo
article en
1 citations

Abstract

As an important learning paradigm for signal processing and pattern recognition, unsupervised domain adaptation (UDA), which deals with the learning bias induced by the changing data environments (i.e., domains), has achieved great success in real-world applications. Mainstream UDA methods commonly adopt the discrepancy optimization on the two data domains directly, which ignore the hidden information in the latent intermediate domains and cannot sufficiently learn the invariant knowledge across domains; moreover, they usually fail when the domain gap is significant. In this work, a novel learning principle called Wasserstein invariant risk (WIR) is developed to gradually reduce the bias. The core idea is to recover the latent domains along the Wasserstein geodesic with local structure preservation, and explicitly map them into an invariant space via barycenter mapping. Intuitively, the Wasserstein geodesic captures the non-Euclidean structures of the latent domains. Methodologically, the barycenter mapping along geodesic can: 1) reduce the data discrepancy gradually and explore the hidden information; 2) ensure the consistency of risk estimation across domains; 3) admit invariance property of learning model for changing environments. Extensive experiments on visual UDA classification show the superiority of WIR over SOTA methods.

Jiaying University (CN)
National Natural Science Foundation of China
Climate action
Openalex Percentile: Top 11%
Domain Adaptation and Few-Shot Learning
2.48
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.