Pith. sign in

REVIEW 1 cited by

DNA-GAN: Learning Disentangled Representations from Multi-Attribute Images

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1711.05415 v2 pith:UU7S5YRX submitted 2017-11-15 cs.CV

classification cs.CV
keywords imagesfactorsrepresentationsdisentanglinglearningpiececertaindifferent
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Disentangling factors of variation has become a very challenging problem on representation learning. Existing algorithms suffer from many limitations, such as unpredictable disentangling factors, poor quality of generated images from encodings, lack of identity information, etc. In this paper, we propose a supervised learning model called DNA-GAN which tries to disentangle different factors or attributes of images. The latent representations of images are DNA-like, in which each individual piece (of the encoding) represents an independent factor of the variation. By annihilating the recessive piece and swapping a certain piece of one latent representation with that of the other one, we obtain two different representations which could be decoded into two kinds of images with the existence of the corresponding attribute being changed. In order to obtain realistic images and also disentangled representations, we further introduce the discriminator for adversarial training. Experiments on Multi-PIE and CelebA datasets finally demonstrate that our proposed method is effective for factors disentangling and even overcome certain limitations of the existing methods.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. URECA: The Chain of Two Minimum Set Cover Problems exists behind Adaptation to Shifts in Semantic Code Search

    cs.AI 2025-02 reject novelty 5.0 of 10

    The paper derives (with a flawed Lebesgue-integral argument) that entropy minimization performs two-level set-cover clustering and introduces URECA, a union-find clustering loss that improves few-shot code-search adaptation.

Pith tools