Papers › Low-Rank Subspaces in GANs

Low-Rank Subspaces in GANs

8 Jun 2021NeurIPS 2021 12arXiv:2106.04488archive 2025-07-28

Jiapeng Zhu, Ruili Feng, Yujun Shen, Deli Zhao, ZhengJun Zha, Jingren Zhou, Qifeng Chen

The latent space of a Generative Adversarial Network (GAN) has been shown to encode rich semantics within some subspaces. To identify these subspaces, researchers typically analyze the statistical information from a collection of synthesized data, and the identified subspaces tend to control image attributes globally (i.e., manipulating an attribute causes the change of an entire image). By contrast, this work introduces low-rank subspaces that enable more precise control of GAN generation. Concretely, given an arbitrary image and a region of interest (e.g., eyes of face images), we manage to relate the latent space to the image region with the Jacobian matrix and then use low-rank factorization to discover steerable latent subspaces. There are three distinguishable strengths of our approach that can be aptly called LowRankGAN. First, compared to analytic algorithms in prior work, our low-rank factorization of Jacobians is able to find the low-dimensional representation of attribute manifold, making image editing more precise and controllable. Second, low-rank factorization naturally yields a null space of attributes such that moving the latent code within it only affects the outer region of interest. Therefore, local image editing can be simply achieved by projecting an attribute vector into the null space without relying on a spatial mask as existing methods do. Third, our method can robustly work with a local region from one image for analysis yet well generalize to other images, making it much easy to use in practice. Extensive experiments on state-of-the-art GAN models (including StyleGAN2 and BigGAN) trained on various datasets demonstrate the effectiveness of our LowRankGAN.

PaperPDFConference PDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2106.04488")

Code

Syntology Ran 1 of 9 code samples harvested from 1 repository linked to this paper; 8 have no recorded run. Of those that ran: 1 ran with no contract checked.

By repository: official repository: 9 samples from 1 repository, 1 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

zhujiapeng/LowRankGAN officialmentioned in papermentioned on GitHubtfMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

9 samples harvested; 1 ran; 0 honoured the contract we drafted; 8 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran
8unverified

Licence: 0 of the 9 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from zhujiapeng/LowRankGAN. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

import_handler zhujiapeng/LowRankGAN/dnnlib/tflib/network.py official repository ran MIT (permissive) · 9757ed6aa09ee00c · report
convert_path zhujiapeng/LowRankGAN/dnnlib/submission/submit.py official repository unverified MIT (permissive) · 5a6569d11eafa188 · report
get_mask zhujiapeng/LowRankGAN/coordinate.py official repository unverified MIT (permissive) · 4e8ae4e7d7c2c4a3 · report
get_mask_by_coordinates zhujiapeng/LowRankGAN/coordinate.py official repository unverified MIT (permissive) · 05c6bc0878c2290f · report
get_mask_by_segmentation zhujiapeng/LowRankGAN/coordinate.py official repository unverified MIT (permissive) · 7ea70df01520bdf0 · report
get_path_from_template zhujiapeng/LowRankGAN/dnnlib/submission/submit.py official repository unverified MIT (permissive) · 9d5002fbab594877 · report
get_plugin zhujiapeng/LowRankGAN/dnnlib/tflib/custom_ops.py official repository unverified MIT (permissive) · ae7f8c2a374edf1c · report
get_template_from_path zhujiapeng/LowRankGAN/dnnlib/submission/submit.py official repository unverified MIT (permissive) · 1f61e80b10011e25 · report
resize_image zhujiapeng/LowRankGAN/compute_jacobian.py official repository unverified MIT (permissive) · 29bfeffdb65e32bc · report

Tasks

Attribute

1 archive task tag without a task page not shown.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

ConvolutionPath Length RegularizationR1 RegularizationWeight Demodulation

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections