pith. sign in

arxiv: 2311.08815 · v2 · pith:FQ3T4CRZnew · submitted 2023-11-15 · 💻 cs.LG · cs.AI· cs.CV· stat.ML

Self-Supervised Disentanglement by Leveraging Structure in Data Augmentations

classification 💻 cs.LG cs.AIcs.CVstat.ML
keywords styledatasomeapproachattributesaugmentationsdiscardedhowever
0
0 comments X
read the original abstract

Self-supervised representation learning often uses data augmentations to induce some invariance to "style" attributes of the data. However, with downstream tasks generally unknown at training time, it is difficult to deduce a priori which attributes of the data are indeed "style" and can be safely discarded. To deal with this, current approaches try to retain some style information by tuning the degree of invariance to some particular task, such as ImageNet object classification. However, prior work has shown that such task-specific tuning can lead to significant performance degradation on other tasks that rely on the discarded style. To address this, we introduce a more principled approach that seeks to disentangle style features rather than discard them. The key idea is to add multiple style embedding spaces where: (i) each is invariant to all-but-one augmentation; and (ii) joint entropy is maximized. We formalize our structured data-augmentation procedure from a causal latent-variable-model perspective, and prove identifiability of both content and individual style variables. We empirically demonstrate the benefits of our approach on both synthetic and real-world data.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Unsupervised Disentanglement Without Compromises : How Functional Orthogonality Enforces Identifiability

    cs.LG 2026-06 unverdicted novelty 7.0

    Enforcing local orthogonality on the Jacobian of the generative mapping yields identifiability for general nonlinear models when the latent domain has full combinatorial support.