Methods › Computer Vision › Generative Video Models › DVD-GAN

DVD-GAN

1 paper tagged archive 2025-07-28

Introduced by Aidan Clark et al. in Adversarial Video Generation on Complex Datasets

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

DVD-GAN is a generative adversarial network for video generation built upon the BigGAN architecture.

DVD-GAN uses two discriminators: a Spatial Discriminator 𝒟_S and a Temporal Discriminator 𝒟_T. 𝒟_S critiques single frame content and structure by randomly sampling k full-resolution frames and judging them individually. The temporal discriminator 𝒟_T must provide G with the learning signal to generate movement (not evaluated by 𝒟_S).

The input to G consists of a Gaussian latent noise z ∼N(0, I) and a learned linear embedding e(y) of the desired class y. Both inputs are 120-dimensional vectors. G starts by computing an affine transformation of [z; e(y)] to a [4, 4, ch₀]-shaped tensor. [z; e(y)] is used as the input to all class-conditional Batch Normalization layers throughout G. This is then treated as the input (at each frame we would like to generate) to a Convolutional GRU.

This RNN is unrolled once per frame. The output of this RNN is processed by two residual blocks. The time dimension is combined with the batch dimension here, so each frame proceeds through the blocks independently. The output of these blocks has width and height dimensions which are doubled (we skip upsampling in the first block). This is repeated a number of times, with the output of one RNN + residual group fed as the input to the next group, until the output tensors have the desired spatial dimensions.

The spatial discriminator 𝒟_S functions almost identically to BigGAN’s discriminator. A score is calculated for each of the uniformly sampled k frames (default k = 8) and the 𝒟_S output is the sum over per-frame scores. The temporal discriminator 𝒟_T has a similar architecture, but pre-processes the real or generated video with a 2 ×2 average-pooling downsampling function ϕ. Furthermore, the first two residual blocks of 𝒟_T are 3-D, where every convolution is replaced with a 3-D convolution with a kernel size of 3 ×3 ×3. The rest of the architecture follows BigGAN.

PaperSource

In Syntology name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.

Near matches the lookup lists, each a different name: GT-GAN; IG-GAN; PD-GAN; FD-GAN; DVD-CL; DE-GAN; PR-GAN; CA-GAN.

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

Show: all tagged papersonly where code ran: none of the 1 tagged papers has a Syntology run on record

Page 1 of 1: paper 1 of 1, 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

3 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
3D Character Animation From A Single Photo1
Video Generation1
Video Prediction1

Usage over time archive 2025-07-28

Papers per year tagged with DVD-GAN: 2019 to 2019, peak 1 1 0 2019: 1 paper 2019
Papers per year the archive tags with this method, by the paper's archive date (1 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 Video ModelsGenerative Adversarial NetworksGenerative 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