</> Code with Papers by Syntology

Methods › General › Regularization › Path Length Regularization

Path Length Regularization

182 papers tagged archive 2025-07-28

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

Path Length Regularization is a type of regularization for generative adversarial networks that encourages good conditioning in the mapping from latent codes to images. The idea is to encourage that a fixed-size step in the latent space 𝒲 results in a non-zero, fixed-magnitude change in the image.

We can measure the deviation from this ideal empirically by stepping into random directions in the image space and observing the corresponding 𝐰 gradients. These gradients should have close to an equal length regardless of 𝐰 or the image-space direction, indicating that the mapping from the latent space to image space is well-conditioned.

At a single 𝐰 ∈𝒲 the local metric scaling properties of the generator mapping g(𝐰) : 𝒲 →𝒴 are captured by the Jacobian matrix 𝐉_𝐰 = δg(𝐰)/δ𝐰. Motivated by the desire to preserve the expected lengths of vectors regardless of the direction, we formulate the regularizer as:

𝔼_(𝐰,𝐲 ∼𝒩(0, 𝐈)) (||𝐉^𝐓_𝐰𝐲||₂ - a)²

where y are random images with normally distributed pixel intensities, and w ∼f(z), where z are normally distributed.

To avoid explicit computation of the Jacobian matrix, we use the identity 𝐉^𝐓_𝐰𝐲 = ∇_𝐰(g(𝐰)·y), which is efficiently computable using standard backpropagation. The constant a is set dynamically during optimization as the long-running exponential moving average of the lengths ||𝐉^𝐓_𝐰𝐲||₂, allowing the optimization to find a suitable global scale by itself.

The authors note that they find that path length regularization leads to more reliable and consistently behaving models, making architecture exploration easier. They also observe that the smoother generator is significantly easier to invert.

Source: Analyzing and Improving the Image Quality of StyleGANSee Code · NVlabs/stylegan2

Papers archive 2025-07-28

30 shown of 182, newest first. Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code; it is per sample and not a correctness claim.

Tasks archive 2025-07-28

20 shown of 139 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
Image Generation53
Attribute20
Generative Adversarial Network20
Image Manipulation14
Disentanglement13
Face Generation13
Diversity11
Data Augmentation10
Face Recognition10
Conditional Image Generation7
Translation7
Domain Adaptation6
Face Swapping6
Image-to-Image Translation5
Knowledge Distillation5
Transfer Learning5
Image Reconstruction4
Segmentation4
Semantic Segmentation4
Style Transfer4

Usage over time archive 2025-07-28

Papers per year tagged with Path Length Regularization: 2019 to 2025, peak 56 56 0 2019: 1 paper 2019 2020: 22 papers 2020 2021: 52 papers 2021 2022: 56 papers 2022 2023: 34 papers 2023 2024: 15 papers 2024 2025: 2 papers 2025
Papers per year the archive tags with this method, by the paper's archive date (182 dated). Bars are counts, not a trend claim.

Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).

Categories archive 2025-07-28

Regularization

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