Methods › Computer Vision › Likelihood-Based Generative Models › NICE

Non-linear Independent Component Estimation

NICE

22 papers tagged archive 2025-07-28

Introduced by Laurent Dinh et al. in NICE: Non-linear Independent Components Estimation

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

NICE, or Non-Linear Independent Components Estimation is a framework for modeling complex high-dimensional densities. It is based on the idea that a good representation is one in which the data has a distribution that is easy to model. For this purpose, a non-linear deterministic transformation of the data is learned that maps it to a latent space so as to make the transformed data conform to a factorized distribution, i.e., resulting in independent latent variables. The transformation is parameterised so that computing the determinant of the Jacobian and inverse Jacobian is trivial, yet it maintains the ability to learn complex non-linear transformations, via a composition of simple building blocks, each based on a deep neural network. The training criterion is simply the exact log-likelihood. The transformation used in NICE is the affine coupling layer without the scale term, known as additive coupling layer:

y_(I₂) = x_(I₂) + m(x_(I₁))

x_(I₂) = y_(I₂) + m(y_(I₁))

PaperSourceSee Code · paultsw/nice_pytorch

In Syntology about another paper, arXiv:2206.03014: repository known, no verified implementation (declared_code; repositories: 5 listed of 21 in the graph, strongest link: official). About another paper: this answer is about arXiv:2206.03014, while the archive credits arXiv:1410.8516.

Origin paper of this answer, arXiv:2206.03014 (its page on this site · its page on Syntology): Syntology's run record for its harvested code, 1 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; 1 where Syntology's instrument failed) · 1 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.

Papers archive 2025-07-28

archive papers tagged: 22 · with a code link: 10 · where Syntology ran a sample: 3 (2 with a run with no instrument failure, 1 where every run was a failure of Syntology's instrument) Syntology

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

Page 1 of 1: papers 1 to 22 of 22, 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 39 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
Causal Inference2
Graph Generation2
Image Captioning2
Scene Graph Generation2
counterfactual2
All1
CPU1
Causal Identification1
Class Incremental Learning1
Clinical Knowledge1
Continual Learning1
Deep Learning1
Diagnostic1
Entity Disambiguation1
Fairness1
Hippocampus1
Image Generation1
Image Registration1
Incremental Learning1
Knowledge Distillation1

Usage over time archive 2025-07-28

Papers per year tagged with NICE: 2014 to 2025, peak 7 7 0 2014: 1 paper 2014 2015: 0 papers 2015 2016: 0 papers 2016 2017: 0 papers 2017 2018: 0 papers 2018 2019: 0 papers 2019 2020: 1 paper 2020 2021: 4 papers 2021 2022: 4 papers 2022 2023: 7 papers 2023 2024: 4 papers 2024 2025: 1 paper 2025
Papers per year the archive tags with this method, by the paper's archive date (22 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

Likelihood-Based Generative ModelsGenerative Models

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