aiqbench analysis
SGN addresses the critical challenge of domain shift in generative models by introducing a reusable framework that adapts to target distributions without requiring full retraining or additional optimization steps. By structuring its latent space around label-induced similarities, this approach effectively generates augmented data for both image and tabular tasks while preserving class consistency under distribution shifts. This method offers a practical solution for improving model robustness in scenarios where source and target domain data differ significantly.
SGN: A Similarity-based Generative Network for Data Generation under Distribution Shift
arXiv:2607.18072v1 Announce Type: cross 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.
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.
Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
arXiv:2607.18072 [cs.LG]
(or arXiv:2607.18072v1 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2607.18072 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 247 words
Related coverage

PIRAMID: Progress and Plans
LessWrong · Jul 27, 2026

Digital States 2026: AI Moves From Experiment to Infrastructure
govtech.com · Sep 24, 2026
[AINews] High Taste Testers Ep. 1
Latent Space · Oct 17, 2026
News Archive 2026
Quantum Computing Report · Jul 25, 2026