Papers › A Disentangling Invertible Interpretation Network for Explaining Latent Representations

A Disentangling Invertible Interpretation Network for Explaining Latent Representations

27 Apr 2020CVPR 2020 6arXiv:2004.13166archive 2025-07-28

Patrick Esser, Robin Rombach, Björn Ommer

Neural networks have greatly boosted performance in computer vision by learning powerful representations of input data. The drawback of end-to-end training for maximal overall performance are black-box models whose hidden representations are lacking interpretability: Since distributed coding is optimal for latent layers to improve their robustness, attributing meaning to parts of a hidden feature vector or to individual neurons is hindered. We formulate interpretation as a translation of hidden representations onto semantic concepts that are comprehensible to the user. The mapping between both domains has to be bijective so that semantic modifications in the target domain correctly alter the original representation. The proposed invertible interpretation network can be transparently applied on top of existing architectures with no need to modify or retrain them. Consequently, we translate an original representation to an equivalent yet interpretable one and backwards without affecting the expressiveness and performance of the original. The invertible interpretation network disentangles the hidden representation into separate, semantically meaningful concepts. Moreover, we present an efficient approach to define semantic concepts by only sketching two images and also an unsupervised strategy. Experimental evaluation demonstrates the wide applicability to interpretation of existing classification and image generation networks as well as to semantically guided image manipulation.

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="2004.13166")

Code

Syntology Ran 1 of 14 code samples harvested from 2 repositories linked to this paper; 13 have no recorded run. Of those that ran: 1 ran · honoured contract.

By repository: community (archive-listed): 14 samples from 2 repositories, 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.

CompVis/iin mentioned on GitHubpytorchMIT report
KongBOy/analyze_16_code_iin mentioned on GitHubpytorchMIT 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

14 samples harvested; 1 ran; 1 honoured the contract we drafted; 13 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 · honoured contract
13unverified

Licence: 0 of the 14 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 2 repositories linked to this paper, official or community; each sample names its own and says which. “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.

adopt_weight CompVis/iin/iin/losses/ae.py community (archive-listed) ran · honoured contract fingerprinted MIT (permissive) · 7439a9d4c6be04b0 · report
clf_callback CompVis/iin/iin/iterators/clf.py community (archive-listed) unverified MIT (permissive) · d34031e4ccffb523 · report
get_learning_rate CompVis/iin/iin/iterators/base.py community (archive-listed) unverified MIT (permissive) · a6900d411978f53b · report
isflow KongBOy/analyze_16_code_iin/try_edexplore.py community (archive-listed) unverified MIT (permissive) · 089f1a241531ba82 · report
isimage KongBOy/analyze_16_code_iin/try_edexplore.py community (archive-listed) unverified MIT (permissive) · 6050fa71db03b49d · report
istext KongBOy/analyze_16_code_iin/try_edexplore.py community (archive-listed) unverified MIT (permissive) · 2256a23076322784 · report
l1 CompVis/iin/iin/losses/ae.py community (archive-listed) unverified MIT (permissive) · 7ef28876c796d72c · report
l2 CompVis/iin/iin/losses/ae.py community (archive-listed) unverified MIT (permissive) · 4d2ab2a1446f3762 · report
loss_callback CompVis/iin/iin/iterators/iin.py community (archive-listed) unverified MIT (permissive) · 5b8377efee227f73 · report
loss_callback KongBOy/analyze_16_code_iin/iin/iterators/iin.py community (archive-listed) unverified MIT (permissive) · fdda1426d1bb0886 · report
nll CompVis/iin/iin/losses/iin.py community (archive-listed) unverified MIT (permissive) · 2c181328877e9fc7 · report
reconstruction_callback CompVis/iin/iin/iterators/ae.py community (archive-listed) unverified MIT (permissive) · 799ba3b3a1846793 · report
tonp CompVis/iin/iin/iterators/base.py community (archive-listed) unverified MIT (permissive) · 3d7adb2f95674903 · report
totorch CompVis/iin/iin/iterators/base.py community (archive-listed) unverified MIT (permissive) · f884ce744d1572d7 · report

Tasks

Image GenerationImage Manipulation

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

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