Exploring Semantic Variations in GAN Latent Spaces via Matrix Factorization

Andrey Palaev, Rustam A. Lukmanov, Adil Khan
5/23/2023
cs.CVcs.LG

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

Controlled data generation with GANs is desirable but challenging due to the nonlinearity and high dimensionality of their latent spaces. In this work, we explore image manipulations learned by GANSpace, a state-of-the-art method based on PCA. Through quantitative and qualitative assessments we show: (a) GANSpace produces a wide range of high-quality image manipulations, but they can be highly entangled, limiting potential use cases; (b) Replacing PCA with ICA improves the quality and disentanglement of manipulations; (c) The quality of the generated images can be sensitive to the size of GANs, but regardless of their complexity, fundamental controlling directions can be observed in their latent spaces.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{palaev2023exploring,
  title  = {Exploring Semantic Variations in GAN Latent Spaces via Matrix Factorization},
  author = {Andrey Palaev and Rustam A. Lukmanov and Adil Khan},
  year   = {2023},
  eprint = {2305.14551},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2305.14551v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2305.14551.svg)](https://codeofpaper.com/paper/2305.14551)

Discussion