Content-Style Learning from Unaligned Domains: Identifiability under Unknown Latent Dimensions
Sagar Shrestha, Xiao Fu
摘要
Understanding identifiability of latent content and style variables from unaligned multi-domain data is essential for tasks such as domain translation and data generation. Existing works on content-style identification were often developed under somewhat stringent conditions, e.g., that all latent components are mutually independent and that the dimensions of the content and style variables are known. We introduce a new analytical framework via cross-domain latent distribution matching (LDM), which establishes content-style identifiability under substantially more relaxed conditions. Specifically, we show that restrictive assumptions such as component-wise independence of the latent variables can be removed. Most notably, we prove that prior knowledge of the content and style dimensions is not necessary for ensuring identifiability, if sparsity constraints are properly imposed onto the learned latent representations. Bypassing the knowledge of the exact latent dimension has been a longstanding aspiration in unsupervised representation learning-our analysis is the first to underpin its theoretical and practical viability. On the implementation side, we recast the LDM formulation into a regularized multi-domain GAN loss with coupled latent variables. We show that the reformulation is equivalent to LDM under mild conditions-yet requiring considerably less computational resource. Experiments corroborate with our theoretical claims. INTRODUCTION In multi-domain learning, "domains" are typically characterized by a distinct "style" that sets their data apart from others (Choi et al., 2020) . Take handwritten digits as an example: writing styles of different persons can define different domains. Shared information across all domains, such as the identities of the digits in this case, is termed as "content". Learning content and style representations from multi-domain data facilitates many important applications, e.g., domain translation (
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper2
- Melodia: Training-Free Music Editing Guided by Attention Probing in Diffusion ModelsYi Yang, Haowen Li, Tianxiang Li, Boyu Cao 等AAAI 2026 · 被引用 1 次
- Content-Style Identification via Differential IndependenceSubash Timilsina, Hoang-Son Nguyen, Sagar Shrestha, Xiao FuICML 2026
它引用的顶会 Paper17
- Understanding Contrastive Representation Learning through Alignment and Uniformity on the HypersphereTongzhou Wang, Phillip IsolaICML 2020 · 被引用 2,360 次
- Training Generative Adversarial Networks with Limited DataTero Karras, Miika Aittala, Janne Hellsten, Samuli Laine 等NeurIPS 2020 · 被引用 2,345 次
- Self-Supervised Learning with Data Augmentations Provably Isolates Content from StyleJulius von Kügelgen, Yash Sharma, Luigi Gresele, Wieland Brendel 等NeurIPS 2021 · 被引用 421 次
- Contrastive Learning Inverts the Data Generating ProcessRoland S. Zimmermann, Yash Sharma, Steffen Schneider, Matthias Bethge 等ICML 2021 · 被引用 264 次
- Partial disentanglement for domain adaptationLingjing Kong, Shaoan Xie, Weiran Yao, Yujia Zheng 等ICML 2022 · 被引用 80 次
相关 Paper
- Counterfactual Generation with Identifiability GuaranteesHanqi Yan, Lingjing Kong, Lin Gui, Yuejie Chi 等NeurIPS 2023 · 被引用 16 次
- Towards Identifiable Unsupervised Domain Translation: A Diversified Distribution Matching ApproachSagar Shrestha, Xiao FuICLR 2024 · 被引用 6 次
- Multi-domain image generation and translation with identifiability guaranteesShaoan Xie, Lingjing Kong, Mingming Gong, Kun ZhangICLR 2023
- Unpaired Multi-Domain Causal Representation LearningNils Sturma, Chandler Squires, Mathias Drton, Caroline UhlerNeurIPS 2023 · 被引用 43 次
- Synergy Between Sufficient Changes and Sparse Mixing Procedure for Disentangled Representation LearningZijian Li, Shunxing Fan, Yujia Zheng, Ignavier Ng 等ICLR 2025
