Methods › General › Loss Functions › Cycle Consistency Loss

Cycle Consistency Loss

448 papers tagged archive 2025-07-28

Introduced by Jun-Yan Zhu et al. in Unpaired Image-to-Image Translation using Cycle-Consistent Adversarial Networks

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

Cycle Consistency Loss is a type of loss used for generative adversarial networks that performs unpaired image-to-image translation. It was introduced with the CycleGAN architecture. For two domains X and Y, we want to learn a mapping G : X →Y and F: Y →X. We want to enforce the intuition that these mappings should be reverses of each other and that both mappings should be bijections. Cycle Consistency Loss encourages F(G(x)) ≈x and G(F(y)) ≈y. It reduces the space of possible mapping functions by enforcing forward and backwards consistency:

ℒ_(cyc)(G, F) = 𝔼_(x ∼p_(data)(x))[||F(G(x)) - x||₁] + 𝔼_(y ∼p_(data)(y))[||G(F(y)) - y||₁]

PaperSourceSee Code · junyanz/pytorch-CycleGAN-and-pix2pix

In Syntology for a different name, 'cycle-consistency', about another paper, arXiv:2108.03427: repository known, no verified implementation (declared_code; repositories: 2 listed of 2 in the graph, strongest link: official). The lookup matched a different name in Syntology's graph, 'cycle-consistency' (resolution: token_match); this answer is about that name. About another paper: this answer is about arXiv:2108.03427, while the archive credits arXiv:1703.10593.

Code Syntology holds under other names, as the lookup lists them (code_nearby); not a complete list, and none of them is this method.

Origin paper of this answer, arXiv:2108.03427 (its page on this site · its page on Syntology): Syntology's run record for its harvested code, 2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified (of 2 harvested samples) · 2 pointer-only (licence). The instrument figure counts failures of Syntology's instrument, not of the code. Ran means executed on a synthesized input, not that the code is correct.

Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.

What each level means, quoted from Syntology's server card: V0 “imports”; V1 “executes against a synthesized fixture and returns a value of the recorded type”; V2 “two implementations GENERATED from the paper's signature and spec agree numerically (1e-6) on fixture inputs” “neither of the two ever read the authors' own code, so V2 measures how unambiguously the paper specifies the method, not fidelity to the authors' implementation (measured 2026-09-11, commit 75eaa77: cross_checked_by is a second LLM on 2,628 of 2,831 served samples)”; V3 “paper-derived property tests pass on both of those same two generations.” The card adds: “No rung on this ladder compares the served code against the authors' implementation, so treat every level as evidence about runnability and internal agreement, not about matching the paper's results.” A level quoted in two parts is one definition the card writes as two clauses joined by a double hyphen, each clause quoted on its own (how these levels are quoted).

Papers archive 2025-07-28

archive papers tagged: 448 · with a code link: 148 · where Syntology ran a sample: 12 (9 with a run with no instrument failure, 3 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran (12 of 448 tagged: 9 with a run with no instrument failure, 3 where every run was a failure of Syntology's instrument)

Page 1 of 5: papers 1 to 100 of 448, newest first by the archive's date (ties by slug), in archive order.

Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.

Tasks archive 2025-07-28

20 shown of 306 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
Translation112
Image-to-Image Translation92
Image Generation50
Generative Adversarial Network49
Domain Adaptation42
Data Augmentation33
Semantic Segmentation30
Style Transfer30
Segmentation28
SSIM26
Computed Tomography (CT)16
Diagnostic15
Object Detection15
Unsupervised Domain Adaptation15
object-detection15
Denoising14
Super-Resolution14
Anatomy13
Image Segmentation13
Diversity11

Usage over time archive 2025-07-28

Papers per year tagged with Cycle Consistency Loss: 2017 to 2025, peak 79 79 0 2017: 11 papers 2017 2018: 36 papers 2018 2019: 58 papers 2019 2020: 79 papers 2020 2021: 62 papers 2021 2022: 66 papers 2022 2023: 58 papers 2023 2024: 53 papers 2024 2025: 25 papers 2025
Papers per year the archive tags with this method, by the paper's archive date (448 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

Loss Functions

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