Correlation alignment and the maximum mean discrepancy are two widely used distribution-matching frameworks for unsupervised domain adaptation (UDA). However, high variance in these losses has been shown to undermine their effectiveness in minibatch optimisation settings.
arXiv:2607. 20367v1 Announce Type: new Abstract: Correlation alignment and the maximum mean discrepancy are two widely used distribution-matching frameworks for unsupervised domain adaptation (UDA).
The paper introduces Joint Distribution Alignment for Universal Domain Adaptation (JAUA), a new algorithm designed for scenarios where source and target domains have differing label spaces. It provides a theoretical upper bound on generalization error for Universal Domain Adaptation and proposes aligning joint distributions using Chi‑Square divergence, complemented by a progressive pseudo‑labeling strategy. Experiments on six public image datasets show JAUA outperforms existing methods in handling Universal Domain Adaptation challenges.
arXiv:2607. 20374v1 Announce Type: new Abstract: This paper studies the problem of stochastic variance reduction (SVR) for the maximum mean discrepancy (MMD) and correlation alignment (CORAL) loss functions.
arXiv:2407. 21311v2 Announce Type: replace-cross Abstract: Unsupervised domain adaptation (UDA) aims to mitigate domain shift, where the distribution of labeled source data differs from that of unlabeled target data.
arXiv:2601. 08379v2 Announce Type: replace-cross Abstract: Pre-trained diffusion models have emerged as powerful generative priors for both unconditional and conditional sample generation, yet their outputs often deviate from the characteristics of user-specific target data.
arXiv:2610.01890v1 Announce Type: cross Abstract: Deep generative networks have recently achieved unprecedented performance in precise image and video editing using sophisticated textual prompts. How...
arXiv:2606. 00558v1 Announce Type: new Abstract: Transfer learning aims to facilitate the learning of a target domain by transferring knowledge from a source domain.
arXiv:2607. 28125v2 Announce Type: replace-cross Abstract: Numerous unsupervised domain adaptation (UDA) algorithms exist, but for clinical practice, selecting the best-suited one along with proper hyperparameters often remains unclear, as the unlabeled deployment (target) domain prevents direct evaluation.
arXiv:2610.00873v1 Announce Type: cross Abstract: In many industrial applications, 1) tabular data is scarce and imbalanced and thus requires synthetic expansion; 2) input distributions drift between...
arXiv:2606. 07954v1 Announce Type: cross Abstract: Training large language models (LLMs) on heterogeneous data requires selecting minibatches that balance convergence speed with coverage across domains.
Numerous unsupervised domain adaptation (UDA) algori-thms exist, but for clinical practice, selecting the best-suited one along with proper hyperparameters often remains unclear, as the unlabeled deployment (target) domain prevents direct evaluation. We propose a label-free criterion that jointly selects the algorithm and hyperparameters for UDA.
arXiv:2608. 09193v1 Announce Type: cross Abstract: Unsupervised time-series domain adaptation (DA) addresses the challenge of transferring a classifier from a labeled source domain to an unlabeled target domain under distribution shifts induced by different users, sensors, devices, acquisition conditions, or temporal dynamics.