Rethinking the Flow-Based Gradual Domain Adaptation: A Semi-Dual Optimal Transport Perspective
Not on the map. Why?
Abstract (arXiv)
Gradual domain adaptation (GDA) aims to mitigate domain shift by progressively adapting models from the source domain to the target domain via intermediate domains. However, real intermediate domains are often unavailable or ineffective, necessitating the synthesis of intermediate samples. Flow-based models have recently been used for this purpose by interpolating between source and target distributions. Notably, their training typically relies on sample-based log-likelihood estimation, which can discard useful information and thus degrade GDA performance. The key to addressing this limitation is constructing the intermediate domains via samples directly. To this end, we propose an Entropy-regularized Semi-dual Unbalanced Optimal Transport (E-SUOT) framework to construct intermediate domains. Specifically, we reformulate flow-based GDA as a Lagrangian dual problem and derive an equivalent semi-dual objective that circumvents the need for likelihood estimation. However, the dual problem leads to an unstable min-max training procedure. To alleviate this issue, we further introduce the entropy regularization to convert it into a more stable sequential optimization procedure. Based on this, we propose a novel GDA training framework and provide theoretical analysis in terms of stability and generalization. Finally, extensive experiments are conducted to demonstrate the efficacy of the E-SUOT framework.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 81 of its 144 references that are in the map. First posted on arXiv 1 Feb 2026.
Builds on
81 of 144 references.
References · 81
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2021Diffusion Models Beat GANs on Image Synthesiscited by 8,185
- 2022Flow Matching for Generative Modelingcited by 5,426
- 2018UMAP: Uniform Manifold Approximation and Projection for Dimension Reductioncited by 2,841
- 2021Convex optimizationcited by 2,479
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
- 2016Density estimation using Real NVPcited by 2,029
- 2014Unsupervised Domain Adaptation by Backpropagationcited by 1,906
- 2015Learning Transferable Features with Deep Adaptation Networkscited by 1,323
- 2019Normalizing Flows for Probabilistic Modeling and Inferencecited by 1,315
- 2017Adversarial Discriminative Domain Adaptationcited by 1,309
- 2017Deep Hashing Network for Unsupervised Domain Adaptationcited by 1,181
38 more
- 2016Stein Variational Gradient Descent: A General Purpose Bayesian Inference Algorithmcited by 498
- 2015Optimal Transport for Domain Adaptationcited by 457
- 2019Sliced Score Matching: A Scalable Approach to Density and Score Estimationcited by 381
- 2017Joint Distribution Optimal Transportation for Domain Adaptationcited by 280
- 2020Theoretical Analysis of Self-Training with Deep Networks on Unlabeled Datacited by 179
- 2017Stein Variational Gradient Descent as Gradient Flowcited by 149
- 2020Understanding Self-Training for Gradual Domain Adaptationcited by 149
- 2020Gradually Vanishing Bridge for Adversarial Domain Adaptationcited by 130
- 2018Analysis of Langevin Monte Carlo via convex optimizationcited by 126
- 2020FixBi: Bridging Domain Spaces for Unsupervised Domain Adaptationcited by 124
- 2022Neural Optimal Transportcited by 123
- 2021Cycle Self-Training for Domain Adaptationcited by 120
- 2021Do Neural Optimal Transport Solvers Work? A Continuous Wasserstein-2 Benchmarkcited by 95
- 2025Feynman-Kac Correctors in Diffusion: Annealing, Guidance, and Product of Expertscited by 85
- 2021Generative Modeling with Optimal Transport Mapscited by 80
- 2020SENTRY: Selective Entropy Optimization via Committee Consistency for Unsupervised Domain Adaptationcited by 78
- 2020Continuously Indexed Domain Adaptationcited by 74
- 2024Variational Bayesian Last Layerscited by 67
- 2017Gradient Estimators for Implicit Modelscited by 58
- 2021Variational Wasserstein gradient flowcited by 53
- 2025Empowering LLMs with Logical Reasoning: A Comprehensive Surveycited by 51
- 2019Wasserstein Proximal Algorithms for the Schr"odinger Bridge Problem: Density Control with Nonlinear Driftcited by 50
- 2023Tractable Function-Space Variational Inference in Bayesian Neural Networkscited by 41
- 2023Generative Modeling through the Semi-dual Formulation of Unbalanced Optimal Transportcited by 39
- 2021KALE Flow: A Relaxed KL Gradient Flow for Probabilities with Disjoint Supportcited by 37
- 2023Generative Sliced MMD Flows with Riesz Kernelscited by 36
- 2022Understanding Gradual Domain Adaptation: Improved Analysis, Optimal Path and Beyondcited by 32
- 2022Gradual Domain Adaptation without Indexed Intermediate Domainscited by 26
- 2024Provable Benefit of Annealed Langevin Monte Carlo for Non-log-concave Samplingcited by 23
- 2014Optimal steering of a linear stochastic system to a final probability distributioncited by 22
- 2024Scalable Wasserstein Gradient Flow for Generative Modeling through Unbalanced Optimal Transportcited by 22
- 2021Gradual Domain Adaptation in the Wild:When Intermediate Distributions are Absentcited by 21
- 2024Doubly Robust Causal Effect Estimation under Networked Interference via Targeted Learningcited by 19
- 2023Gradual Domain Adaptation: Theory and Algorithmscited by 18
- 2014Optimal steering of a linear stochastic system to a final probability distribution, part IIcited by 17
- 2021Sampling with Mirrored Stein Operatorscited by 17
- 2025Pave Your Own Path: Graph Gradual Domain Adaptation on Fused Gromov-Wasserstein Geodesicscited by 17
- 2024Sparse Inducing Points in Deep Gaussian Processes: Enhancing Modeling with Denoising Diffusion Variational Inferencecited by 16
50 most cited of 81 All 81 (JSON)
Built on by
Not cited yet.