Methods › Computer Vision › Generative Models › SIG

Sliced Iterative Generator

SIG

17 papers tagged archive 2025-07-28

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

The Sliced Iterative Generator (SIG) is an iterative generative model that is a Normalizing Flow (NF), but shares the advantages of Generative Adversarial Networks (GANs). The model is based on iterative Optimal Transport of a series of 1D slices through the data space, matching on each slice the probability distribution function (PDF) of the samples to the data. To improve the efficiency, the directions of the orthogonal slices are chosen to maximize the PDF difference between the generated samples and the data using Wasserstein distance at each iteration. A patch based approach is adopted to model the images in a hierarchical way, enabling the model to scale well to high dimensions.

Unlike GANs, SIG has a NF structure and allows efficient likelihood evaluations that can be used in downstream tasks. While SIG has a deep neural network architecture, the approach deviates significantly from the current deep learning paradigm, as it does not use concepts such as mini-batching, stochastic gradient descent, gradient back-propagation through deep layers, or non-convex loss function optimization. SIG is very insensitive to hyper-parameter tuning, making it a useful generator tool for ML experts and non-experts alike.

Source: Sliced Iterative Normalizing FlowsSee Code · biweidai/SIG

In Syntology code not checked for this name. The lookup matched a different name in Syntology's graph, 'Spatial Intelligence Grid (SIG)' (resolution: alias), and its answer is about that name only, so it does not say whether this method has code. The archive credits no paper with an arXiv id for this method, so whether this answer (about arXiv:2510.21160) is about this method is not checked.

Origin paper of this answer, arXiv:2510.21160 (its page on Syntology).

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: 17 · with a code link: 9 · where Syntology ran a sample: 3 (1 with a run with no instrument failure, 2 where every run was a failure of Syntology's instrument) Syntology

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

Page 1 of 1: papers 1 to 17 of 17, 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 32 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 Generation4
Action Recognition1
Autonomous Navigation1
Benchmarking1
C++ code1
CPU1
Deep Learning1
Density Estimation1
Disentanglement1
Diversity1
Domain Adaptation1
Dynamic Time Warping1
Face Recognition1
Fairness1
GPU1
Image Manipulation1
One-Shot Learning1
Out-of-Distribution Detection1
Position1
Prediction1

Usage over time archive 2025-07-28

Papers per year tagged with SIG: 2020 to 2025, peak 7 7 0 2020: 1 paper 2020 2021: 2 papers 2021 2022: 2 papers 2022 2023: 7 papers 2023 2024: 3 papers 2024 2025: 2 papers 2025
Papers per year the archive tags with this method, by the paper's archive date (17 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

Generative 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