Counterfactual Generation with Identifiability Guarantees
Hanqi Yan, Lingjing Kong, Lin Gui, Yuejie Chi, Eric Xing, Yulan He,, Kun Zhang

TL;DR
This paper introduces a new method called MATTE for counterfactual generation that guarantees identifiability of latent variables under domain-varying dependence, improving unsupervised style transfer performance without requiring paired data or labels.
Contribution
It provides theoretical identification guarantees for latent-variable models with domain-dependent content-style dependence, enabling a novel domain-adaptive counterfactual generation framework.
Findings
State-of-the-art results in unsupervised style transfer
Effective handling of domain-varying content-style dependence
No need for paired data or style labels
Abstract
Counterfactual generation lies at the core of various machine learning tasks, including image translation and controllable text generation. This generation process usually requires the identification of the disentangled latent representations, such as content and style, that underlie the observed data. However, it becomes more challenging when faced with a scarcity of paired data and labeling information. Existing disentangled methods crucially rely on oversimplified assumptions, such as assuming independent content and style variables, to identify the latent variables, even though such assumptions may not hold for complex data distributions. For instance, food reviews tend to involve words like tasty, whereas movie reviews commonly contain words such as thrilling for the same positive sentiment. This problem is exacerbated when data are sampled from multiple domains since the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
Taxonomy
TopicsManufacturing Process and Optimization
