Skip to content

SGN: A Similarity-based Generative Network for Data Generation under Distribution Shift

Jul 2026 · arXiv.org · Vol abs/2607.18072 · 0 citations · 46 references
Computer Science

TL;DR

A Similarity-based Generative Network (SGN) is proposed, a reusable framework that is trained once on labeled source data and applied to new target domains without parameter updates, demonstrating the effectiveness of SGN for target-guided data augmentation under source-to-target distribution shifts.

Abstract

Generative models trained on a source domain often produce samples that are poorly aligned with shifted target domains, limiting their effectiveness for target-domain data augmentation. Although target-specific adaptation can reduce this mismatch, it typically requires additional optimization and domain-specific parameters. We propose a Similarity-based Generative Network (SGN), a reusable framework that is trained once on labeled source data and applied to new target domains without parameter updates. SGN learns a latent space structured by label-induced pairwise similarities while preserving reconstructive information through an encoder-decoder architecture. At generation time, a small labeled representative set from the target domain is encoded and combined in the learned latent space, allowing the generated samples to inherit target-specific characteristics while maintaining class consistency. We further analyze the realizability and dimensionality requirements of the proposed similarity structure. Experiments on image and tabular datasets demonstrate the effectiveness of SGN for target-guided data augmentation under source-to-target distribution shifts.

View source

Similar papers

Aug 2026

Active Domain Adaptation Under Concept Shift.

This paper proposes ADA-CS, a plug-and-play module compatible with any ADA or ASFDA framework, and introduces a CSS metric to quantify the Concept Shift Severity across domains, revealing that non-negligible concept shift exists in many transfer tasks.

Zi-Kang Zhu, Yiyan Huang, Xing Yan · 1 citation

Efficient Inference under Label Shift in Unsupervised Domain Adaptation

This paper considers a particular type of distribution shift, label shift, and develops an e-icient inference procedure for general parameters characterizing the unlabeled target population, and proposes a progressive estimation strategy that unfolds in three stages: an initial heuristic guess, a consistent estimation,...

Yan-Yuan Ma, Ji-Wei Zhao · 0 citations
Open access Aug 2026

Towards source-free domain adaptation: a model-heterogeneous perspective

A Peer-level Heterogeneous Perception Framework is proposed that departs from such paradigms by enabling balanced collaboration between heterogeneous models by introducing an auxiliary domain that is significantly different from the target domain and employ an auxiliary model with the same architecture as the source mo...

Zhi-Ze Wu, Yu-Tao Fu, Huan-Xin Zou et al. · 0 citations
Open access Jul 2024

Efficient unsupervised domain adaptation via self-supervised vision transformer and synergistic cross-domain alignment

Efficient Unsupervised Domain Adaptation (EUDA) is proposed, a parameter-efficient framework that leverages a frozen DINOv2 backbone as a feature extractor and updates only a lightweight bottleneck and classification head to promote both discriminative learning and cross-domain alignment.

Ali Abedi, Q. M. Jonathan Wu, Ning Zhang et al. · 9 citations
#artificial intelligence Preprint Aug 2026

Learning-State-Aware Dynamic Generative Data Augmentation on Small-Scale Datasets

Learning-state-aware dynamic generative data augmentation (LSADA) is proposed, which introduces a decoupled data augmentation and diffusion fusion strategy that applies strength-controlled transformations to class-relevant regions and generates diverse class-irrelevant regions, progressively fusing them to improve imag...

Ting Xiang, Chen-Xi Deng, Jinhui Zhao et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.