arXiv AI
Jun 8
Scalable GANs with Transformers
arXiv:2509. 24935v3 Announce Type: replace-cross Abstract: Scalability has driven recent advances in generative modeling, yet its principles remain underexplored for adversarial learning.
NextGAN: Towards Simple and Scalable GAN Training for Image and Video Generation
NextGAN introduces a new training approach for GANs that regresses the critic’s input gradient onto displacements between paired reference and generated features in frozen representation spaces, effectively adding a gradient‑energy penalty while keeping the generator’s standard update. This method scales to very large pre‑trained image and video generators (up to 14 B parameters) without extra losses or teacher signals, achieving state‑of‑the‑art one‑step FIDs on ImageNet and superior VBench scores for text‑to‑video generation with a single 1.3 B model.
Related stories
arXiv Machine Learning
Aug 27
Continuous Adversarial Flow Models
The paper introduces continuous adversarial flow models, a continuous-time flow framework trained with an adversarial objective that replaces the fixed mean-squared-error criterion of flow matching. By incorporating a learned discriminator, the method guides training toward a different generalized distribution, yielding samples more closely aligned with the target data distribution. Applied as a post‑training step, it markedly improves ImageNet 256px generation metrics—reducing the guidance‑free FID of latent‑space SiT from 8.26 to 3.63 and of pixel‑space JiT from 7.17 to 3.57—and also enhances guided generation and text‑to‑image benchmarks.
arXiv Machine Learning
Aug 12
Deciding When to Switch: E-Processes for Adaptive Minimax Training for Generative Adversarial Nets
arXiv:2608. 10096v1 Announce Type: cross Abstract: Modern data science increasingly gives rise to hypothesis-testing problems that are not naturally formulated in terms of parameters within prespecified statistical models.
arXiv Machine Learning
Sep 22
When Does Adversarial Refinement Help? A Negative Result and Open Problem in Adapting R3GAN to Time Series Imputation
The paper investigates whether the stable GAN architecture R3GAN can improve time‑series imputation when adapted to 1‑D temporal data. Using a coarse‑to‑fine refinement framework and a frequency‑domain discriminator, the authors evaluate 14 saved configurations across three datasets and find a negative result: most configurations either show negligible improvement or degrade performance compared to baseline methods. The study highlights that the usual argument—GANs optimize distributional objectives rather than point‑wise ones—does not fully explain the lack of benefit, and it poses an open problem regarding why a learned discriminator fails to provide useful refinement gradients while diffusion denoisers succeed, offering practical guidance on when adversarial refinement may be worthwhile.
arXiv Computer Vision
Oct 1
Enhancing Autoregressive Video Generation via Representation Adversarial Distillation
arXiv:2609.40037v1 Announce Type: new Abstract: Few-step autoregressive video generation enables efficient streaming synthesis, but errors introduced in early temporal blocks are reused as context an...
arXiv Machine Learning
Sep 22
EmbeddGAN: A Novel GAN Framework Using an Embedding Network and Gini Distance Correlation
EmbeddGAN introduces a new GAN framework that replaces the traditional discriminator with an embedding network trained to maximize statistical dependence between embeddings and real/fake labels using Gini distance correlation (gCor). The generator simultaneously minimizes this dependence, encouraging real and generated samples to become indistinguishable in the learned low‑dimensional embedding space. Experiments on MNIST, CIFAR‑10, and CelebA show competitive performance and notably more stable training dynamics compared to established baselines.
arXiv Machine Learning
Oct 23
Revisiting GAN with Bayes-Optimal Discrimination
The paper reexamines GAN training by replacing the traditional cross‑entropy discriminator with an upper bound on the Bayes error rate, using the Bayes optimal learning threshold (BOLT) loss. It shows that, with balanced class priors, the resulting adversarial game is equivalent to minimizing total variation between data and generator distributions, and introduces BOLT‑GAN when the discriminator is constrained to be 1‑Lipschitz. Experiments on four image‑generation benchmarks demonstrate that BOLT‑GAN achieves better sample quality and coverage than WGAN‑GP, reducing FID scores on CIFAR‑10 and LSUN Bedroom‑64 within a 20‑epoch budget.
arXiv Machine Learning
Aug 21
Continuous Adversarial MeanFlow Transfer
arXiv:2608. 19540v1 Announce Type: new Abstract: Training fast generators on new domains with limited data remains challenging for two reasons.
Hugging Face Trending Papers
Aug 20
Continuous Adversarial MeanFlow Transfer
Training fast generators on new domains with limited data remains challenging for two reasons. First, adapting a pretrained diffusion or flow model to a new domain leaves its costly multi-step sampling unaddressed, and existing acceleration methods are tied to the source parameterization--$ε$, $x$, $v$, or $u$--leaving heterogeneous pretrained models with no common acceleration target.
arXiv Machine Learning
Jul 7
Fortifying Fully Convolutional Generative Adversarial Networks for Image Super-Resolution Using Divergence Measures
arXiv:2404. 06294v2 Announce Type: replace-cross Abstract: Super-Resolution (SR) is a time-hallowed image processing problem that aims to improve the quality of a Low-Resolution (LR) sample up to the standard of its High-Resolution (HR) counterpart.
arXiv Computer Vision
Sep 25
ViRDM: Taming Representation Distribution Matching for Few-Step Causal Video Generation
ViRDM is a new post‑training method for few‑step causal video generation that eliminates the need for a large teacher model and an online critic. By applying representation distribution matching (RDM) with a precomputed target distribution, a lightweight VAE decoder, and staged vector–Jacobian products, ViRDM overcomes memory, optimization, and temporal dynamics challenges. The approach reduces GPU memory usage and training time, achieving state‑of‑the‑art VBench performance with only 20 generator updates and 16 A100 GPU‑hours.
arXiv Machine Learning
Jun 30
A Conditional GAN for Tabular Data Generation with Probabilistic Sampling of Latent Subspaces
arXiv:2508. 00472v2 Announce Type: replace Abstract: The tabular form constitutes the standard way of representing data in relational database systems and spreadsheets.