Where the Cost Falls: A Deployment-Aware Adoption Order for Stability Enhancements to Cycle-Consistent Adversarial Networks
Organizations: University of Ottawa, Ottawa, Canada · Queen’s University, Kingston, Canada
Abstract
Teams that adopt cycle-consistent adversarial networks for unpaired image-to-image translation meet the same obstacles: adversarial training oscillates or collapses, cycle consistency preserves coarse layout while finer texture drifts, and a single discriminator judging global realism misses local artifacts. Four enhancements address these failures, and they are usually compared on output quality alone. We show that they also divide sharply by where their cost falls, and that this division, which follows from the architecture and not from any particular run, yields an adoption order for teams under a compute or latency budget. A Wasserstein objective with gradient penalty, a VGG19 perceptual loss on the cycle reconstruction, and multi-scale discriminators change training only, so a team can adopt or drop them without altering what ships. Self-attention alone persists into the deployed generator, with memory growing as the square of the feature-map size, which makes it the one component a resource-constrained team should defer. We integrate all four onto a lightly tuned baseline for horse-to-zebra translation, introduced one at a time on a fixed control and then combined, and for each we give the failure mode it targets and how it integrates. We document the collapse and reconstruction-artifact modes the baseline produced, report what visual inspection of saved samples showed for each variant, and report Fréchet Inception Distance and Kernel Inception Distance for the combined model. We specify the protocol still needed, covering the individual variants, perceptual similarity, and downstream segmentation, to rank these enhancements on measured evidence.
Figures & tables
| Enhancement | Failure mode targeted | Mechanism | Observed qualitative effect |
|---|---|---|---|
| Baseline adjustments (control) | Unstable updates, limited capacity | Lower generator learning rate, geometric and color augmentation, extra residual block and convolutional layer | Smoother early training and slightly cleaner stripes than the raw baseline |
| WGAN-GP [ 5 ] | Oscillation and mode collapse | Earth-mover objective with a gradient penalty enforcing a Lipschitz critic | Fewer collapsed or blank outputs, more consistent stripe formation |
| VGG perceptual loss [ 6 , 7 ] | Loss of fine semantic detail | Match intermediate VGG19 features between each input and its cycle reconstruction | Sharper, better-placed stripes and more distinct object boundaries |
| Self-attention [ 8 ] | Locally inconsistent patterns | Attention over the full feature map inside the generator | Stripe orientation more coherent across the body |
| Multi-scale discriminators [ 9 ] | Detail missed by a single scale | Discriminators at coarse and fine resolutions contribute jointly | Reduced small-scale artifacts, crisper coat texture |
| Configuration | FID | KID ( ) |
|---|---|---|
| Combined model | 60 | 50 |
Generative Adversarial Networks
Generative Adversarial Networks (GANs) train competing generators and discriminators to synthesize data, translate images, and model complex distributions.
See all 177 papers